Beck, Yasmine; Ljubić, Ivana; Schmidt, Martin Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem. (English) Zbl 1527.90133 Math. Program. Comput. 15, No. 4, 733-782 (2023). MSC: 90C11 90C27 90C57 90C70 PDFBibTeX XMLCite \textit{Y. Beck} et al., Math. Program. Comput. 15, No. 4, 733--782 (2023; Zbl 1527.90133) Full Text: DOI OA License
Weninger, Noah; Fukasawa, Ricardo A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints. (English) Zbl 1528.90232 Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 438-452 (2023). MSC: 90C27 90B80 90C30 90C39 91A65 PDFBibTeX XMLCite \textit{N. Weninger} and \textit{R. Fukasawa}, Lect. Notes Comput. Sci. 13904, 438--452 (2023; Zbl 1528.90232) Full Text: DOI
Legault, Robin; Côté, Jean-François; Gendron, Bernard A novel reformulation for the single-sink fixed-charge transportation problem. (English) Zbl 1522.90038 Math. Program. 202, No. 1-2 (A), 169-198 (2023). MSC: 90C10 90B06 90C27 PDFBibTeX XMLCite \textit{R. Legault} et al., Math. Program. 202, No. 1--2 (A), 169--198 (2023; Zbl 1522.90038) Full Text: DOI
Jooken, Jorik; Leyman, Pieter; De Causmaecker, Patrick Features for the 0-1 knapsack problem based on inclusionwise maximal solutions. (English) Zbl 07709922 Eur. J. Oper. Res. 311, No. 1, 36-55 (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{J. Jooken} et al., Eur. J. Oper. Res. 311, No. 1, 36--55 (2023; Zbl 07709922) Full Text: DOI arXiv
Sinha, Ankur; Das, Arka; Anand, Guneshwar; Jayaswal, Sachin A general purpose exact solution method for mixed integer concave minimization problems. (English) Zbl 07709382 Eur. J. Oper. Res. 309, No. 3, 977-992 (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{A. Sinha} et al., Eur. J. Oper. Res. 309, No. 3, 977--992 (2023; Zbl 07709382) Full Text: DOI arXiv
Leitner, Markus; Ljubić, Ivana; Monaci, Michele; Sinnl, Markus; Tanınmış, Kübra An exact method for binary fortification games. (English) Zbl 07709062 Eur. J. Oper. Res. 307, No. 3, 1026-1039 (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{M. Leitner} et al., Eur. J. Oper. Res. 307, No. 3, 1026--1039 (2023; Zbl 07709062) Full Text: DOI arXiv
Wang, Lin; Wang, Sirui; Gong, Yeming; Peng, Lu Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation. (English) Zbl 07706544 Comput. Oper. Res. 151, Article ID 106128, 21 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{L. Wang} et al., Comput. Oper. Res. 151, Article ID 106128, 21 p. (2023; Zbl 07706544) Full Text: DOI
Gao, Mujin; Chen, Yanru; Li, Junheng; Wahab, M. I. M. Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows. (English) Zbl 07705480 Comput. Oper. Res. 157, Article ID 106267, 14 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{M. Gao} et al., Comput. Oper. Res. 157, Article ID 106267, 14 p. (2023; Zbl 07705480) Full Text: DOI
Shi, Xueyu; Prokopyev, Oleg A.; Ralphs, Ted K. Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds. (English) Zbl 1514.90191 Math. Program. Comput. 15, No. 1, 1-51 (2023). MSC: 90C26 90C11 91A65 91A68 PDFBibTeX XMLCite \textit{X. Shi} et al., Math. Program. Comput. 15, No. 1, 1--51 (2023; Zbl 1514.90191) Full Text: DOI
Korbacher, Laura; Irnich, Stefan; Martinovic, John; Strasdat, Nico Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model. (English) Zbl 1518.90090 Discrete Appl. Math. 334, 145-162 (2023). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{L. Korbacher} et al., Discrete Appl. Math. 334, 145--162 (2023; Zbl 1518.90090) Full Text: DOI
Jooken, Jorik; Leyman, Pieter; Wauters, Tony; De Causmaecker, Patrick Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems. (English) Zbl 1520.90177 Comput. Oper. Res. 150, Article ID 106070, 25 p. (2023). MSC: 90C27 90B35 90C09 90C59 PDFBibTeX XMLCite \textit{J. Jooken} et al., Comput. Oper. Res. 150, Article ID 106070, 25 p. (2023; Zbl 1520.90177) Full Text: DOI arXiv
Lalonde, Olivier; Côté, Jean-François; Gendron, Bernard A branch-and-price algorithm for the multiple knapsack problem. (English) Zbl 07640785 INFORMS J. Comput. 34, No. 6, 3134-3150 (2022). MSC: 90Cxx PDFBibTeX XMLCite \textit{O. Lalonde} et al., INFORMS J. Comput. 34, No. 6, 3134--3150 (2022; Zbl 07640785) Full Text: DOI
Coniglio, Stefano; Furini, Fabio; Ljubić, Ivana Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. (English) Zbl 1506.90245 Math. Program. 196, No. 1-2 (B), 9-56 (2022). MSC: 90C30 90C27 90C11 90C57 90C35 PDFBibTeX XMLCite \textit{S. Coniglio} et al., Math. Program. 196, No. 1--2 (B), 9--56 (2022; Zbl 1506.90245) Full Text: DOI
O’Neill, Ben Smallest covering regions and highest density regions for discrete distributions. (English) Zbl 1505.62305 Comput. Stat. 37, No. 3, 1229-1254 (2022). MSC: 62-08 62G07 90C27 PDFBibTeX XMLCite \textit{B. O'Neill}, Comput. Stat. 37, No. 3, 1229--1254 (2022; Zbl 1505.62305) Full Text: DOI arXiv
Monaci, Michele; Pike-Burke, Ciara; Santini, Alberto Exact algorithms for the 0-1 time-bomb knapsack problem. (English) Zbl 1520.90181 Comput. Oper. Res. 145, Article ID 105848, 10 p. (2022). MSC: 90C27 90C15 90C39 90C59 PDFBibTeX XMLCite \textit{M. Monaci} et al., Comput. Oper. Res. 145, Article ID 105848, 10 p. (2022; Zbl 1520.90181) Full Text: DOI
Cacchiani, Valentina; Iori, Manuel; Locatelli, Alberto; Martello, Silvano Knapsack problems – an overview of recent advances. I: Single knapsack problems. (English) Zbl 1512.90189 Comput. Oper. Res. 143, Article ID 105692, 13 p. (2022). MSC: 90C27 90-02 PDFBibTeX XMLCite \textit{V. Cacchiani} et al., Comput. Oper. Res. 143, Article ID 105692, 13 p. (2022; Zbl 1512.90189) Full Text: DOI
Jooken, Jorik; Leyman, Pieter; De Causmaecker, Patrick A new class of hard problem instances for the 0-1 knapsack problem. (English) Zbl 1506.90226 Eur. J. Oper. Res. 301, No. 3, 841-854 (2022). MSC: 90C27 90C09 PDFBibTeX XMLCite \textit{J. Jooken} et al., Eur. J. Oper. Res. 301, No. 3, 841--854 (2022; Zbl 1506.90226) Full Text: DOI Link
Li, Wenxin; Lee, Joohyun; Shroff, Ness A faster FPTAS for knapsack problem with cardinality constraint. (English) Zbl 1491.90142 Discrete Appl. Math. 315, 71-85 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{W. Li} et al., Discrete Appl. Math. 315, 71--85 (2022; Zbl 1491.90142) Full Text: DOI
Catanzaro, Daniele; Coniglio, Stefano; Furini, Fabio On the exact separation of cover inequalities of maximum-depth. (English) Zbl 1487.90544 Optim. Lett. 16, No. 2, 449-469 (2022). MSC: 90C27 90C39 90C11 PDFBibTeX XMLCite \textit{D. Catanzaro} et al., Optim. Lett. 16, No. 2, 449--469 (2022; Zbl 1487.90544) Full Text: DOI
Chagas, Jonatas B. C.; Wagner, Markus A weighted-sum method for solving the bi-objective traveling thief problem. (English) Zbl 1511.90342 Comput. Oper. Res. 138, Article ID 105560, 15 p. (2022). MSC: 90C27 90C29 90C59 PDFBibTeX XMLCite \textit{J. B. C. Chagas} and \textit{M. Wagner}, Comput. Oper. Res. 138, Article ID 105560, 15 p. (2022; Zbl 1511.90342) Full Text: DOI arXiv
Schepler, Xavier; Rossi, André; Gurevsky, Evgeny; Dolgui, Alexandre Solving robust bin-packing problems with a branch-and-price approach. (English) Zbl 1490.90256 Eur. J. Oper. Res. 297, No. 3, 831-843 (2022). MSC: 90C27 90C10 90C57 PDFBibTeX XMLCite \textit{X. Schepler} et al., Eur. J. Oper. Res. 297, No. 3, 831--843 (2022; Zbl 1490.90256) Full Text: DOI Link
Khatami, Mostafa; Salehipour, Amir A binary search algorithm for the general coupled task scheduling problem. (English) Zbl 07755407 4OR 19, No. 4, 593-611 (2021). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{M. Khatami} and \textit{A. Salehipour}, 4OR 19, No. 4, 593--611 (2021; Zbl 07755407) Full Text: DOI
Åblad, Edvin; Strömberg, Ann-Brith; Spensieri, Domenico Exact makespan minimization of unrelated parallel machines. (English) Zbl 1497.90080 OJMO, Open J. Math. Optim. 2, Article No. 2, 15 p. (2021). MSC: 90B35 90C11 90C05 90C59 90C57 90C25 65K05 68M20 68Q25 90C27 PDFBibTeX XMLCite \textit{E. Åblad} et al., OJMO, Open J. Math. Optim. 2, Article No. 2, 15 p. (2021; Zbl 1497.90080) Full Text: DOI
Sharma, Meenarli; Hahn, Mirko; Leyffer, Sven; Ruthotto, Lars; van Bloemen Waanders, Bart Inversion of convection-diffusion equation with discrete sources. (English) Zbl 1484.90051 Optim. Eng. 22, No. 3, 1419-1457 (2021). MSC: 90C11 90C30 PDFBibTeX XMLCite \textit{M. Sharma} et al., Optim. Eng. 22, No. 3, 1419--1457 (2021; Zbl 1484.90051) Full Text: DOI
Li, Wenxin; Lee, Joohyun; Shroff, Ness A faster FPTAS for knapsack problem with cardinality constraint. (English) Zbl 07495116 Kaklamanis, Christos (ed.) et al., Approximation and online algorithms. 18th international workshop, WAOA 2020, virtual event, September 9–10, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12806, 16-29 (2021). MSC: 68W25 68W27 PDFBibTeX XMLCite \textit{W. Li} et al., Lect. Notes Comput. Sci. 12806, 16--29 (2021; Zbl 07495116) Full Text: DOI arXiv
Oliveira, Óscar; Matos, Telmo; Gamboa, Dorabela A dual RAMP algorithm for single source capacitated facility location problems. (English) Zbl 07420369 Ann. Math. Artif. Intell. 89, No. 8-9, 815-834 (2021). MSC: 68Txx PDFBibTeX XMLCite \textit{Ó. Oliveira} et al., Ann. Math. Artif. Intell. 89, No. 8--9, 815--834 (2021; Zbl 07420369) Full Text: DOI
Christensen, Tue Rauff Lind; Klose, Andreas A fast exact method for the capacitated facility location problem with differentiable convex production costs. (English) Zbl 1487.90433 Eur. J. Oper. Res. 292, No. 3, 855-868 (2021). MSC: 90B80 90C10 90C30 90C57 PDFBibTeX XMLCite \textit{T. R. L. Christensen} and \textit{A. Klose}, Eur. J. Oper. Res. 292, No. 3, 855--868 (2021; Zbl 1487.90433) Full Text: DOI
Coniglio, Stefano; Furini, Fabio; San Segundo, Pablo A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts. (English) Zbl 1487.90546 Eur. J. Oper. Res. 289, No. 2, 435-455 (2021). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{S. Coniglio} et al., Eur. J. Oper. Res. 289, No. 2, 435--455 (2021; Zbl 1487.90546) Full Text: DOI Link
Smith-Miles, Kate; Christiansen, Jeffrey; Muñoz, Mario Andrés Revisiting Where are the hard knapsack problems? via instance space analysis. (English) Zbl 1510.90245 Comput. Oper. Res. 128, Article ID 105184, 18 p. (2021). MSC: 90C27 90C09 90C39 90C59 PDFBibTeX XMLCite \textit{K. Smith-Miles} et al., Comput. Oper. Res. 128, Article ID 105184, 18 p. (2021; Zbl 1510.90245) Full Text: DOI
Dahmani, Isma; Hifi, Mhand A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. (English) Zbl 1467.90050 Ann. Oper. Res. 298, No. 1-2, 125-147 (2021). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{I. Dahmani} and \textit{M. Hifi}, Ann. Oper. Res. 298, No. 1--2, 125--147 (2021; Zbl 1467.90050) Full Text: DOI
Swain, Chinmaya Kumar; Saini, Neha; Sahu, Aryabartta Reliability aware scheduling of bag of real time tasks in cloud environment. (English) Zbl 1459.68024 Computing 102, No. 2, 451-475 (2020). MSC: 68M20 68M11 68M15 PDFBibTeX XMLCite \textit{C. K. Swain} et al., Computing 102, No. 2, 451--475 (2020; Zbl 1459.68024) Full Text: DOI
Delorme, Maxence; Iori, Manuel Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems. (English) Zbl 07284456 INFORMS J. Comput. 32, No. 1, 101-119 (2020). MSC: 90Cxx PDFBibTeX XMLCite \textit{M. Delorme} and \textit{M. Iori}, INFORMS J. Comput. 32, No. 1, 101--119 (2020; Zbl 07284456) Full Text: DOI Link
Della Croce, Federico; Scatamacchia, Rosario An exact approach for the bilevel knapsack problem with interdiction constraints and extensions. (English) Zbl 1450.90040 Math. Program. 183, No. 1-2 (B), 249-281 (2020). MSC: 90C27 90-08 90C10 PDFBibTeX XMLCite \textit{F. Della Croce} and \textit{R. Scatamacchia}, Math. Program. 183, No. 1--2 (B), 249--281 (2020; Zbl 1450.90040) Full Text: DOI arXiv
Morales, Fernando A.; Martínez, Jairo A. Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem. (English) Zbl 1445.90060 J. Comb. Optim. 40, No. 1, 234-278 (2020). MSC: 90C10 90C59 90C06 65C05 68U01 PDFBibTeX XMLCite \textit{F. A. Morales} and \textit{J. A. Martínez}, J. Comb. Optim. 40, No. 1, 234--278 (2020; Zbl 1445.90060) Full Text: DOI arXiv
Drake, John H.; Kheiri, Ahmed; Özcan, Ender; Burke, Edmund K. Recent advances in selection hyper-heuristics. (English) Zbl 1441.90183 Eur. J. Oper. Res. 285, No. 2, 405-428 (2020). MSC: 90C59 68T20 90C27 PDFBibTeX XMLCite \textit{J. H. Drake} et al., Eur. J. Oper. Res. 285, No. 2, 405--428 (2020; Zbl 1441.90183) Full Text: DOI
Fischetti, Matteo; Ljubić, Ivana; Monaci, Michele; Sinnl, Markus Interdiction games and monotonicity, with application to knapsack problems. (English) Zbl 07281718 INFORMS J. Comput. 31, No. 2, 390-410 (2019). MSC: 91Axx 90C57 PDFBibTeX XMLCite \textit{M. Fischetti} et al., INFORMS J. Comput. 31, No. 2, 390--410 (2019; Zbl 07281718) Full Text: DOI
Zhang, HongGuang; Liu, YuanAn; Zhou, Jie Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index. (English) Zbl 07772456 Nat. Comput. 17, No. 3, 611-639 (2018). MSC: 90C27 68W50 90C59 PDFBibTeX XMLCite \textit{H. Zhang} et al., Nat. Comput. 17, No. 3, 611--639 (2018; Zbl 07772456) Full Text: DOI
Huang, Di; Gu, Yu; Wang, Hans; Liu, Zhiyuan; Chen, Jun An incentive dynamic programming method for the optimization of scholarship assignment. (English) Zbl 1417.90148 Discrete Dyn. Nat. Soc. 2018, Article ID 5206131, 7 p. (2018). MSC: 90C39 90B80 PDFBibTeX XMLCite \textit{D. Huang} et al., Discrete Dyn. Nat. Soc. 2018, Article ID 5206131, 7 p. (2018; Zbl 1417.90148) Full Text: DOI
Ben Salem, Mariem; Taktak, Raouia; Mahjoub, A. Ridha; Ben-Abdallah, Hanêne Optimization algorithms for the disjunctively constrained knapsack problem. (English) Zbl 1398.90131 Soft Comput. 22, No. 6, 2025-2043 (2018). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Ben Salem} et al., Soft Comput. 22, No. 6, 2025--2043 (2018; Zbl 1398.90131) Full Text: DOI
D’Ambrosio, Claudia; Furini, Fabio; Monaci, Michele; Traversi, Emiliano On the product knapsack problem. (English) Zbl 1404.90110 Optim. Lett. 12, No. 4, 691-712 (2018). MSC: 90C27 90C39 90C11 PDFBibTeX XMLCite \textit{C. D'Ambrosio} et al., Optim. Lett. 12, No. 4, 691--712 (2018; Zbl 1404.90110) Full Text: DOI
Furini, Fabio; Monaci, Michele; Traversi, Emiliano Exact approaches for the knapsack problem with setups. (English) Zbl 1391.90516 Comput. Oper. Res. 90, 208-220 (2018). MSC: 90C27 90C10 PDFBibTeX XMLCite \textit{F. Furini} et al., Comput. Oper. Res. 90, 208--220 (2018; Zbl 1391.90516) Full Text: DOI Link
Fischetti, Matteo; Monaci, Michele; Sinnl, Markus A dynamic reformulation heuristic for generalized interdiction problems. (English) Zbl 1403.90524 Eur. J. Oper. Res. 267, No. 1, 40-51 (2018). MSC: 90C11 90C27 90C59 91A65 91A80 PDFBibTeX XMLCite \textit{M. Fischetti} et al., Eur. J. Oper. Res. 267, No. 1, 40--51 (2018; Zbl 1403.90524) Full Text: DOI Link
Gadegaard, Sune Lauth; Klose, Andreas; Nielsen, Lars Relund An improved cut-and-solve algorithm for the single-source capacitated facility location problem. (English) Zbl 1390.90008 EURO J. Comput. Optim. 6, No. 1, 1-27 (2018). MSC: 90-08 90C10 90C11 90B80 PDFBibTeX XMLCite \textit{S. L. Gadegaard} et al., EURO J. Comput. Optim. 6, No. 1, 1--27 (2018; Zbl 1390.90008) Full Text: DOI Link
Enderer, Furkan; Contardo, Claudio; Contreras, Ivan Integrating dock-door assignment and vehicle routing with cross-docking. (English) Zbl 1391.90055 Comput. Oper. Res. 88, 30-43 (2017). MSC: 90B06 90B35 90C35 90C27 PDFBibTeX XMLCite \textit{F. Enderer} et al., Comput. Oper. Res. 88, 30--43 (2017; Zbl 1391.90055) Full Text: DOI Link
Álvarez-Miranda, Eduardo; Sinnl, Markus A relax-and-cut framework for large-scale maximum weight connected subgraph problems. (English) Zbl 1391.90595 Comput. Oper. Res. 87, 63-82 (2017). MSC: 90C35 90C10 92C42 PDFBibTeX XMLCite \textit{E. Álvarez-Miranda} and \textit{M. Sinnl}, Comput. Oper. Res. 87, 63--82 (2017; Zbl 1391.90595) Full Text: DOI
Keskin, Muhammed Emre A column generation heuristic for optimal wireless sensor network design with mobile sinks. (English) Zbl 1402.90031 Eur. J. Oper. Res. 260, No. 1, 291-304 (2017). MSC: 90B18 90C10 90C59 PDFBibTeX XMLCite \textit{M. E. Keskin}, Eur. J. Oper. Res. 260, No. 1, 291--304 (2017; Zbl 1402.90031) Full Text: DOI
Della Croce, Federico; Salassa, Fabio; Scatamacchia, Rosario A new exact approach for the 0-1 collapsing knapsack problem. (English) Zbl 1402.90143 Eur. J. Oper. Res. 260, No. 1, 56-69 (2017). MSC: 90C27 90C09 90C10 90C57 PDFBibTeX XMLCite \textit{F. Della Croce} et al., Eur. J. Oper. Res. 260, No. 1, 56--69 (2017; Zbl 1402.90143) Full Text: DOI
Pisinger, David; Saidi, Alima Tolerance analysis for 0-1 knapsack problems. (English) Zbl 1394.90493 Eur. J. Oper. Res. 258, No. 3, 866-876 (2017). MSC: 90C27 90C09 90C31 90C11 90C39 65K05 PDFBibTeX XMLCite \textit{D. Pisinger} and \textit{A. Saidi}, Eur. J. Oper. Res. 258, No. 3, 866--876 (2017; Zbl 1394.90493) Full Text: DOI
Polyakovskiy, S.; Neumann, F. The packing while traveling problem. (English) Zbl 1394.90494 Eur. J. Oper. Res. 258, No. 2, 424-439 (2017). MSC: 90C27 90C11 90C30 90C60 PDFBibTeX XMLCite \textit{S. Polyakovskiy} and \textit{F. Neumann}, Eur. J. Oper. Res. 258, No. 2, 424--439 (2017; Zbl 1394.90494) Full Text: DOI arXiv
Furini, Fabio; Ljubić, Ivana; Sinnl, Markus An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. (English) Zbl 1375.90251 Eur. J. Oper. Res. 262, No. 2, 438-448 (2017). MSC: 90C27 90C39 90C10 PDFBibTeX XMLCite \textit{F. Furini} et al., Eur. J. Oper. Res. 262, No. 2, 438--448 (2017; Zbl 1375.90251) Full Text: DOI
Kowalczyk, Daniel; Leus, Roel An exact algorithm for parallel machine scheduling with conflicts. (English) Zbl 1375.90128 J. Sched. 20, No. 4, 355-372 (2017). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{D. Kowalczyk} and \textit{R. Leus}, J. Sched. 20, No. 4, 355--372 (2017; Zbl 1375.90128) Full Text: DOI Link
Edirisinghe, Chanaka; Jeong, Jaehwan Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time. (English) Zbl 1387.90156 Math. Program. 164, No. 1-2 (A), 193-227 (2017). Reviewer: Radu Ioan Bot (Wien) MSC: 90C11 90C20 90C26 PDFBibTeX XMLCite \textit{C. Edirisinghe} and \textit{J. Jeong}, Math. Program. 164, No. 1--2 (A), 193--227 (2017; Zbl 1387.90156) Full Text: DOI
Wishon, Christopher; Villalobos, J. Rene Robust efficiency measures for linear knapsack problem variants. (English) Zbl 1346.90723 Eur. J. Oper. Res. 254, No. 2, 398-409 (2016). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{C. Wishon} and \textit{J. R. Villalobos}, Eur. J. Oper. Res. 254, No. 2, 398--409 (2016; Zbl 1346.90723) Full Text: DOI
Dahmani, Isma; Hifi, Mhand; Wu, Lei An exact decomposition algorithm for the generalized knapsack sharing problem. (English) Zbl 1346.90699 Eur. J. Oper. Res. 252, No. 3, 761-774 (2016). MSC: 90C27 90C47 PDFBibTeX XMLCite \textit{I. Dahmani} et al., Eur. J. Oper. Res. 252, No. 3, 761--774 (2016; Zbl 1346.90699) Full Text: DOI
Blado, Daniel; Hu, Weihong; Toriello, Alejandro Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes. (English) Zbl 1346.90606 SIAM J. Optim. 26, No. 3, 1625-1648 (2016). MSC: 90C10 90C34 90C27 90C39 PDFBibTeX XMLCite \textit{D. Blado} et al., SIAM J. Optim. 26, No. 3, 1625--1648 (2016; Zbl 1346.90606) Full Text: DOI
Caprara, Alberto; Carvalho, Margarida; Lodi, Andrea; Woeginger, Gerhard J. Bilevel knapsack with interdiction constraints. (English) Zbl 1343.90075 INFORMS J. Comput. 28, No. 2, 319-333 (2016). MSC: 90C27 90C10 90C47 PDFBibTeX XMLCite \textit{A. Caprara} et al., INFORMS J. Comput. 28, No. 2, 319--333 (2016; Zbl 1343.90075) Full Text: DOI
Caprara, Alberto; Furini, Fabio; Malaguti, Enrico; Traversi, Emiliano Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation. (English) Zbl 1358.90111 Inf. Process. Lett. 116, No. 5, 379-386 (2016). MSC: 90C27 90C11 PDFBibTeX XMLCite \textit{A. Caprara} et al., Inf. Process. Lett. 116, No. 5, 379--386 (2016; Zbl 1358.90111) Full Text: DOI
Cerqueus, Audrey; Przybylski, Anthony; Gandibleux, Xavier Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems. (English) Zbl 1346.90734 Eur. J. Oper. Res. 244, No. 2, 417-433 (2015). MSC: 90C29 90C27 PDFBibTeX XMLCite \textit{A. Cerqueus} et al., Eur. J. Oper. Res. 244, No. 2, 417--433 (2015; Zbl 1346.90734) Full Text: DOI
Raidl, Günther R. Decomposition based hybrid metaheuristics. (English) Zbl 1346.90827 Eur. J. Oper. Res. 244, No. 1, 66-76 (2015). MSC: 90C59 90C27 90C11 PDFBibTeX XMLCite \textit{G. R. Raidl}, Eur. J. Oper. Res. 244, No. 1, 66--76 (2015; Zbl 1346.90827) Full Text: DOI
Reilly, Charles H.; Sapkota, Nabin A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances. (English) Zbl 1339.90288 Eur. J. Oper. Res. 241, No. 3, 642-652 (2015). MSC: 90C27 60E05 90C59 PDFBibTeX XMLCite \textit{C. H. Reilly} and \textit{N. Sapkota}, Eur. J. Oper. Res. 241, No. 3, 642--652 (2015; Zbl 1339.90288) Full Text: DOI
Furini, Fabio; Iori, Manuel; Martello, Silvano; Yagiura, Mutsunori Heuristic and exact algorithms for the interval \(\min\)-\(\max\) regret knapsack problem. (English) Zbl 1329.90119 INFORMS J. Comput. 27, No. 2, 392-405 (2015). MSC: 90C27 90C47 PDFBibTeX XMLCite \textit{F. Furini} et al., INFORMS J. Comput. 27, No. 2, 392--405 (2015; Zbl 1329.90119) Full Text: DOI
Hifi, Mhand; Wu, Lei New upper bounds and exact methods for the knapsack sharing problem. (English) Zbl 1364.90292 Appl. Math. Comput. 227, 518-530 (2014). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{L. Wu}, Appl. Math. Comput. 227, 518--530 (2014; Zbl 1364.90292) Full Text: DOI
Leão, Aline A. S.; Cherri, Luiz H.; Arenales, Marcos N. Determining the \(K\)-best solutions of knapsack problems. (English) Zbl 1349.90716 Comput. Oper. Res. 49, 71-82 (2014). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{A. A. S. Leão} et al., Comput. Oper. Res. 49, 71--82 (2014; Zbl 1349.90716) Full Text: DOI
Hifi, Mhand; Saleh, Sagvan; Wu, Lei A fast large neighborhood search for disjunctively constrained knapsack problems. (English) Zbl 1452.90268 Fouilhoux, Pierre (ed.) et al., Combinatorial optimization. Third international symposium, ISCO 2014, Lisbon, Portugal, March 5–7, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8596, 396-407 (2014). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. Hifi} et al., Lect. Notes Comput. Sci. 8596, 396--407 (2014; Zbl 1452.90268) Full Text: DOI
Goerigk, Marc A note on upper bounds to the robust knapsack problem with discrete scenarios. (English) Zbl 1306.90127 Ann. Oper. Res. 223, 461-469 (2014). MSC: 90C27 90C47 90C57 PDFBibTeX XMLCite \textit{M. Goerigk}, Ann. Oper. Res. 223, 461--469 (2014; Zbl 1306.90127) Full Text: DOI
Alidaee, Bahram Zero duality gap in surrogate constraint optimization: a concise review of models. (English) Zbl 1305.90001 Eur. J. Oper. Res. 232, No. 2, 241-248 (2014). MSC: 90-02 90C30 90C46 PDFBibTeX XMLCite \textit{B. Alidaee}, Eur. J. Oper. Res. 232, No. 2, 241--248 (2014; Zbl 1305.90001) Full Text: DOI
Côté, Jean-François; Dell’Amico, Mauro; Iori, Manuel Combinatorial Benders’ cuts for the strip packing problem. (English) Zbl 1302.90173 Oper. Res. 62, No. 3, 643-661 (2014). MSC: 90C27 PDFBibTeX XMLCite \textit{J.-F. Côté} et al., Oper. Res. 62, No. 3, 643--661 (2014; Zbl 1302.90173) Full Text: DOI Link
Clautiaux, François; Dell’Amico, Mauro; Iori, Manuel; Khanafer, Ali Lower and upper bounds for the bin packing problem with fragile objects. (English) Zbl 1303.90087 Discrete Appl. Math. 163, Part 1, 73-86 (2014). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{F. Clautiaux} et al., Discrete Appl. Math. 163, Part 1, 73--86 (2014; Zbl 1303.90087) Full Text: DOI
Talla Nobibon, Fabrice; Leus, Roel Complexity results and exact algorithms for robust knapsack problems. (English) Zbl 1291.90209 J. Optim. Theory Appl. 161, No. 2, 533-552 (2014). MSC: 90C27 90C47 PDFBibTeX XMLCite \textit{F. Talla Nobibon} and \textit{R. Leus}, J. Optim. Theory Appl. 161, No. 2, 533--552 (2014; Zbl 1291.90209) Full Text: DOI Link
Hifi, Mhand; Mhalla, Hedi Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study. (English) Zbl 1506.90224 Discrete Optim. 10, No. 4, 320-330 (2013). MSC: 90C27 90C31 90C39 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{H. Mhalla}, Discrete Optim. 10, No. 4, 320--330 (2013; Zbl 1506.90224) Full Text: DOI
Contardo, Claudio; Cordeau, Jean-François; Gendron, Bernard A computational comparison of flow formulations for the capacitated location-routing problem. (English) Zbl 1474.90373 Discrete Optim. 10, No. 4, 263-295 (2013). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{C. Contardo} et al., Discrete Optim. 10, No. 4, 263--295 (2013; Zbl 1474.90373) Full Text: DOI
Alba Martínez, Manuel A.; Clautiaux, François; Dell’Amico, Mauro; Iori, Manuel Exact algorithms for the bin packing problem with fragile objects. (English) Zbl 1506.90212 Discrete Optim. 10, No. 3, 210-223 (2013). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{M. A. Alba Martínez} et al., Discrete Optim. 10, No. 3, 210--223 (2013; Zbl 1506.90212) Full Text: DOI
Monaci, Michele; Pferschy, Ulrich; Serafini, Paolo Exact solution of the robust knapsack problem. (English) Zbl 1348.90549 Comput. Oper. Res. 40, No. 11, 2625-2631 (2013). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{M. Monaci} et al., Comput. Oper. Res. 40, No. 11, 2625--2631 (2013; Zbl 1348.90549) Full Text: DOI
Fortz, B.; Labbé, M.; Louveaux, F.; Poss, M. Stochastic binary problems with simple penalties for capacity constraints violations. (English) Zbl 1266.90134 Math. Program. 138, No. 1-2 (A), 199-221 (2013). MSC: 90C15 90C11 90C09 PDFBibTeX XMLCite \textit{B. Fortz} et al., Math. Program. 138, No. 1--2 (A), 199--221 (2013; Zbl 1266.90134) Full Text: DOI HAL
Zhiqiao, Wu; Kwong, C. K.; Tang, Jiafu; Chan, J. W. K. Integrated model for software component selection with simultaneous consideration of implementation and verification. (English) Zbl 1349.90599 Comput. Oper. Res. 39, No. 12, 3376-3393 (2012). MSC: 90B90 90C27 90C59 90C09 PDFBibTeX XMLCite \textit{W. Zhiqiao} et al., Comput. Oper. Res. 39, No. 12, 3376--3393 (2012; Zbl 1349.90599) Full Text: DOI
Görtz, Simon; Klose, Andreas A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem. (English) Zbl 1460.90099 INFORMS J. Comput. 24, No. 4, 597-610 (2012). MSC: 90B80 90C57 PDFBibTeX XMLCite \textit{S. Görtz} and \textit{A. Klose}, INFORMS J. Comput. 24, No. 4, 597--610 (2012; Zbl 1460.90099) Full Text: DOI
Fischetti, Matteo; Monaci, Michele Cutting plane versus compact formulations for uncertain (integer) linear programs. (English) Zbl 1275.90046 Math. Program. Comput. 4, No. 3, 239-273 (2012). MSC: 90C15 90C05 90C10 PDFBibTeX XMLCite \textit{M. Fischetti} and \textit{M. Monaci}, Math. Program. Comput. 4, No. 3, 239--273 (2012; Zbl 1275.90046) Full Text: DOI
Mansi, Raid; Alves, Cláudio; Valério de Carvalho, J. M.; Hanafi, Saïd An exact algorithm for bilevel 0-1 knapsack problems. (English) Zbl 1264.90149 Math. Probl. Eng. 2012, Article ID 504713, 23 p. (2012). MSC: 90C27 90C09 90C39 PDFBibTeX XMLCite \textit{R. Mansi} et al., Math. Probl. Eng. 2012, Article ID 504713, 23 p. (2012; Zbl 1264.90149) Full Text: DOI
Smith-Miles, Kate; Lopes, Leo Measuring instance difficulty for combinatorial optimization problems. (English) Zbl 1251.90339 Comput. Oper. Res. 39, No. 5, 875-889 (2012). MSC: 90C27 68W99 90C60 PDFBibTeX XMLCite \textit{K. Smith-Miles} and \textit{L. Lopes}, Comput. Oper. Res. 39, No. 5, 875--889 (2012; Zbl 1251.90339) Full Text: DOI
Mesyagutov, M. A.; Scheithauer, Guntram; Belov, Gleb LP bounds in various constraint programming approaches for orthogonal packing. (English) Zbl 1251.90331 Comput. Oper. Res. 39, No. 10, 2425-2438 (2012). MSC: 90C27 05B40 90C10 90C57 PDFBibTeX XMLCite \textit{M. A. Mesyagutov} et al., Comput. Oper. Res. 39, No. 10, 2425--2438 (2012; Zbl 1251.90331) Full Text: DOI
Rong, Aiying; Figueira, José Rui; Klamroth, Kathrin Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem. (English) Zbl 1244.65087 Appl. Math. Comput. 218, No. 12, 6921-6933 (2012). MSC: 65K05 90C10 90C39 91B10 PDFBibTeX XMLCite \textit{A. Rong} et al., Appl. Math. Comput. 218, No. 12, 6921--6933 (2012; Zbl 1244.65087) Full Text: DOI
Escudero, Laureano F.; Landete, Mercedes; Rodríguez-Chía, Antonio M. Stochastic set packing problem. (English) Zbl 1250.90047 Eur. J. Oper. Res. 211, No. 2, 232-240 (2011). MSC: 90B80 90C27 90C15 90C09 PDFBibTeX XMLCite \textit{L. F. Escudero} et al., Eur. J. Oper. Res. 211, No. 2, 232--240 (2011; Zbl 1250.90047) Full Text: DOI
Leitner, Markus; Raidl, Günther R. Branch-and-cut-and-price for capacitated connected facility location. (English) Zbl 1235.90093 J. Math. Model. Algorithms 10, No. 3, 245-267 (2011). MSC: 90C10 90C11 90C57 90C90 PDFBibTeX XMLCite \textit{M. Leitner} and \textit{G. R. Raidl}, J. Math. Model. Algorithms 10, No. 3, 245--267 (2011; Zbl 1235.90093) Full Text: DOI
Lin, Geng; Zhu, Wenxing; Ali, M. M. An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable. (English) Zbl 1229.90167 J. Glob. Optim. 50, No. 4, 657-673 (2011). MSC: 90C27 90C11 PDFBibTeX XMLCite \textit{G. Lin} et al., J. Glob. Optim. 50, No. 4, 657--673 (2011; Zbl 1229.90167) Full Text: DOI
da Cunha, Alexandre Salles; Bahiense, Laura; Lucena, Abilio; de Souza, Cid Carvalho A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem. (English) Zbl 1237.90215 Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 623-630 (2010). MSC: 90C27 90C09 90C57 PDFBibTeX XMLCite \textit{A. S. da Cunha} et al., Electron. Notes Discrete Math. 36, 623--630 (2010; Zbl 1237.90215) Full Text: DOI
Hifi, Mhand; Mhalla, Hedi Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study. (English) Zbl 1237.90195 Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 439-446 (2010). MSC: 90C27 90C31 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{H. Mhalla}, Electron. Notes Discrete Math. 36, 439--446 (2010; Zbl 1237.90195) Full Text: DOI
Stivala, Alex; Stuckey, Peter J.; De La Banda, Maria Garcia; Hermenegildo, Manuel; Wirth, Anthony Lock-free parallel dynamic programming. (English) Zbl 1233.68225 J. Parallel Distrib. Comput. 70, No. 8, 839-848 (2010). MSC: 68W10 90C39 PDFBibTeX XMLCite \textit{A. Stivala} et al., J. Parallel Distrib. Comput. 70, No. 8, 839--848 (2010; Zbl 1233.68225) Full Text: DOI Link
Özaltın, Osman Y.; Prokopyev, Oleg A.; Schaefer, Andrew J. The bilevel knapsack problem with stochastic right-hand sides. (English) Zbl 1193.90180 Oper. Res. Lett. 38, No. 4, 328-333 (2010). MSC: 90C27 90C10 90C15 PDFBibTeX XMLCite \textit{O. Y. Özaltın} et al., Oper. Res. Lett. 38, No. 4, 328--333 (2010; Zbl 1193.90180) Full Text: DOI
Liang, Dong; Wilhelm, Wilbert E. A generalization of column generation to accelerate convergence. (English) Zbl 1184.90102 Math. Program. 122, No. 2 (A), 349-378 (2010). MSC: 90C05 90C10 90B90 49M27 PDFBibTeX XMLCite \textit{D. Liang} and \textit{W. E. Wilhelm}, Math. Program. 122, No. 2 (A), 349--378 (2010; Zbl 1184.90102) Full Text: DOI
Sbihi, Abdelkader A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem. (English) Zbl 1175.90341 Eur. J. Oper. Res. 202, No. 2, 339-346 (2010). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Sbihi}, Eur. J. Oper. Res. 202, No. 2, 339--346 (2010; Zbl 1175.90341) Full Text: DOI
Brotcorne, Luce; Hanafi, Saïd; Mansi, Raïd A dynamic programming algorithm for the bilevel Knapsack problem. (English) Zbl 1167.90622 Oper. Res. Lett. 37, No. 3, 215-218 (2009). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{L. Brotcorne} et al., Oper. Res. Lett. 37, No. 3, 215--218 (2009; Zbl 1167.90622) Full Text: DOI
Poirriez, Vincent; Yanev, Nicola; Andonov, Rumen A hybrid algorithm for the unbounded knapsack problem. (English) Zbl 1160.90642 Discrete Optim. 6, No. 1, 110-124 (2009). MSC: 90C27 90C10 PDFBibTeX XMLCite \textit{V. Poirriez} et al., Discrete Optim. 6, No. 1, 110--124 (2009; Zbl 1160.90642) Full Text: DOI
Bettinelli, Andrea; Ceselli, Alberto; Righini, Giovanni A branch-and-price algorithm for the two-dimensional level strip packing problem. (English) Zbl 1168.90577 4OR 6, No. 4, 361-374 (2008). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Bettinelli} et al., 4OR 6, No. 4, 361--374 (2008; Zbl 1168.90577) Full Text: DOI
Belenky, A. S. A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections. (English) Zbl 1156.91468 Math. Comput. Modelling 48, No. 5-6, 665-676 (2008). MSC: 91F10 90C10 91B12 PDFBibTeX XMLCite \textit{A. S. Belenky}, Math. Comput. Modelling 48, No. 5--6, 665--676 (2008; Zbl 1156.91468) Full Text: DOI
Belgacem, Tarik; Hifi, Mhand Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem. (English) Zbl 1179.90271 Discrete Optim. 5, No. 4, 755-761 (2008). MSC: 90C27 90C31 PDFBibTeX XMLCite \textit{T. Belgacem} and \textit{M. Hifi}, Discrete Optim. 5, No. 4, 755--761 (2008; Zbl 1179.90271) Full Text: DOI
Haouari, Mohamed; Jemmali, Mahdi Tight bounds for the identical parallel machine-scheduling problem. II. (English) Zbl 1135.90346 Int. Trans. Oper. Res. 15, No. 1, 19-34 (2008). MSC: 90B35 90C59 90C57 PDFBibTeX XMLCite \textit{M. Haouari} and \textit{M. Jemmali}, Int. Trans. Oper. Res. 15, No. 1, 19--34 (2008; Zbl 1135.90346) Full Text: DOI
da Silva, Carlos Gomes; Clímaco, João; Figueira, José Rui Core problems in bi-criteria \(\{0,1\}\)-knapsack problems. (English) Zbl 1169.90439 Comput. Oper. Res. 35, No. 7, 2292-2306 (2008). MSC: 90C27 PDFBibTeX XMLCite \textit{C. G. da Silva} et al., Comput. Oper. Res. 35, No. 7, 2292--2306 (2008; Zbl 1169.90439) Full Text: DOI Link
Klose, Andreas Algorithms for solving the single-sink fixed-charge transportation problem. (English) Zbl 1139.90008 Comput. Oper. Res. 35, No. 6, 2079-2092 (2008). MSC: 90B06 90C39 90C57 PDFBibTeX XMLCite \textit{A. Klose}, Comput. Oper. Res. 35, No. 6, 2079--2092 (2008; Zbl 1139.90008) Full Text: DOI
Sbihi, Abdelkader A best first search exact algorithm for the multiple-choice multidimensional knapsack problem. (English) Zbl 1146.90058 J. Comb. Optim. 13, No. 4, 337-351 (2007). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{A. Sbihi}, J. Comb. Optim. 13, No. 4, 337--351 (2007; Zbl 1146.90058) Full Text: DOI
Hifi, M.; Michrafy, M. Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem. (English) Zbl 1141.90512 Comput. Oper. Res. 34, No. 9, 2657-2673 (2007). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Hifi} and \textit{M. Michrafy}, Comput. Oper. Res. 34, No. 9, 2657--2673 (2007; Zbl 1141.90512) Full Text: DOI