New valid inequalities for the fixed-charge and single-node flow polytopes

DOI10.1016/j.orl.2019.06.005zbMath1476.90355OpenAlexW2953909241MaRDI QIDQ2294335

Georgia Souli, Adam N. Letchford

Publication date: 10 February 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/135003/1/single_node_flow.pdf

zbMATH Keywords

branch-and-cutmixed-integer linear programmingpolyhedral combinatorics

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

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

Cites Work

• Cover and pack inequalities for (mixed) integer programming
• Valid inequalities for mixed 0-1 programs
• The complementary class of generalized flow cover inequalities
• On the \(0/1\) knapsack polytope
• On certain polytopes associated with graphs
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• Sequence independent lifting in mixed integer programming
• Separation algorithms for 0-1 knapsack polytopes
• Polyhedral Approaches to Mixed Integer Linear Programming
• Fifty-Plus Years of Combinatorial Integer Programming
• Valid Linear Inequalities for Fixed Charge Problems
• Faces for a linear inequality in 0–1 variables
• Facets of the knapsack polytope
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Flow pack facets of the single node fixed-charge flow polytope