A characterisation of all feasible solutions to an integer program.
H. Paul WilliamsPublished in: Discret. Appl. Math. (1983)
Keyphrases
- feasible solution
- integer program
- linear programming
- linear program
- column generation
- integer programming
- optimal solution
- linear programming relaxation
- network flow
- objective function
- tabu search
- lagrangian relaxation
- cutting plane
- mathematical model
- valid inequalities
- convex hull
- mixed integer
- solution quality
- lp relaxation
- mixed integer program
- primal dual
- solution space
- dynamic programming
- branch and bound
- np hard
- extreme points
- genetic algorithm
- test problems
- constraint programming
- simulated annealing
- cost function
- multi objective
- search algorithm
- integer solution