Exact algorithms for procurement problems under a total quantity discount structure
From MaRDI portal
Publication:859947
DOI10.1016/J.EJOR.2006.03.010zbMATH Open1107.90043OpenAlexW2139042266MaRDI QIDQ859947FDOQ859947
Authors: A. J. T. Maas, Frits C. R. Spieksma, J. J. van de Klundert, 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
Recommendations
- An exact algorithm for the capacitated total quantity discount problem
- Allocating procurement to capacitated suppliers with concave quantity discounts
- Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes
- Optimal Order Allocation with Discount Pricing
- Supplier selection and procurement decisions with uncertain demand, fixed selection costs and quantity discounts
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Auctions, bargaining, bidding and selling, and other market models (91B26)
Cites Work
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- 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
- Title not available (Why is that?)
- An evaluation of vendor selection models from a total cost of ownership perspective
- Approximation of the supply scheduling problem
- Title not available (Why is that?)
- Bid evaluation in procurement auctions with piecewise linear supply curves
- The deterministic multi-item dynamic lot size problem with joint business volume discount
- Title not available (Why is that?)
- Approximation and Online Algorithms
Cited In (34)
- 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
- 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
- Optimal pricing in iterative flexible combinatorial procurement auctions
- Allocating procurement to capacitated suppliers with concave quantity discounts
- Linearization technique with superior expressions for centralized planning problem with discount policy
- Optimal Order Allocation with Discount Pricing
- A modified Pareto genetic algorithm for multi-objective build-to-order supply chain planning with product assembly
- An effective matheuristic for the capacitated total quantity discount problem
- Minimum cost flow problem with conflicts
- Comprehensive quantity discount model for dynamic green supplier selection and order allocation
- The transportation problem with exclusionary side constraints
- 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
- The optimization of lot sizing with supplier selection problem in multi-echelon defective supply chain network
- On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization
- Incorporating quantity discounts and their inventory impacts into the centralized purchasing decision
- An efficient optimal algorithm for the quantity discount problem in material requirement planning
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
- Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes
- The freight allocation problem with lane cost balancing constraint
- A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty
- Exact algorithms for the matrix bid auction
- 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
- An exact algorithm for the capacitated total quantity discount problem
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
- Exact methods for combinatorial auctions. (Abstract of Thesis)
- Branch-and-cut algorithms for winner determination in discount auctions
- A multi-objective quantity discount and joint optimization model for coordination of a single-buyer multi-vendor supply chain
- A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry
- Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions
- The distance constrained multiple vehicle traveling purchaser problem
This page was built for publication: Exact algorithms for procurement problems under a total quantity discount structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859947)
