Solving the combinatorial double auction problem

Article Abstract:

Of late, various types of combinatorial (double) auctions are used in business-to-business trading. The superiority of the branch-and-bound method is contrasted to the proposed intelligent search method, to solve the combinatorial double auction problems.

Analysis, Comparative analysis, Combinatorial analysis, Search theory, Branch and bound algorithms

---

Pricing combinatorial auctions

Article Abstract:

Several approaches which provides incentive compatibility and imputed, individual prices for combinatorial auctions are given. The relationships between the approaches and advantages and disadvantages are analyzed.

Commodity & service prices, Prices and rates, Company pricing policy

---

Fluid dynamics models and their applications in transportation and pricing

Article Abstract:

Applications of fluid dynamics models in traffic equilibrium and pricing problem are analyzed. Its application in supply chain management is also examined.

Models, Fluid dynamics, Supply chains, Travel time (Traffic engineering)

Similar abstracts:

• Abstracts: Determining optimal pollution control policies: an application of bilevel programming. A probabilistic solution-generator for simulation
• Abstracts: Searching for Mutually Orthogonal Latin Squares via integer and constraint programming. Flight test data cycle map optimization
• Abstracts: Innovation, network services and the restructuring of work organisation in customer services. Innovation, consumption and services: encapsulation and the combinatorial role of services
• Abstracts: A Steiner arborescence model for the feeder reconfiguration in electric distribution networks. Solving a fuel delivery problem by heuristic and exact approaches
• Abstracts: Stochastic programming with fuzzy linear partial information on probability distribution

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.