Convex hull results for generalizations of the constant capacity single node flow set
From MaRDI portal
Publication:2020609
DOI10.1007/s10107-020-01481-6zbMath1465.90049OpenAlexW2946237149MaRDI QIDQ2020609
Hande Yaman, Laurence A. Wolsey
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
convex hullsingle node flow setextended formulationFourier-Motzkin eliminationflow cover inequalitieslot-sizing with sales
Cites Work
- Unnamed Item
- Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
- Four equivalent lot-sizing models
- Valid inequalities for mixed 0-1 programs
- The complementary class of generalized flow cover inequalities
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Convex hull results for the warehouse problem
- On capacitated network design cut-set polyhedra
- The single-item lot-sizing problem with immediate lost sales
- Lot-sizing with production and delivery time windows
- Dynamic Version of the Economic Lot Size Model
- Network Formulations of Mixed-Integer Programs
- Uncapacitated lot-sizing: The convex hull of solutions
- Valid Linear Inequalities for Fixed Charge Problems
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem
- Production Planning by Mixed Integer Programming
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- The uncapacitated lot-sizing problem with sales and safety stocks
- Flow pack facets of the single node fixed-charge flow polytope
