On the convex hull of feasible solutions to certain combinatorial problems.
Maurice QueyranneYaoguang WangPublished in: Oper. Res. Lett. (1992)
Keyphrases
- convex hull
- combinatorial problems
- feasible solution
- constraint programming
- metaheuristic
- constraint satisfaction problems
- traveling salesman problem
- mixed integer
- combinatorial optimization
- phase transition
- constraint satisfaction
- global constraints
- branch and bound algorithm
- convex sets
- lagrangian relaxation
- valid inequalities
- feasible set
- extreme points
- neural network
- ant colony optimization
- optimal solution
- tabu search
- training samples
- np complete
- linear programming
- multi objective
- lower bound
- minimum distance
- linear programming relaxation
- data sets