scientific article; zbMATH DE number 1342809
From MaRDI portal
Publication:4266754
DOI<463::AID-NAV2>3.0.CO;2-S 10.1002/(SICI)1520-6750(199908)46:5<463::AID-NAV2>3.0.CO;2-SzbMath0934.90003MaRDI QIDQ4266754
Publication date: 16 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items
On reformulations for the one-warehouse multi-retailer problem ⋮ Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem ⋮ The production routing problem: a review of formulations and solution algorithms ⋮ Production planning with order acceptance and demand uncertainty ⋮ Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem ⋮ A heuristic algorithm to solve the one‐warehouse multiretailer problem with an emission constraint ⋮ A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Modeling industrial lot sizing problems: a review ⋮ Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ The warehouse-inventory-transportation problem for supply chains ⋮ MIP formulations and heuristics for two-level production-transportation problems ⋮ The one-warehouse multi-retailer problem: reformulation, classification, and computational results ⋮ The integrated production-inventory-distribution-routing problem ⋮ A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure ⋮ Uncapacitated two-level lot-sizing ⋮ The one-warehouse multiretailer problem with an order-up-to level inventory policy ⋮ Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost ⋮ Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
Cites Work
- Unnamed Item
- Computational complexity of uncapacitated multi-echelon production planning problems
- The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds
- Multi-Echelon Assembly Systems with Nonstationary Demands: Heuristics and Worst Case Performance Bounds
- Bounds and Heuristics for Capacitated Routing Problems
- Minimal forecast horizon procedures for dynamic lot size models
- 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Deterministic Production Planning: Algorithms and Complexity
- 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
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Improved Algorithms for Economic Lot Size Problems
- Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited
- The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A Facilities in Series Inventory Model with Nested Schedules
This page was built for publication:
