Branch-and-cut for combinatorial optimization problems without auxiliary binary variables.
Ismael R. de Farias Jr.Ellis L. JohnsonGeorge L. NemhauserPublished in: Knowl. Eng. Rev. (2001)
Keyphrases
- combinatorial optimization problems
- binary variables
- knapsack problem
- linear programming relaxation
- dynamic programming
- optimization problems
- optimal solution
- np hard
- limited memory
- metaheuristic
- combinatorial optimization
- greedy algorithm
- production planning
- energy function
- random variables
- continuous variables
- state space
- neural network
- linear constraints
- memory space
- probability distribution
- image segmentation