Solving multiple scenarios in a combinatorial auction

DOI10.1016/J.COR.2008.12.006zbMATH Open1160.91339OpenAlexW2073825800MaRDI QIDQ1017447FDOQ1017447

Authors: J. Martínez 

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

Recommendations

• A combinatorial auction improves school meals in Chile: a case of OR in developing countries
• Auctions with bidder-determined allowable combinations
• Combinatorial auctions. Foreword by Vernon L. Smith.
• Combinatorial auction design
• Solving the combinatorial double auction problem

zbMATH Keywords

integer programmingcombinatorial auctionpublic policy

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Integer programming (90C10)

Cites Work

• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• A Greedy Heuristic for the Set-Covering Problem
• Local branching
• Computationally manageable combinational auctions
• Solving Large-Scale Zero-One Linear Programming Problems
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Variable neighborhood search and local branching
• Combinatorial auctions. Foreword by Vernon L. Smith.
• A note on some computationally difficult set covering problems
• Title not available (Why is that?)
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• A combinatorial auction improves school meals in Chile: a case of OR in developing countries
• A multi-start local search heuristic for ship scheduling -- a computational study
• A branch-and-price algorithm and new test problems for spectrum auctions

Cited In (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

• CABOB

This page was built for publication: Solving multiple scenarios in a combinatorial auction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017447)