Compactness and Flow Minimization Requirements in Reforestation Initiatives: An Integer Programming (IP) Formulation.
Pablo VanegasDirk CattrysseJos Van OrshovenPublished in: ICCSA (1) (2009)
Keyphrases
- integer programming
- valid inequalities
- set partitioning
- integer program
- cutting plane algorithm
- integer programming formulations
- np hard
- linear programming relaxation
- linear programming
- column generation
- ai planning
- constraint programming
- dantzig wolfe decomposition
- lp relaxation
- production planning
- lagrangian relaxation
- set covering
- network flow
- cutting plane
- facility location
- inference problems
- set covering problem
- objective function
- vehicle routing problem with time windows
- transportation problem
- regularization term