A provably convergent heuristic for stochastic bicriteria integer programming.
Walter J. GutjahrPublished in: J. Heuristics (2009)
Keyphrases
- integer programming
- bicriteria
- integer linear programming
- provably convergent
- column generation
- cutting plane
- lagrangian relaxation
- set covering
- set covering problem
- efficient solutions
- shape from shading
- np hard
- linear programming
- mixed integer programming
- global constraints
- knapsack problem
- optimal solution
- integer programming formulations
- constraint programming
- production planning
- heuristic methods
- network flow
- integer program
- shortest path problem
- valid inequalities
- flowshop
- search algorithm
- approximation algorithms
- feasible solution
- linear program
- constraint satisfaction
- graphical models
- scheduling problem
- lower bound