Solving multiple scenarios in a combinatorial auction
type: Item
instance of: scholarly article
title: Solving multiple scenarios in a combinatorial auction
zbMATH Open document ID: 1160.91339
author: J. Martínez
published in: Computers \& Operations Research
publication date: 2009-05-19T00:00:00Z
full work available at URL: http://hdl.handle.net/10533/142613
Mathematics Subject Classification ID: 91B26
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5554736
zbMATH Keywords: combinatorial auction
zbMATH Keywords: integer programming
zbMATH Keywords: public policy
describes a project that uses: CABOB
MaRDI profile type: Publication
OpenAlex ID: W2073825800
cites work: Computationally manageable combinational auctions
cites work: A combinatorial auction improves school meals in Chile: a case of OR in developing countries
cites work: Q3588651
cites work: CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
cites work: A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
cites work: Q4124603
cites work: A note on some computationally difficult set covering problems
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
cites work: Local branching
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Variable neighborhood search and local branching
cites work: A multi-start local search heuristic for ship scheduling -- a computational study
DOI: 10.1016/J.COR.2008.12.006
description: scientific article; zbMATH DE number 5554736