The following pages link to The concave cost supply problem. (Q1810527):
Displaying 17 items.
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem (Q835755) (← links)
- Analysis of fractional covering of some supply management problems (Q853804) (← links)
- Allocating procurement to capacitated suppliers with concave quantity discounts (Q924901) (← links)
- Approximate solution of the control problem of supplies with many intervals and concave cost functions (Q1015342) (← links)
- Approximation of the supply scheduling problem (Q1779701) (← links)
- An exact algorithm for the capacitated total quantity discount problem (Q1926936) (← links)
- The distance constrained multiple vehicle traveling purchaser problem (Q2256245) (← links)
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← links)
- Heuristics for sourcing from multiple suppliers with alternative quantity discounts (Q2462126) (← links)
- Algorithms for solving the single-sink fixed-charge transportation problem (Q2462557) (← links)
- A continuous approach for the concave cost supply problem via DC programming and DCA (Q2473032) (← links)
- (Q3159625) (← links)
- Joint economic production allocation and ordering policies in a supply chain consisting of multiple plants and a single retailer (Q3369513) (← links)
- The orienteering problem with variable profits (Q5326782) (← links)
- Production allocation and shipment policies in a multiple-manufacturer–single-retailer supply chain (Q5489330) (← links)
- Algorithm of Logistic Cost Minimization Under Constraints on Supply Volumes (Q5741346) (← links)
