Name
Abstract | ||
|---|---|---|
We consider a procurement problem where suppliers offer concave quantity discounts. The resulting continuous knapsack problem involves the minimization of a sum of separable concave functions. We identify polynomially solvable special cases of this NP-hard problem, and provide a fully polynomial-time approximation scheme for the general problem. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.orl.2007.04.001 | Oper. Res. Lett. |
Keywords | Field | DocType |
concave quantity discount,allocating procurement,general problem,procurement problem,polynomially solvable special case,polynomial-time approximation scheme,np-hard problem,capacitated supplier,separable concave function,continuous knapsack problem,approximation algorithms,np hard problem,knapsack problem,fully polynomial time approximation scheme,nonlinear programming | Approximation algorithm,Mathematical optimization,Combinatorics,Nonlinear programming,Concave function,Continuous knapsack problem,Minification,Knapsack problem,Time complexity,Procurement,Mathematics | Journal |
Volume | Issue | ISSN |
36 | 1 | Operations Research Letters |
Citations | PageRank | References |
4 | 0.48 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gerard J. Burke | 1 | 104 | 6.24 |
| Joseph Geunes | 2 | 308 | 28.72 |
| H. Edwin Romeijn | 3 | 769 | 83.88 |
| Asoo J. Vakharia | 4 | 458 | 34.85 |