Approximation algorithms for supply chain planning and logistics problems with market choice
From MaRDI portal
Publication:647392
DOI10.1007/s10107-009-0310-9zbMath1229.90011OpenAlexW2071057992MaRDI QIDQ647392
David B. Shmoys, H. Edwin Romeijn, Joseph Geunes, Retsef Levi
Publication date: 23 November 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0310-9
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Approximation algorithms (68W25)
Related Items
An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties, From Cost Sharing Mechanisms to Online Selection Problems, Approximation algorithms for the fault-tolerant facility location problem with penalties, Approximation algorithms for prize-collecting capacitated network design problems, On the transportation problem with market choice, A per-scenario bound for the two-stage stochastic facility location problem with linear penalty, Supply Chain Management with Online Customer Selection, A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties, Approximation algorithms for the transportation problem with market choice and related models, On a cardinality-constrained transportation problem with market choice, Improved approximation algorithms for the facility location problems with linear/submodular penalties, Approximation Algorithms for a Class of Stochastic Selection Problems with Reward and Cost Considerations, Joint client selection and contract design for a risk-averse commodity broker in a two-echelon supply chain, Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree, Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties), Concave connection cost facility location and the star inventory routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the prize collecting traveling salesman problem
- Integrated market selection and production planning: complexity and solution approaches
- Computational complexity of uncapacitated multi-echelon production planning problems
- A dual algorithm for the economic lot-sizing problem
- On dependent randomized rounding algorithms
- Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
- A threshold of ln n for approximating set cover
- Uncapacitated lot-sizing: The convex hull of solutions
- Requirements Planning with Pricing and Order Selection Flexibility
- Inventory and Facility Location Models with Market Selection
- The prize collecting traveling salesman problem
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Improved Algorithms for Economic Lot Size Problems
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- A General Approximation Technique for Constrained Forest Problems
- Multiprocessor Scheduling with Rejection
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Integer Programming and Combinatorial Optimization
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
