Abstract
We consider a natural generalization of the knapsack problem and the multiple knapsack problem, which has two phases of packing decisions. In this problem, we have a set of items, several small knapsacks called boxes, and a large knapsack called container. Each item has a size and profit, each box has a size and the container has a capacity. The first phase is to select some items to pack into the boxes, and the second phase is to select the boxes (each includes some packed items) to pack into the container. The total profit of the problem is determined by the items that are selected and packed into the container within some packed box, and the objective is to maximize the total profit. This problem is motivated by various practical applications, e.g., in logistics. It is a generalization of the multiple knapsack problem, and hence is strongly NP-hard. We mainly propose three approximation algorithms for it. Particularly, the first one is a \(\frac{1}{4}\)-approximation algorithm based on its linear programming relaxation; the second one is based on applying the algorithms for the multiple knapsack problem and the knapsack problem, and has an approximation ratio \(\frac{1}{3} - \epsilon \) for any small enough \(\epsilon >0\). We finally provide a polynomial time approximation scheme for this problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24777-7
Wang, Z., Cui, Z.: Combination of parallel machine scheduling and vertex cover. Theoret. Comput. Sci. 460, 10–15 (2012)
Nip, K., Wang, Z.: Combination of two-machine flow shop scheduling and shortest path problems. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 680–687. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38768-5_60
Nip, K., Wang, Z., Xing, W.: Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 97–108. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21398-9_8
Nip, K., Wang, Z., Talla Nobibon, F., Leus, R.: A combination of flow shop scheduling and the shortest path problem. J. Comb. Optim. 29(1), 36–52 (2015)
Nip, K., Wang, Z., Xing, W.: A study on several combination problems of classic shop scheduling and shortest path. Theoret. Comput. Sci. 654, 175–187 (2016)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713–728 (2005)
Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, New York (2011)
Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463–468 (1975)
Lawler, E.L.: Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4(4), 339–356 (1979)
Jansen, K.: Parameterized approximation scheme for the multiple knapsack problem. SIAM J. Comput. 39(4), 1392–1412 (2010)
Shmoys, D.B., Tardos, E.: An approximation algorithm for the generalized assignment problem. Math. Program. 62(3), 461–474 (1993)
Feige, U., Vondrak, J.: Approximation algorithms for allocation problems: improving the factor of \(1 - 1/e\). In: FOCS 2006, pp. 667–676 (2006)
Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum separable assignment problems. Math. Oper. Res. 36(3), 416–431 (2011)
Dudziński, K., Walukiewicz, S.: Exact methods for the knapsack problem and its generalizations. Eur. J. Oper. Res. 28(1), 3–21 (1987)
Johnston, R.E., Khan, L.R.: Bounds for nested knapsack problems. Eur. J. Oper. Res. 81(1), 154–165 (1995)
Xavier, E., Miyazawa, F.: Approximation schemes for knapsack problems with shelf divisions. Theoret. Comput. Sci. 352(1), 71–84 (2006)
Faaland, B.H.: The multiperiod knapsack problem. Oper. Res. 29(3), 612–616 (1981)
Kosuch, S., Lisser, A.: On two-stage stochastic knapsack problems. Discrete Appl. Math. 159(16), 1827–1841 (2011)
Kosuch, S.: Approximability of the two-stage stochastic knapsack problem with discretely distributed weights. Discrete Appl. Math. 165, 192–204 (2014)
Dempe, S., Richter, K.: Bilevel programming with knapsack constraint. CEJOR 8, 93–107 (2000)
Chen, L., Zhang, G.: Approximation algorithms for a bi-level knapsack problem. Theoret. Comput. Sci. 497, 1–12 (2013)
Caprara, A., Carvalho, M., Lodi, A., Woeginger, G.J.: A study on the computational complexity of the bilevel knapsack problem. SIAM J. Optim. 24(2), 823–838 (2014)
Chen, L., Zhang, G.: Packing groups of items into multiple knapsacks. In: Ollinger, N., Vollmer, H. (eds.) STACS 2016. LIPIcs, vol. 47, pp. 28:1–28:13 (2016)
Murgolo, F.D.: An efficient approximation scheme for variable-sized bin packing. SIAM J. Comput. 16(1), 149–161 (1987)
Fernandez de la Vega, W., Lueker, G.: Bin packing can be solved within 1 + \(\epsilon \) in linear time. Combinatorica 1(4), 349–355 (1981)
Acknowledgments
This work has been supported by NSFC No.11771245 and No. 11371216.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Nip, K., Wang, Z. (2018). Approximation Algorithms for a Two-Phase Knapsack Problem. In: Wang, L., Zhu, D. (eds) Computing and Combinatorics. COCOON 2018. Lecture Notes in Computer Science(), vol 10976. Springer, Cham. https://doi.org/10.1007/978-3-319-94776-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-94776-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94775-4
Online ISBN: 978-3-319-94776-1
eBook Packages: Computer ScienceComputer Science (R0)