A Hybrid Genetic / Branch and Bound Algorithm for Integer Programming.
Alan P. FrenchAndrew C. RobinsonJohn M. WilsonPublished in: ICANNGA (1997)
Keyphrases
- hybrid genetic
- branch and bound algorithm
- integer programming
- np hard
- lower bound
- optimal solution
- set covering problem
- branch and bound
- linear programming
- upper bound
- np complete
- lagrangian relaxation
- approximation algorithms
- network flow
- support vector regression
- production planning
- special case
- cutting plane
- upper bounding
- modeling method
- scheduling problem
- constraint programming
- integer program
- valid inequalities
- column generation
- combinatorial optimization
- set covering
- vehicle routing problem
- max sat
- knapsack problem
- computational complexity
- network design problem
- linear programming relaxation
- constraint satisfaction problems
- knn
- model selection
- cost function
- global constraints
- objective function