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

DOI10.1016/J.ORL.2019.06.005MaRDI QIDQ2294335zbMATH OpenOpenAlexFDO

Authors Adam N. Letchford, Georgia Souli

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)

Recommendations

• Lifted Euclidean inequalities for the integer single node flow set with upper bounds
• Convex hull results for generalizations of the constant capacity single node flow set
• Valid inequalities and separation for capacitated fixed charge flow problems
• Polyhedral description of the integer single node flow set with constant bounds
• Polyhedral results on single node variable upper-bound flow models with allowed configurations
• On maximum flows in polyhedral domains
• On the properties of a flow polyhedron and their applications in the numerical solution of extremal problems on graphs
• scientific article; zbMATH DE number 3952461
• Quadratic diameter bounds for dual network flow polyhedra
• 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
• Faces for a linear inequality in 0–1 variables
• Facets of the knapsack polytope
• Fifty-plus years of combinatorial integer programming
• Flow pack facets of the single node fixed-charge flow polytope
• Lifted flow cover inequalities for mixed 0-1 integer programs
• On certain polytopes associated with graphs
• On the \(0/1\) knapsack polytope
• Polyhedral approaches to mixed integer linear programming
• Separation algorithms for 0-1 knapsack polytopes
• Sequence independent lifting in mixed integer programming
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• The complementary class of generalized flow cover inequalities
• Valid inequalities for mixed 0-1 programs
• Valid Linear Inequalities for Fixed Charge Problems

Cited in

(9)

• Valid inequalities for mixed 0-1 programs
• Valid inequalities and separation for capacitated fixed charge flow problems
• 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
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
• scientific article; zbMATH DE number 4045479 (Why is no real title available?)
• Flow pack facets of the single node fixed-charge flow polytope
• Enhancing the separation of rank-1 Chvátal-Gomory cuts from knapsack sets
• Polyhedral results on single node variable upper-bound flow models with allowed configurations

This page was built for publication: New valid inequalities for the fixed-charge and single-node flow polytopes

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