A branch-and-price algorithm and new test problems for spectrum auctions
DOI10.1287/MNSC.1040.0332zbMATH Open1232.90347OpenAlexW2034747549MaRDI QIDQ3115457FDOQ3115457
Authors: Oktay Günlük, László Ladányi, Sven De Vries 
Publication date: 21 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0c4e06232432aab284022dd6a0a1d3c4ea2aa14f
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Auctions, bargaining, bidding and selling, and other market models (91B26)
Cited In (15)
- A fast approximation algorithm for solving the complete set packing problem
- Combinatorial auctions
- A hybrid ant colony algorithm for the winner determination problem
- Coordination of manufacturing and engineering activities during product transitions
- Location-based techniques for the synergy approximation in combinatorial transportation auctions
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Optimization issues in combinatorial auctions
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction
- An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy
- Solving multiple scenarios in a combinatorial auction
- Non-linear anonymous pricing combinatorial auctions
- From High-Level Model to Branch-and-Price Solution in G12
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Heuristics for a bidding problem
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
Uses Software
This page was built for publication: A branch-and-price algorithm and new test problems for spectrum auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115457)
