On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets.
Kiavash KianfarPublished in: Discret. Appl. Math. (2012)
Keyphrases
- network flow problem
- mixed integer
- multi commodity
- totally unimodular
- integer solution
- facility location
- sufficient conditions
- knapsack problem
- lot sizing
- optimal solution
- integer variables
- flow patterns
- multimedia retrieval
- multimedia information retrieval
- multi source
- minimum cost
- vehicle routing problem
- post processing
- upper bound
- dynamic programming
- np hard
- production inventory
- cover inequalities
- facility location problem
- binary variables
- network design problem
- real numbers
- single source