Pages that link to "Item:Q859947"
From MaRDI portal
The following pages link to Exact algorithms for procurement problems under a total quantity discount structure (Q859947):
Displaying 28 items.
- Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs (Q326228) (← links)
- Supplier selection and procurement decisions with uncertain demand, fixed selection costs and quantity discounts (Q336606) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- The freight allocation problem with lane cost balancing constraint (Q439318) (← links)
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
- A multi-objective quantity discount and joint optimization model for coordination of a single-buyer multi-vendor supply chain (Q662246) (← links)
- Scatter search algorithm for supplier selection and order lot sizing under multiple price discount environment (Q834195) (← links)
- Exact methods for combinatorial auctions. (Abstract of Thesis) (Q926565) (← links)
- Exact algorithms for the matrix bid auction (Q958442) (← links)
- A modified Pareto genetic algorithm for multi-objective build-to-order supply chain planning with product assembly (Q994251) (← links)
- An efficient optimal algorithm for the quantity discount problem in material requirement planning (Q1000957) (← links)
- The transportation problem with exclusionary side constraints (Q1022437) (← links)
- Incorporating quantity discounts and their inventory impacts into the centralized purchasing decision (Q1037688) (← links)
- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty (Q1628038) (← links)
- On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization (Q1686496) (← links)
- Optimal pricing in iterative flexible combinatorial procurement auctions (Q1740561) (← links)
- A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale (Q1762169) (← links)
- An exact algorithm for the capacitated total quantity discount problem (Q1926936) (← links)
- Linearization technique with superior expressions for centralized planning problem with discount policy (Q2137652) (← links)
- The distance constrained multiple vehicle traveling purchaser problem (Q2256245) (← links)
- Compact bidding languages and supplier selection for markets with economies of scale and scope (Q2275626) (← links)
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts (Q2307262) (← links)
- A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry (Q2312332) (← links)
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← links)
- The optimization of lot sizing with supplier selection problem in multi-echelon defective supply chain network (Q3168284) (← links)
- A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty (Q5499840) (← links)
- Minimum cost flow problem with conflicts (Q6065835) (← links)
- Comprehensive quantity discount model for dynamic green supplier selection and order allocation (Q6068701) (← links)
