An effective matheuristic for the capacitated total quantity discount problem
From MaRDI portal
Publication:336744
DOI10.1016/J.COR.2013.07.019zbMATH Open1348.90640OpenAlexW1971331599MaRDI QIDQ336744FDOQ336744
Authors: Daniele Manerba, Renata Mansini 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.07.019
Recommendations
- An exact algorithm for the capacitated total quantity discount problem
- An efficient optimal algorithm for the quantity discount problem in material requirement planning
- An extended algorithm for capacitated multiple item ordering with quantity discounts
- Capacitated Multiple Item Ordering with Incremental Quantity Discounts
- Exact algorithms for procurement problems under a total quantity discount structure
- Rounding procedures for the discrete version of the capacitated economic order quantity problem
- Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
- Improved rounding procedures for the discrete version of the capacitated EOQ problem
- On computing optimal \((Q,r)\) replenishment policies under quantity discounts
- An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Local branching
- A new ILP-based refinement heuristic for vehicle routing problems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- Kernel search: a new heuristic framework for portfolio selection
- Vendor selection criteria and methods
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Variable neighborhood decomposition search
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- An exact algorithm for the capacitated total quantity discount problem
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- The traveling purchaser problem with budget constraint
- Dynamic tabu search strategies for the traveling purchaser problem
- Capacitated Multiple Item Ordering with Incremental Quantity Discounts
- Exploring greedy criteria for the dynamic traveling purchaser problem
- Exact algorithms for procurement problems under a total quantity discount structure
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
- The concave cost supply problem.
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- Heuristics for sourcing from multiple suppliers with alternative quantity discounts
- Quantity discount decisions under conditions of multiple items, multiple suppliers and resource limitations
- An integer linear programming local search for capacitated vehicle routing problems
- A branch-and-bound-based local search method for the flow shop problem
- Title not available (Why is that?)
- Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
- A heuristic approach for the travelling purchaser problem
- A proposal for a hybrid meta-strategy for combinatorial optimization problems
Cited In (10)
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
- Construction and analysis of contract feasible set under quantity‐discount contract
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty
- Optimal pricing and inventory strategies with multiple price markdowns over time
- Comprehensive quantity discount model for dynamic green supplier selection and order allocation
- The traveling purchaser problem and its variants
- Utilizing multi-vehicle traveling purchaser problem for multiple-supplier selection and multi-period lot-sizing in a fuzzy demand environment
- A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry
Uses Software
This page was built for publication: An effective matheuristic for the capacitated total quantity discount problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336744)
