A pseudopolynomial network flow formulation for exact knapsack separation

This publication has 9 references indexed in Scilit:

• Using separation algorithms to generate mixed integer model reformulations
  Operations Research Letters, 1991
• Strong formulations for mixed integer programming: A survey
  Mathematical Programming, 1989
• Integer and Combinatorial Optimization
  Published by Wiley ,1988
• Geometric Algorithms and Combinatorial Optimization
  Published by Springer Nature ,1988
• Lot-size models with backlogging: Strong reformulations and cutting planes
  Mathematical Programming, 1988
• Strong Formulations for Multi-Item Capacitated Lot Sizing
  Management Science, 1984
• Modelling with integer variables
  Published by Springer Nature ,1984
• The perfectly matchable subgraph polytope of a bipartite graph
  Networks, 1983
• Solving Large-Scale Zero-One Linear Programming Problems
  Operations Research, 1983