Convex hull results for the warehouse problem

DOI10.1016/j.disopt.2018.06.002zbMath1454.90009OpenAlexW2752255088MaRDI QIDQ1756347

Hande Yaman, Laurence A. Wolsey

Publication date: 14 January 2019

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/49858

zbMATH Keywords

convex hullsingle node flow setextended formulationFourier-Motzkin eliminationflow cover inequalitieswarehouse problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Related Items (1)

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

Cites Work

• On capacitated network design cut-set polyhedra
• On the Theory of Dynamic Programming—A Warehousing Problem
• An Analytic Solution of the Warehouse Problem
• A Note on the Multi-Commodity Warehouse Problem
• Integrated Optimization of Procurement, Processing, and Trade of Commodities
• Optimal Commodity Trading with a Capacitated Storage Asset
• Valid Linear Inequalities for Fixed Charge Problems
• Graph Theory and Integer Programming
• Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
• Decision and Horizon Rules for Stochastic Planning Problems: A Linear Example

This page was built for publication: Convex hull results for the warehouse problem