A branch-and-price algorithm and new test problems for spectrum auctions
From MaRDI portal
Publication:3115457
Recommendations
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
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction
- Optimization issues in combinatorial auctions
- 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
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- From High-Level Model to Branch-and-Price Solution in G12
- Heuristics for a bidding problem
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
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)