A Branch-and-Estimate Heuristic Procedure for Solving Nonconvex Integer Optimization Problems.
Prashant PalkarAshutosh MahajanPublished in: IPDPS Workshops (2015)
Keyphrases
- optimization problems
- combinatorial optimization
- metaheuristic
- nonlinear programming
- mip solver
- mixed integer program
- evolutionary algorithm
- objective function
- feasible solution
- constrained problems
- integer solution
- subgradient method
- optimal solution
- knapsack problem
- tabu search
- traveling salesman problem
- cost function
- search procedure
- convex optimization problems
- discrete optimization problems
- exact algorithms
- linear programming relaxation
- branch and bound algorithm
- search heuristics
- dynamic programming
- integer arithmetic
- finding an optimal solution
- timetabling problem
- dantzig wolfe
- simulated annealing
- search algorithm
- integer variables
- mixed integer nonlinear programming
- lagrangian relaxation
- solution quality
- linear programming
- np hard
- multi objective
- variable ordering
- branch and bound search
- optimization criteria
- branch and bound procedure
- cutting plane
- linear constraints
- global optimization
- linear program
- nonlinear optimization problems