Derivation and generation of path-based valid inequalities for transmission expansion planning.
J. Kyle SkolfieldLaura M. EscobarAdolfo R. EscobedoPublished in: Ann. Oper. Res. (2022)
Keyphrases
- valid inequalities
- integer programming
- mixed integer
- cutting plane algorithm
- mixed integer programming
- traveling salesman problem
- mixed integer linear programs
- randomly generated problems
- linear programming
- cutting plane
- lower and upper bounds
- feasible solution
- convex hull
- network design problem
- primal dual
- production planning
- column generation
- linear programming relaxation
- integer programming formulation
- facet defining inequalities
- lagrangian relaxation
- heuristic search
- genetic algorithm
- tabu search
- lower bound
- optimal solution
- branch and bound algorithm
- special case
- dynamic programming
- integer program
- network flow
- knapsack problem