Pages that link to "Item:Q3115457"
From MaRDI portal
The following pages link to A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions (Q3115457):
Displaying 14 items.
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction (Q947956) (← links)
- Solving multiple scenarios in a combinatorial auction (Q1017447) (← links)
- Non-linear anonymous pricing combinatorial auctions (Q1042137) (← links)
- An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy (Q2060427) (← links)
- A hybrid ant colony algorithm for the winner determination problem (Q2130382) (← links)
- Dantzig-Wolfe decomposition and branch-and-price solving in G12 (Q2430361) (← links)
- Combinatorial auctions (Q2480257) (← links)
- Heuristics for a bidding problem (Q2489281) (← links)
- A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
- Location-based techniques for the synergy approximation in combinatorial transportation auctions (Q2629915) (← links)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
- From High-Level Model to Branch-and-Price Solution in G12 (Q5387632) (← links)
- Coordination of manufacturing and engineering activities during product transitions (Q6051587) (← links)