Xu, Chenyang; Zhang, Guochuan Learning-augmented algorithms for online subset sum. (English) Zbl 07762786 J. Glob. Optim. 87, No. 2-4, 989-1008 (2023). MSC: 68W01 PDFBibTeX XMLCite \textit{C. Xu} and \textit{G. Zhang}, J. Glob. Optim. 87, No. 2--4, 989--1008 (2023; Zbl 07762786) Full Text: DOI
Antonopoulos, Antonis; Pagourtzis, Aris; Petsalakis, Stavros; Vasilakis, Manolis Faster algorithms for \(k\)-Subset Sum and variations. (English) Zbl 07724804 Chen, Jing (ed.) et al., Frontiers of algorithmics. International joint conference, IJTCS-FAW 2021, Beijing, China, August 16–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12874, 37-52 (2022). MSC: 90C27 68Q25 PDFBibTeX XMLCite \textit{A. Antonopoulos} et al., Lect. Notes Comput. Sci. 12874, 37--52 (2022; Zbl 07724804) Full Text: DOI
Chan, Timothy M.; He, Qizheng More on change-making and related problems. (English) Zbl 1491.68126 J. Comput. Syst. Sci. 124, 159-169 (2022). Reviewer: Roberto Solis-Oba (London) MSC: 68R05 11D07 68Q25 68W05 68W32 68W40 90C27 90C39 PDFBibTeX XMLCite \textit{T. M. Chan} and \textit{Q. He}, J. Comput. Syst. Sci. 124, 159--169 (2022; Zbl 1491.68126) Full Text: DOI arXiv Link
Gurski, Frank; Rehs, Carolin; Rethmann, Jochen Knapsack problems: a parameterized point of view. (English) Zbl 1422.68113 Theor. Comput. Sci. 775, 93-108 (2019). MSC: 68Q25 90C27 PDFBibTeX XMLCite \textit{F. Gurski} et al., Theor. Comput. Sci. 775, 93--108 (2019; Zbl 1422.68113) Full Text: DOI arXiv
Anastasiadis, Eleftherios; Deng, Xiaotie; Krysta, Piotr; Li, Minming; Qiao, Han; Zhang, Jinshan Network pollution games. (English) Zbl 1417.91390 Algorithmica 81, No. 1, 124-166 (2019). MSC: 91B76 91A43 68Q25 68W25 PDFBibTeX XMLCite \textit{E. Anastasiadis} et al., Algorithmica 81, No. 1, 124--166 (2019; Zbl 1417.91390) Full Text: DOI Link
Pessoa, A.; Sadykov, R.; Uchoa, E.; Vanderbeck, F. Automation and combination of linear-programming based stabilization techniques in column generation. (English) Zbl 1528.90164 INFORMS J. Comput. 30, No. 2, 339-360 (2018). MSC: 90C11 68W40 PDFBibTeX XMLCite \textit{A. Pessoa} et al., INFORMS J. Comput. 30, No. 2, 339--360 (2018; Zbl 1528.90164) Full Text: DOI HAL
Goebbels, Steffen; Gurski, Frank; Rethmann, Jochen; Yilmaz, Eda Change-making problems revisited: a parameterized point of view. (English) Zbl 1373.90168 J. Comb. Optim. 34, No. 4, 1218-1236 (2017). MSC: 90C39 68R05 68Q25 PDFBibTeX XMLCite \textit{S. Goebbels} et al., J. Comb. Optim. 34, No. 4, 1218--1236 (2017; Zbl 1373.90168) Full Text: DOI
Diao, Rui; Liu, Ya-Feng; Dai, Yu-Hong A new fully polynomial time approximation scheme for the interval subset sum problem. (English) Zbl 1380.90288 J. Glob. Optim. 68, No. 4, 749-775 (2017). MSC: 90C59 68Q25 PDFBibTeX XMLCite \textit{R. Diao} et al., J. Glob. Optim. 68, No. 4, 749--775 (2017; Zbl 1380.90288) Full Text: DOI arXiv
He, Cheng; Leung, Joseph Y-T.; Lee, Kangbok; Pinedo, Michael L. An improved binary search algorithm for the multiple-choice knapsack problem. (English) Zbl 1401.90191 RAIRO, Oper. Res. 50, No. 4-5, 995-1001 (2016). MSC: 90C27 68Q25 90C10 90C59 PDFBibTeX XMLCite \textit{C. He} et al., RAIRO, Oper. Res. 50, No. 4--5, 995--1001 (2016; Zbl 1401.90191) Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Kellerer, Hans; Levin, Asaf; Tuza, Zsolt Offline black and white bin packing. (English) Zbl 1328.68294 Theor. Comput. Sci. 596, 92-101 (2015). MSC: 68W25 68Q25 90C27 90C59 PDFBibTeX XMLCite \textit{J. Balogh} et al., Theor. Comput. Sci. 596, 92--101 (2015; Zbl 1328.68294) Full Text: DOI
Drótos, Márton; Kis, Tamás Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times. (English) Zbl 1280.90041 J. Sched. 16, No. 3, 337-346 (2013). MSC: 90B35 90B05 68Q25 PDFBibTeX XMLCite \textit{M. Drótos} and \textit{T. Kis}, J. Sched. 16, No. 3, 337--346 (2013; Zbl 1280.90041) Full Text: DOI Link
Borradaile, Glencora; Heeringa, Brent; Wilfong, Gordon The knapsack problem with neighbour constraints. (English) Zbl 1262.90179 J. Discrete Algorithms 16, 224-235 (2012). MSC: 90C27 05C85 68W25 68W40 PDFBibTeX XMLCite \textit{G. Borradaile} et al., J. Discrete Algorithms 16, 224--235 (2012; Zbl 1262.90179) Full Text: DOI
Han, Xin; Kawase, Yasushi; Makino, Kazuhisa Online knapsack problem with removal cost. (English) Zbl 1364.68374 Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20–22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 61-73 (2012). MSC: 68W27 68W40 90C27 PDFBibTeX XMLCite \textit{X. Han} et al., Lect. Notes Comput. Sci. 7434, 61--73 (2012; Zbl 1364.68374) Full Text: DOI
Eggermont, Christian E. J.; Woeginger, Gerhard J. Motion planning with pulley, rope, and baskets. (English) Zbl 1245.68104 Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 374-383, electronic only (2012). MSC: 68Q25 90B35 68M20 PDFBibTeX XMLCite \textit{C. E. J. Eggermont} and \textit{G. J. Woeginger}, LIPIcs -- Leibniz Int. Proc. Inform. 14, 374--383 (2012; Zbl 1245.68104) Full Text: DOI
Jansen, Klaus A fast approximation scheme for the multiple knapsack problem. (English) Zbl 1302.90183 Bieliková, Mária (ed.) et al., SOFSEM 2012: Theory and practice of computer science. 38th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 21–27, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-27659-0/pbk). Lecture Notes in Computer Science 7147, 313-324 (2012). MSC: 90C27 68W25 68W40 90C59 PDFBibTeX XMLCite \textit{K. Jansen}, Lect. Notes Comput. Sci. 7147, 313--324 (2012; Zbl 1302.90183) Full Text: DOI Link
Yedidsion, Liron; Shabtay, Dvir; Kaspi, Moshe Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling. (English) Zbl 1223.68059 Discrete Appl. Math. 159, No. 12, 1264-1278 (2011). MSC: 68Q25 90B35 68Q17 PDFBibTeX XMLCite \textit{L. Yedidsion} et al., Discrete Appl. Math. 159, No. 12, 1264--1278 (2011; Zbl 1223.68059) Full Text: DOI
Kulik, Ariel; Shachnai, Hadas There is no EPTAS for two-dimensional knapsack. (English) Zbl 1234.68153 Inf. Process. Lett. 110, No. 16, 707-710 (2010). MSC: 68Q25 90C27 68Q15 PDFBibTeX XMLCite \textit{A. Kulik} and \textit{H. Shachnai}, Inf. Process. Lett. 110, No. 16, 707--710 (2010; Zbl 1234.68153) Full Text: DOI
Klamler, Christian; Pferschy, Ulrich; Ruzika, Stefan Committee selection with a weight constraint based on lexicographic rankings of individuals. (English) Zbl 1260.91087 Rossi, Francesca (ed.) et al., Algorithmic decision theory. First international conference, ADT 2009, Venice, Italy, October 20–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04427-4/pbk). Lecture Notes in Computer Science 5783. Lecture Notes in Artificial Intelligence, 50-61 (2009). MSC: 91B14 68Q25 90C27 91B08 PDFBibTeX XMLCite \textit{C. Klamler} et al., Lect. Notes Comput. Sci. 5783, 50--61 (2009; Zbl 1260.91087) Full Text: DOI
Sanches, C. A. A.; Soma, N. Y.; Yanasse, H. H. Parallel time and space upper-bounds for the subset-sum problem. (English) Zbl 1152.68057 Theor. Comput. Sci. 407, No. 1-3, 342-348 (2008). MSC: 68W10 68W40 90C39 PDFBibTeX XMLCite \textit{C. A. A. Sanches} et al., Theor. Comput. Sci. 407, No. 1--3, 342--348 (2008; Zbl 1152.68057) Full Text: DOI
Rothe, Jörg Complexity theory and cryptology. An introduction to cryptocomplexity. (Komplexitätstheorie und Kryptologie. Eine Einführung in Kryptokomplexität.) (German) Zbl 1171.68008 eXamen.press. Berlin: Springer (ISBN 978-3-540-79744-9/hbk). xi, 535 p. (2008). Reviewer: Rainer Horsch (Markdorf) MSC: 68P25 68-01 68Q15 68Q25 94A60 PDFBibTeX XMLCite \textit{J. Rothe}, Komplexitätstheorie und Kryptologie. Eine Einführung in Kryptokomplexität. Berlin: Springer (2008; Zbl 1171.68008) Full Text: DOI
Diedrich, Florian; Harren, Rolf; Jansen, Klaus; Thöle, Ralf; Thomas, Henning Approximation algorithms for 3D orthogonal Knapsack. (English) Zbl 1198.68299 Cai, Jin-Yi (ed.) et al., Theory and applications of models of computation. 4th international conference, TAMC 2007, Shanghai, China, May 22–25, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72503-9/pbk). Lecture Notes in Computer Science 4484, 34-45 (2007). MSC: 68W25 68Q25 90C27 PDFBibTeX XMLCite \textit{F. Diedrich} et al., Lect. Notes Comput. Sci. 4484, 34--45 (2007; Zbl 1198.68299) Full Text: DOI
Simon, Hans Ulrich On the complexity of working set selection. (English) Zbl 1127.68087 Theor. Comput. Sci. 382, No. 3, 262-279 (2007). MSC: 68T05 68Q25 68W25 90C20 90C25 PDFBibTeX XMLCite \textit{H. U. Simon}, Theor. Comput. Sci. 382, No. 3, 262--279 (2007; Zbl 1127.68087) Full Text: DOI
Zhou, Yunhong Improved multi-unit auction clearing algorithms with interval (multiple-choice) knapsack problems. (English) Zbl 1135.90394 Asano, Tetsuo (ed.), Algorithms and computation. 17th international symposium, ISAAC 2006, Kolkata, India, December 18–20, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49694-6/pbk). Lecture Notes in Computer Science 4288, 494-506 (2006). MSC: 90C27 68Q25 68W25 91B26 PDFBibTeX XMLCite \textit{Y. Zhou}, Lect. Notes Comput. Sci. 4288, 494--506 (2006; Zbl 1135.90394) Full Text: DOI
Beier, Rene; Vöcking, Berthold An experimental study of random knapsack problems. (English) Zbl 1117.90061 Algorithmica 45, No. 1, 121-136 (2006). MSC: 90C27 68Q25 68W40 90C15 PDFBibTeX XMLCite \textit{R. Beier} and \textit{B. Vöcking}, Algorithmica 45, No. 1, 121--136 (2006; Zbl 1117.90061) Full Text: DOI
Caprara, Alberto; Pferschy, Ulrich Modified subset sum heuristics for bin packing. (English) Zbl 1184.68661 Inf. Process. Lett. 96, No. 1, 18-23 (2005). MSC: 68W40 68W05 PDFBibTeX XMLCite \textit{A. Caprara} and \textit{U. Pferschy}, Inf. Process. Lett. 96, No. 1, 18--23 (2005; Zbl 1184.68661) Full Text: DOI
Beier, Rene; Vöcking, Berthold Random knapsack in expected polynomial time. (English) Zbl 1062.90037 J. Comput. Syst. Sci. 69, No. 3, 306-329 (2004). MSC: 90C09 90C27 90C60 68W05 68Q25 PDFBibTeX XMLCite \textit{R. Beier} and \textit{B. Vöcking}, J. Comput. Syst. Sci. 69, No. 3, 306--329 (2004; Zbl 1062.90037) Full Text: DOI
Shachnai, Hadas; Tamir, Tami Tight bounds for online class-constrained packing. (English) Zbl 1067.90144 Theor. Comput. Sci. 321, No. 1, 103-123 (2004). MSC: 90C27 05B40 68Q25 68W40 90B80 PDFBibTeX XMLCite \textit{H. Shachnai} and \textit{T. Tamir}, Theor. Comput. Sci. 321, No. 1, 103--123 (2004; Zbl 1067.90144) Full Text: DOI