Approximation algorithms for supply chain planning and logistics problems with market choice
type: Item
instance of: scholarly article
title: Approximation algorithms for supply chain planning and logistics problems with market choice
zbMATH Open document ID: 1229.90011
author: Joseph Geunes
author: Retsef Levi
author: H. Edwin Romeijn
author: David B. Shmoys
published in: Mathematical Programming. Series A. Series B
publication date: 2011-11-23T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5977605
zbMATH Keywords: approximation algorithm
zbMATH Keywords: linear programming
zbMATH Keywords: inventory management
zbMATH Keywords: facility location
MaRDI profile type: Publication
full work available at URL: s10107-009-0310-9
OpenAlex ID: W2071057992
cites work: Improved Algorithms for Economic Lot Size Problems
cites work: Computational complexity of uncapacitated multi-echelon production planning problems
cites work: The prize collecting traveling salesman problem
cites work: Uncapacitated lot-sizing: The convex hull of solutions
cites work: Multiprocessor Scheduling with Rejection
cites work: On dependent randomized rounding algorithms
cites work: A note on the prize collecting traveling salesman problem
cites work: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
cites work: Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
cites work: Algorithms for facility location problems with outliers. (Extended abstract)
cites work: Q4252386
cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
cites work: A threshold of ln n for approximating set cover
cites work: Requirements Planning with Pricing and Order Selection Flexibility
cites work: A General Approximation Technique for Constrained Forest Problems
cites work: A dual algorithm for the economic lot-sizing problem
cites work: Q4139966
cites work: Inventory and Facility Location Models with Market Selection
cites work: Primal-Dual Algorithms for Deterministic Inventory Problems
cites work: A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
cites work: Integer Programming and Combinatorial Optimization
cites work: Comparison methods for stochastic models and risks
cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
cites work: Integrated market selection and production planning: complexity and solution approaches
cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
DOI: 10.1007/S10107-009-0310-9
description: scientific article; zbMATH DE number 5977605