An effective matheuristic for the capacitated total quantity discount problem
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 956852 (Why is no real title available?)
- A branch-and-bound-based local search method for the flow shop problem
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- A heuristic approach for the travelling purchaser problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
- A new ILP-based refinement heuristic for vehicle routing problems
- A proposal for a hybrid meta-strategy for combinatorial optimization problems
- An exact algorithm for the capacitated total quantity discount problem
- An integer linear programming local search for capacitated vehicle routing problems
- Capacitated Multiple Item Ordering with Incremental Quantity Discounts
- Dynamic tabu search strategies for the traveling purchaser problem
- Exact algorithms for procurement problems under a total quantity discount structure
- Exploring greedy criteria for the dynamic traveling purchaser problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Heuristics for sourcing from multiple suppliers with alternative quantity discounts
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Kernel search: a new heuristic framework for portfolio selection
- Local branching
- Quantity discount decisions under conditions of multiple items, multiple suppliers and resource limitations
- The concave cost supply problem.
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- The traveling purchaser problem with budget constraint
- Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
- Variable neighborhood decomposition search
- Vendor selection criteria and methods
Cited in
(11)- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- Comprehensive quantity discount model for dynamic green supplier selection and order allocation
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
- Parameter tuning for local-search-based matheuristic methods
- Construction and analysis of contract feasible set under quantity‐discount contract
- The traveling purchaser problem and its variants
- Optimal pricing and inventory strategies with multiple price markdowns over time
- A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry
- Utilizing multi-vehicle traveling purchaser problem for multiple-supplier selection and multi-period lot-sizing in a fuzzy demand environment
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)
