On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims.
Moustapha DiabyMark H. KarwanLei SunPublished in: CoRR (2019)
Keyphrases
- linear program
- linear programming
- hard combinatorial optimization problems
- stochastic programming
- simplex method
- dynamic programming
- semi infinite
- optimal solution
- primal dual
- integer program
- linear programming problems
- column generation
- combinatorial optimization
- mixed integer linear program
- combinatorial problems
- linear inequalities
- ant colony optimisation
- objective function
- extreme points
- particle swarm optimization
- machine learning