Solution of a fractional combinatorial optimization problem by mixed integer programming.
Alain BillionnetKarima DjebaliPublished in: RAIRO Oper. Res. (2006)
Keyphrases
- combinatorial optimization
- mixed integer programming
- column generation
- branch and bound
- branch and bound algorithm
- lagrangian relaxation
- combinatorial optimization problems
- mixed integer
- metaheuristic
- traveling salesman problem
- simulated annealing
- optimal solution
- mathematical programming
- optimization problems
- lot sizing
- dantzig wolfe decomposition
- integer programming
- set partitioning
- production planning
- valid inequalities
- max flow min cut
- greedy algorithm
- cost function
- special case