On "Exponential Lower Bounds for Polytopes in Combinatorial Optimization" by Fiorini et al. (2015): A Refutation For Models With Disjoint Sets of Descriptive Variables.
Moustapha DiabyMark H. KarwanLei SunPublished in: CoRR (2016)
Keyphrases
- combinatorial optimization
- branch and bound
- lower bound
- branch and bound algorithm
- quadratic assignment problem
- disjoint sets
- combinatorial optimization problems
- simulated annealing
- traveling salesman problem
- metaheuristic
- mathematical programming
- upper bound
- objective function
- probabilistic model
- single machine scheduling problem
- optimization problems
- max flow min cut
- vehicle routing problem
- particle swarm optimization
- potential functions