Convex hull results for generalizations of the constant capacity single node flow set
From MaRDI portal
Publication:2020609
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
Cites work
- scientific article; zbMATH DE number 3185974 (Why is no real title available?)
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Computational Complexity of the Capacitated Lot Size Problem
- Convex hull results for the warehouse problem
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Deterministic Production Planning: Algorithms and Complexity
- Dynamic version of the economic lot size model
- Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
- Flow pack facets of the single node fixed-charge flow polytope
- Four equivalent lot-sizing models
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Lot-sizing with production and delivery time windows
- Network Formulations of Mixed-Integer Programs
- On capacitated network design cut-set polyhedra
- Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
- Production Planning by Mixed Integer Programming
- The complementary class of generalized flow cover inequalities
- The single-item lot-sizing problem with immediate lost sales
- The uncapacitated lot-sizing problem with sales and safety stocks
- Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
- Uncapacitated lot-sizing: The convex hull of solutions
- Valid Linear Inequalities for Fixed Charge Problems
- Valid inequalities for mixed 0-1 programs
Cited in
(6)- The diameters of network-flow polytopes satisfy the Hirsch conjecture
- Convex hull results for the warehouse problem
- 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
- The splittable flow arc set with capacity and minimum load constraints
- Polyhedral description of the integer single node flow set with constant bounds
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)
