Exact algorithms for procurement problems under a total quantity discount structure
From MaRDI portal
Publication:859947
DOI10.1016/j.ejor.2006.03.010zbMath1107.90043OpenAlexW2139042266MaRDI QIDQ859947
A. J. T. Maas, J. J. van de Klundert, Frits C. R. Spieksma, Dries R. Goossens
Publication date: 22 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/85327
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (28)
Scatter search algorithm for supplier selection and order lot sizing under multiple price discount environment ⋮ New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty ⋮ The optimization of lot sizing with supplier selection problem in multi-echelon defective supply chain network ⋮ Linearization technique with superior expressions for centralized planning problem with discount policy ⋮ Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder ⋮ Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs ⋮ Supplier selection and procurement decisions with uncertain demand, fixed selection costs and quantity discounts ⋮ An effective matheuristic for the capacitated total quantity discount problem ⋮ An exact algorithm for the capacitated total quantity discount problem ⋮ On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization ⋮ Minimum cost flow problem with conflicts ⋮ Comprehensive quantity discount model for dynamic green supplier selection and order allocation ⋮ The freight allocation problem with lane cost balancing constraint ⋮ Exact methods for combinatorial auctions. (Abstract of Thesis) ⋮ Approximation schemes for deal splitting and covering integer programs with multiplicity constraints ⋮ A multi-objective quantity discount and joint optimization model for coordination of a single-buyer multi-vendor supply chain ⋮ Optimal pricing in iterative flexible combinatorial procurement auctions ⋮ Exact algorithms for the matrix bid auction ⋮ The distance constrained multiple vehicle traveling purchaser problem ⋮ A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale ⋮ Compact bidding languages and supplier selection for markets with economies of scale and scope ⋮ A modified Pareto genetic algorithm for multi-objective build-to-order supply chain planning with product assembly ⋮ An efficient optimal algorithm for the quantity discount problem in material requirement planning ⋮ A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts ⋮ The transportation problem with exclusionary side constraints ⋮ A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry ⋮ Incorporating quantity discounts and their inventory impacts into the centralized purchasing decision ⋮ A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An evaluation of vendor selection models from a total cost of ownership perspective
- The deterministic multi-item dynamic lot size problem with joint business volume discount
- Approximation of the supply scheduling problem
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes
- Bid evaluation in procurement auctions with piecewise linear supply curves
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Approximation and Online Algorithms
This page was built for publication: Exact algorithms for procurement problems under a total quantity discount structure