Combinatorial Reverse Auction Based on Lagrangian Relaxation.
Fu-Shiung HsiehShih-Min TsaiPublished in: APSCC (2008)
Keyphrases
- lagrangian relaxation
- reverse auction
- integer programming
- lower bound
- branch and bound algorithm
- feasible solution
- dynamic programming
- linear programming
- multi attribute
- np hard
- lower and upper bounds
- column generation
- shortest path
- dual decomposition
- lagrangian heuristic
- linear program
- upper bound
- branch and bound
- cutting plane algorithm
- winner determination
- tabu search
- supply chain
- multi class
- valid inequalities
- group buying
- computational complexity
- dual variables
- objective function