Approximation algorithms for supply chain planning and logistics problems with market choice
From MaRDI portal
Publication:647392
Recommendations
- Inventory and Facility Location Models with Market Selection
- Approximation algorithms for the transportation problem with market choice and related models
- Approximation algorithms for general one-warehouse multi-retailer systems
- Supply and demand selection problems in supply chain planning
- Integrated market selection and production planning: complexity and solution approaches
Cites work
- A constant approximation algorithm for the one-warehouse multiretailer problem
- A dual algorithm for the economic lot-sizing problem
- A General Approximation Technique for Constrained Forest Problems
- A note on 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
- A threshold of ln n for approximating set cover
- Algorithms for facility location problems with outliers. (Extended abstract)
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Comparison methods for stochastic models and risks
- Computational complexity of uncapacitated multi-echelon production planning problems
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures
- scientific article; zbMATH DE number 3568353 (Why is no real title available?)
- scientific article; zbMATH DE number 1305496 (Why is no real title available?)
- Improved Algorithms for Economic Lot Size Problems
- Integer Programming and Combinatorial Optimization
- Integrated market selection and production planning: complexity and solution approaches
- Inventory and Facility Location Models with Market Selection
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Multiprocessor Scheduling with Rejection
- On dependent randomized rounding algorithms
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Requirements Planning with Pricing and Order Selection Flexibility
- The prize collecting traveling salesman problem
- Uncapacitated lot-sizing: The convex hull of solutions
Cited in
(20)- Approximation of the supply scheduling problem
- Approximation algorithms for the transportation problem with market choice and related models
- On a cardinality-constrained transportation problem with market choice
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties
- Joint client selection and contract design for a risk-averse commodity broker in a two-echelon supply chain
- Concave connection cost facility location and the star inventory routing problem
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)
- From cost sharing mechanisms to online selection problems
- Inventory and Facility Location Models with Market Selection
- On the transportation problem with market choice
- Approximation algorithms for a class of stochastic selection problems with reward and cost considerations
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- A per-scenario bound for the two-stage stochastic facility location problem with linear penalty
- Supply chain management with online customer selection
- Approximation algorithms for prize-collecting capacitated network design problems
- Towards global solutions for nonconvex two-stage stochastic programs: a polynomial lower approximation approach
- Approximation algorithms for the parallel-machine customer order scheduling with weighted and submodular rejection penalties
- Improved approximation algorithms for the facility location problems with linear/submodular penalties
This page was built for publication: Approximation algorithms for supply chain planning and logistics problems with market choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647392)
