Valid inequalities and separation for capacitated fixed charge flow problems

DOI10.1016/S0166-218X(99)00164-XMaRDI QIDQ1962074zbMATH OpenOpenAlexFDO

Authors Jan 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)

Recommendations

• Valid inequalities and separation for uncapacitated fixed charge networks
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
• New valid inequalities for the fixed-charge and single-node flow polytopes
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
• Valid Linear Inequalities for Fixed Charge Problems
• Formulations and valid inequalities for the capacitated dispersion problem
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
• Submodularity and valid inequalities in capacitated fixed charge networks
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Capacitated Network Design—Polyhedral Structure and Computation
• Network Design Using Cut Inequalities
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Strong inequalities for capacitated survivable network design problems.
• Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
• The complementary class of generalized flow cover inequalities
• Valid Linear Inequalities for Fixed Charge Problems
• Valid inequalities and facets of the capacitated plant location problem
• Valid inequalities for mixed 0-1 programs

Cited in

(11)

• Valid inequalities and separation for uncapacitated fixed charge networks
• Valid Linear Inequalities for Fixed Charge Problems
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
• Nonconvex, lower semicontinuous piecewise linear optimization
• New valid inequalities for the fixed-charge and single-node flow polytopes
• Flow pack facets of the single node fixed-charge flow polytope
• Submodularity and valid inequalities in capacitated fixed charge networks
• Revue Des Inégalités Valides Pertinentes Aux Problèmes Des Conception De Réseaux
• Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints

This page was built for publication: Valid inequalities and separation for capacitated fixed charge flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962074)