Convex hull results for generalizations of the constant capacity single node flow set

DOI10.1007/S10107-020-01481-6zbMATH Open1465.90049OpenAlexW2946237149MaRDI QIDQ2020609FDOQ2020609

Authors: Laurence A. Wolsey, Hande Yaman 

Publication date: 23 April 2021

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/666184

Recommendations

• Polyhedral description of the integer single node flow set with constant bounds
• Valid inequalities for the single arc design problem with set-ups
• Compact formulations as a union of polyhedra
• Mixing sets linked by bidirected paths
• Sequence independent lifting for mixed integer programs with variable upper bounds

zbMATH Keywords

convex hullextended formulationsingle node flow setFourier-Motzkin eliminationflow cover inequalitieslot-sizing with sales

Mathematics Subject Classification ID

Mixed integer programming (90C11) Production models (90B30)

Cites Work

• Production Planning by Mixed Integer Programming
• Dynamic version of the economic lot size model
• Deterministic Production Planning: Algorithms and Complexity
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• On capacitated network design cut-set polyhedra
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Lot-sizing with production and delivery time windows
• Computational Complexity of the Capacitated Lot Size Problem
• Bounded Production and Inventory Models with Piecewise Concave Costs
• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
• Valid inequalities for mixed 0-1 programs
• The complementary class of generalized flow cover inequalities
• The single-item lot-sizing problem with immediate lost sales
• Valid Linear Inequalities for Fixed Charge Problems
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Flow pack facets of the single node fixed-charge flow polytope
• Uncapacitated lot-sizing: The convex hull of solutions
• Title not available (Why is that?)
• Network Formulations of Mixed-Integer Programs
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• The uncapacitated lot-sizing problem with sales and safety stocks
• Four equivalent lot-sizing models
• Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
• Convex hull results for the warehouse problem
• Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem
• Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems

Cited In (4)

• Polyhedral description of the integer single node flow set with constant bounds
• The diameters of network-flow polytopes satisfy the Hirsch conjecture
• Polyhedral results on single node variable upper-bound flow models with allowed configurations
• New valid inequalities for the fixed-charge and single-node flow polytopes

This page was built for publication: Convex hull results for generalizations of the constant capacity single node flow set

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