The complementary class of generalized flow cover inequalities

DOI10.1016/S0166-218X(97)89210-4zbMath0884.90117OpenAlexW1991886107MaRDI QIDQ1364783

Jan I. A. Stallaert

Publication date: 28 August 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

cutting planespolyhedral theorygeneralized flow cover inequalitiessingle-node structure

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Mixed integer programming (90C11)

Related Items

Knapsack polytopes: a survey, Lifted Euclidean inequalities for the integer single node flow set with upper bounds, Valid inequalities for mixed-integer programmes with fixed charges on sets of variables, Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope, Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, Valid inequalities and separation for capacitated fixed charge flow problems, On the transportation problem with market choice, Convex hull results for generalizations of the constant capacity single node flow set, Flow pack facets of the single node fixed-charge flow polytope, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, New valid inequalities for the fixed-charge and single-node flow polytopes, On the structure of linear programs with overlapping cardinality constraints, On cut-based inequalities for capacitated network design polyhedra, Polyhedral description of the integer single node flow set with constant bounds

Cites Work

• Valid inequalities for mixed 0-1 programs
• Valid Linear Inequalities for Fixed Charge Problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation