Valid inequalities and separation for capacitated fixed charge flow problems

DOI10.1016/S0166-218X(99)00164-XzbMath0947.90079OpenAlexW1975547496MaRDI QIDQ1962074

Jan I. A. Stallaert

Publication date: 30 January 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00164-x

zbMATH Keywords

network designmixed-integer programmingpolyhedral cutscapacitated fixed charge networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Related Items

Nonconvex, lower semicontinuous piecewise linear optimization ⋮ Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints

Cites Work

• Unnamed Item
• Valid inequalities for mixed 0-1 programs
• Valid inequalities and facets of the capacitated plant location problem
• The complementary class of generalized flow cover inequalities
• Valid Linear Inequalities for Fixed Charge Problems
• Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Network Design Using Cut Inequalities
• Capacitated Network Design—Polyhedral Structure and Computation
• Strong inequalities for capacitated survivable network design problems.