Solving multiple scenarios in a combinatorial auction
From MaRDI portal
Publication:1017447
DOI10.1016/j.cor.2008.12.006zbMath1160.91339OpenAlexW2073825800MaRDI QIDQ1017447
Publication date: 19 May 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/142613
Integer programming (90C10) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (6)
Operations research models for coalition structure in collaborative logistics ⋮ A simple and fast algorithm for convex decomposition in relax-and-round mechanisms ⋮ A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction ⋮ An interactive approach for bi-attribute multi-item auctions ⋮ An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization ⋮ An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A multi-start local search heuristic for ship scheduling -- a computational study
- Variable neighborhood search and local branching
- Computationally Manageable Combinational Auctions
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
- A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
- Solving Large-Scale Zero-One Linear Programming Problems
- A note on some computationally difficult set covering problems
- A Greedy Heuristic for the Set-Covering Problem
- A combinatorial auction improves school meals in Chile: a case of OR in developing countries
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
This page was built for publication: Solving multiple scenarios in a combinatorial auction
