On reformulations for the one-warehouse multi-retailer problem

DOI10.1007/s10479-015-2073-4zbMath1334.90083OpenAlexW2280063232MaRDI QIDQ271926

Jesus Ossian Cunha, Rafael A. Melo

Publication date: 20 April 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-2073-4

zbMATH Keywords

production planningvalid inequalitiesmixed-integer programmingextended formulationsone-warehouse multi-retailer

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11)

Related Items (9)

On the computational complexity of uncapacitated multi-plant lot-sizing problems ⋮ Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection ⋮ Integrated lot sizing and blending problems ⋮ Split demand and deliveries in an integrated three-level lot sizing and replenishment problem ⋮ A heuristic algorithm to solve the one‐warehouse multiretailer problem with an emission constraint ⋮ The dynamic-demand joint replenishment problem with approximated transportation costs ⋮ Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure ⋮ Sequential versus integrated optimization: production, location, inventory control, and distribution ⋮ A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The production routing problem: a review of formulations and solution algorithms
• Uncapacitated two-level lot-sizing
• Computational complexity of uncapacitated multi-echelon production planning problems
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• MIP formulations and heuristics for two-level production-transportation problems
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
• A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
• A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
• Primal-Dual Algorithms for Deterministic Inventory Problems
• An integrated approach for production and distribution planning in supply chain management
• Production Planning by Mixed Integer Programming
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach

This page was built for publication: On reformulations for the one-warehouse multi-retailer problem