Jungwirth, Alexander; Desaulniers, Guy; Frey, Markus; Kolisch, Rainer Exact branch-price-and-cut for a hospital therapist scheduling problem with flexible service locations and time-dependent location capacity. (English) Zbl 07551231 INFORMS J. Comput. 34, No. 2, 1157-1175 (2022). MSC: 90B35 90B06 90C27 90C57 PDF BibTeX XML Cite \textit{A. Jungwirth} et al., INFORMS J. Comput. 34, No. 2, 1157--1175 (2022; Zbl 07551231) Full Text: DOI OpenURL
Li, Yantong; Côté, Jean-François; Callegari-Coelho, Leandro; Wu, Peng Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem. (English) Zbl 07551225 INFORMS J. Comput. 34, No. 2, 1048-1069 (2022). MSC: 90B35 90B80 90C27 90C11 90C05 90C57 PDF BibTeX XML Cite \textit{Y. Li} et al., INFORMS J. Comput. 34, No. 2, 1048--1069 (2022; Zbl 07551225) Full Text: DOI OpenURL
Coniglio, Stefano; Gualandi, Stefano Optimizing over the closure of rank inequalities with a small right-hand side for the maximum stable set problem via bilevel programming. (English) Zbl 07551222 INFORMS J. Comput. 34, No. 2, 1006-1023 (2022). MSC: 90-XX PDF BibTeX XML Cite \textit{S. Coniglio} and \textit{S. Gualandi}, INFORMS J. Comput. 34, No. 2, 1006--1023 (2022; Zbl 07551222) Full Text: DOI OpenURL
Hendel, Gregor; Anderson, Daniel; Le Bodic, Pierre; Pfetsch, Marc E. Estimating the size of branch-and-bound trees. (English) Zbl 07551218 INFORMS J. Comput. 34, No. 2, 934-952 (2022). MSC: 90-XX PDF BibTeX XML Cite \textit{G. Hendel} et al., INFORMS J. Comput. 34, No. 2, 934--952 (2022; Zbl 07551218) Full Text: DOI OpenURL
Adelgren, Nathan; Gupte, Akshay Branch-and-bound for biobjective mixed-integer linear programming. (English) Zbl 07551217 INFORMS J. Comput. 34, No. 2, 909-933 (2022). MSC: 90-XX PDF BibTeX XML Cite \textit{N. Adelgren} and \textit{A. Gupte}, INFORMS J. Comput. 34, No. 2, 909--933 (2022; Zbl 07551217) Full Text: DOI OpenURL
Averkov, Gennadiy; Schymura, Matthias Complexity of linear relaxations in integer programming. (English) Zbl 07550202 Math. Program. 194, No. 1-2 (A), 191-227 (2022). MSC: 90C10 90C57 52B05 52B20 03C10 PDF BibTeX XML Cite \textit{G. Averkov} and \textit{M. Schymura}, Math. Program. 194, No. 1--2 (A), 191--227 (2022; Zbl 07550202) Full Text: DOI OpenURL
Yu, Qinxiao; Adulyasak, Yossiri; Rousseau, Louis-Martin; Zhu, Ning; Ma, Shoufeng Team orienteering with time-varying profit. (English) Zbl 07549377 INFORMS J. Comput. 34, No. 1, 262-280 (2022). MSC: 90B06 90B35 90C11 90C57 90C59 PDF BibTeX XML Cite \textit{Q. Yu} et al., INFORMS J. Comput. 34, No. 1, 262--280 (2022; Zbl 07549377) Full Text: DOI OpenURL
Shen, Peiping; Wang, Kaimin; Lu, Ting Global optimization algorithm for solving linear multiplicative programming problems. (English) Zbl 07548171 Optimization 71, No. 6, 1421-1441 (2022). MSC: 90C30 90C33 90C15 PDF BibTeX XML Cite \textit{P. Shen} et al., Optimization 71, No. 6, 1421--1441 (2022; Zbl 07548171) Full Text: DOI OpenURL
Kim, Eun-Seok; Lee, Ik Sun Scheduling of two-machine flowshop with outsourcing lead-time. (English) Zbl 07546581 Comput. Oper. Res. 145, Article ID 105864, 12 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{E.-S. Kim} and \textit{I. S. Lee}, Comput. Oper. Res. 145, Article ID 105864, 12 p. (2022; Zbl 07546581) Full Text: DOI OpenURL
Li, Debiao; Ruan, Xiaoming; Yue, Qing Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems. (English) Zbl 07546548 Comput. Oper. Res. 144, Article ID 105810, 15 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{D. Li} et al., Comput. Oper. Res. 144, Article ID 105810, 15 p. (2022; Zbl 07546548) Full Text: DOI OpenURL
Fomin, Artem; Goldengorin, Boris An exact algorithm for the preemptive single machine scheduling of equal-length jobs. (English) Zbl 07546500 Comput. Oper. Res. 142, Article ID 105742, 11 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{A. Fomin} and \textit{B. Goldengorin}, Comput. Oper. Res. 142, Article ID 105742, 11 p. (2022; Zbl 07546500) Full Text: DOI OpenURL
Zhang, Zhe; Song, Xiaoling; Huang, Huijun; Yin, Yong; Lev, Benjamin Scheduling problem in seru production system considering DeJong’s learning effect and job splitting. (English) Zbl 07541030 Ann. Oper. Res. 312, No. 2, 1119-1141 (2022). MSC: 90B35 90B30 90C30 90C10 90C57 PDF BibTeX XML Cite \textit{Z. Zhang} et al., Ann. Oper. Res. 312, No. 2, 1119--1141 (2022; Zbl 07541030) Full Text: DOI OpenURL
Oriolo, Gianpaolo; Stauffer, Gautier On the facets of stable set polytopes of circular interval graphs. (English) Zbl 07541026 Ann. Oper. Res. 312, No. 2, 1007-1029 (2022). MSC: 05C76 05C35 90C57 PDF BibTeX XML Cite \textit{G. Oriolo} and \textit{G. Stauffer}, Ann. Oper. Res. 312, No. 2, 1007--1029 (2022; Zbl 07541026) Full Text: DOI OpenURL
Liuzzi, G.; Locatelli, M.; Piccialli, V. A computational study on QP problems with general linear constraints. (English) Zbl 07539451 Optim. Lett. 16, No. 6, 1633-1647 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{G. Liuzzi} et al., Optim. Lett. 16, No. 6, 1633--1647 (2022; Zbl 07539451) Full Text: DOI OpenURL
Maksimenko, A. N. Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes. (English) Zbl 07539119 J. Discrete Math. Sci. Cryptography 25, No. 2, 503-509 (2022). MSC: 52B12 90C57 PDF BibTeX XML Cite \textit{A. N. Maksimenko}, J. Discrete Math. Sci. Cryptography 25, No. 2, 503--509 (2022; Zbl 07539119) Full Text: DOI OpenURL
Rodrigues de Sousa, Vilmar Jefté; Anjos, Miguel F.; Le Digabel, Sébastien Computational study of a branching algorithm for the maximum \(k\)-cut problem. (English) Zbl 07538838 Discrete Optim. 44, Article ID 100656, 20 p. (2022). MSC: 90C57 90C27 90Cxx PDF BibTeX XML Cite \textit{V. J. Rodrigues de Sousa} et al., Discrete Optim. 44, Article ID 100656, 20 p. (2022; Zbl 07538838) Full Text: DOI OpenURL
Gusmeroli, Nicolò; Wiegele, Angelika EXPEDIS: an exact penalty method over discrete sets. (English) Zbl 07538834 Discrete Optim. 44, Article ID 100622, 19 p. (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{N. Gusmeroli} and \textit{A. Wiegele}, Discrete Optim. 44, Article ID 100622, 19 p. (2022; Zbl 07538834) Full Text: DOI OpenURL
Forget, Nicolas; Gadegaard, Sune Lauth; Nielsen, Lars Relund Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs. (English) Zbl 07538173 Eur. J. Oper. Res. 302, No. 3, 909-924 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{N. Forget} et al., Eur. J. Oper. Res. 302, No. 3, 909--924 (2022; Zbl 07538173) Full Text: DOI OpenURL
Diefenbach, Johannes; Stolletz, Raik Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm. (English) Zbl 07538151 Eur. J. Oper. Res. 302, No. 2, 589-605 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{J. Diefenbach} and \textit{R. Stolletz}, Eur. J. Oper. Res. 302, No. 2, 589--605 (2022; Zbl 07538151) Full Text: DOI OpenURL
Arutyunova, N. K.; Dulliev, A. M.; Zabotin, V. I. Global optimization of multivariable functions satisfying the Vanderbei condition. (English) Zbl 07532875 J. Appl. Math. Comput. 68, No. 2, 1135-1161 (2022). MSC: 90C26 90C56 90C57 65K05 PDF BibTeX XML Cite \textit{N. K. Arutyunova} et al., J. Appl. Math. Comput. 68, No. 2, 1135--1161 (2022; Zbl 07532875) Full Text: DOI OpenURL
Karbasy, Saeid Ansary; Salahi, Maziar On the branch and bound algorithm for the extended trust-region subproblem. (English) Zbl 07531910 J. Glob. Optim. 83, No. 2, 221-233 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{S. A. Karbasy} and \textit{M. Salahi}, J. Glob. Optim. 83, No. 2, 221--233 (2022; Zbl 07531910) Full Text: DOI OpenURL
Kuno, Takahito A revision of the rectangular algorithm for a class of DC optimization problems. (English) Zbl 07531908 J. Glob. Optim. 83, No. 2, 187-200 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{T. Kuno}, J. Glob. Optim. 83, No. 2, 187--200 (2022; Zbl 07531908) Full Text: DOI OpenURL
Zhao, Shuang Scheduling jobs with general truncated learning effects including proportional setup times. (English) Zbl 07530568 Comput. Appl. Math. 41, No. 4, Paper No. 146, 25 p. (2022). MSC: 90B35 90C26 PDF BibTeX XML Cite \textit{S. Zhao}, Comput. Appl. Math. 41, No. 4, Paper No. 146, 25 p. (2022; Zbl 07530568) Full Text: DOI OpenURL
Yang, Yu; Boland, Natashia; Dilkina, Bistra; Savelsbergh, Martin Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems. (English) Zbl 07530061 Eur. J. Oper. Res. 301, No. 3, 828-840 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{Y. Yang} et al., Eur. J. Oper. Res. 301, No. 3, 828--840 (2022; Zbl 07530061) Full Text: DOI OpenURL
Faenza, Yuri; Kavitha, Telikepalli Quasi-popular matchings, optimality, and extended formulations. (English) Zbl 07527996 Math. Oper. Res. 47, No. 1, 427-457 (2022). MSC: 05C70 91B68 90C57 PDF BibTeX XML Cite \textit{Y. Faenza} and \textit{T. Kavitha}, Math. Oper. Res. 47, No. 1, 427--457 (2022; Zbl 07527996) Full Text: DOI OpenURL
Gutekunst, Samuel C.; Williamson, David P. Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps. (English) Zbl 07527977 Math. Oper. Res. 47, No. 1, 1-28 (2022). MSC: 90C22 90C57 90C27 05C85 68R05 68W25 PDF BibTeX XML Cite \textit{S. C. Gutekunst} and \textit{D. P. Williamson}, Math. Oper. Res. 47, No. 1, 1--28 (2022; Zbl 07527977) Full Text: DOI OpenURL
Ulusoy, Aly-Joy; Pecci, Filippo; Stoianov, Ivan Bi-objective design-for-control of water distribution networks with global bounds. (English) Zbl 07525361 Optim. Eng. 23, No. 1, 527-577 (2022). MSC: 90Cxx 65Kxx 90-XX PDF BibTeX XML Cite \textit{A.-J. Ulusoy} et al., Optim. Eng. 23, No. 1, 527--577 (2022; Zbl 07525361) Full Text: DOI OpenURL
Abdi, Ahmad; Cornuéjols, Gérard; Guenin, Bertrand; Tunçel, Levent Clean clutters and dyadic fractional packings. (English) Zbl 07510402 SIAM J. Discrete Math. 36, No. 2, 1012-1037 (2022). MSC: 90Cxx 90-XX 05-XX 90C57 05B35 PDF BibTeX XML Cite \textit{A. Abdi} et al., SIAM J. Discrete Math. 36, No. 2, 1012--1037 (2022; Zbl 07510402) Full Text: DOI OpenURL
Pfetsch, Marc E.; Rinaldi, Giovanni; Ventura, Paolo Optimal patchings for consecutive ones matrices. (English) Zbl 1484.90047 Math. Program. Comput. 14, No. 1, 43-84 (2022). MSC: 90C10 90C57 52B12 PDF BibTeX XML Cite \textit{M. E. Pfetsch} et al., Math. Program. Comput. 14, No. 1, 43--84 (2022; Zbl 1484.90047) Full Text: DOI OpenURL
Kim, Kibaek; Dandurand, Brian Scalable branching on dual decomposition of stochastic mixed-integer programming problems. (English) Zbl 07507320 Math. Program. Comput. 14, No. 1, 1-41 (2022). MSC: 90C15 90C11 90C30 90C46 90C57 PDF BibTeX XML Cite \textit{K. Kim} and \textit{B. Dandurand}, Math. Program. Comput. 14, No. 1, 1--41 (2022; Zbl 07507320) Full Text: DOI OpenURL
Jiao, Hongwei; Ma, Junqiao; Shang, Youlin Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem. (English) Zbl 1483.90114 Pac. J. Optim. 18, No. 1, 195-212 (2022). MSC: 90C26 90C32 90C57 PDF BibTeX XML Cite \textit{H. Jiao} et al., Pac. J. Optim. 18, No. 1, 195--212 (2022; Zbl 1483.90114) Full Text: Link OpenURL
Huang, Bingdi; Shen, Peiping Global optimization algorithm for solving sum of linear ratios problems. (English) Zbl 1483.90158 Pac. J. Optim. 18, No. 1, 177-194 (2022). MSC: 90C30 90C33 90C15 PDF BibTeX XML Cite \textit{B. Huang} and \textit{P. Shen}, Pac. J. Optim. 18, No. 1, 177--194 (2022; Zbl 1483.90158) Full Text: Link OpenURL
Gaar, Elisabeth; Siebenhofer, Melanie; Wiegele, Angelika An SDP-based approach for computing the stability number of a graph. (English) Zbl 07505274 Math. Methods Oper. Res. 95, No. 1, 141-161 (2022). MSC: 90C27 90C22 PDF BibTeX XML Cite \textit{E. Gaar} et al., Math. Methods Oper. Res. 95, No. 1, 141--161 (2022; Zbl 07505274) Full Text: DOI OpenURL
Martí, Rafael; Reinelt, Gerhard Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem. 2nd edition. (English) Zbl 07504330 Applied Mathematical Sciences 175. Berlin: Springer (ISBN 978-3-662-64876-6/hbk; 978-3-662-64879-7/pbk; 978-3-662-64877-3/ebook). xi, 227 p. (2022). MSC: 90C27 90C59 90C57 PDF BibTeX XML Cite \textit{R. Martí} and \textit{G. Reinelt}, Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem. 2nd edition. Berlin: Springer (2022; Zbl 07504330) Full Text: DOI OpenURL
Clément, François; Doerr, Carola; Paquete, Luís Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions. (English) Zbl 07502619 J. Complexity 70, Article ID 101645, 34 p. (2022). MSC: 11K38 65C05 65D30 65D32 11J71 PDF BibTeX XML Cite \textit{F. Clément} et al., J. Complexity 70, Article ID 101645, 34 p. (2022; Zbl 07502619) Full Text: DOI OpenURL
Rodríguez-Heck, Elisabeth; Stickler, Karl; Walter, Matthias; Weltge, Stefan Persistency of linear programming relaxations for the stable set problem. (English) Zbl 07495425 Math. Program. 192, No. 1-2 (B), 387-407 (2022). MSC: 90C27 90C57 90C05 PDF BibTeX XML Cite \textit{E. Rodríguez-Heck} et al., Math. Program. 192, No. 1--2 (B), 387--407 (2022; Zbl 07495425) Full Text: DOI OpenURL
Dash, Sanjeeb; Günlük, Oktay; Lee, Dabeen On a generalization of the Chvátal-Gomory closure. (English) Zbl 07495416 Math. Program. 192, No. 1-2 (B), 149-175 (2022). MSC: 90C10 90C11 90C27 90C57 PDF BibTeX XML Cite \textit{S. Dash} et al., Math. Program. 192, No. 1--2 (B), 149--175 (2022; Zbl 07495416) Full Text: DOI OpenURL
Abdi, Ahmad; Cornuéjols, Gérard; Huynh, Tony; Lee, Dabeen Correction to: “Idealness of \(k\)-wise intersecting families”. (English) Zbl 07495412 Math. Program. 192, No. 1-2 (B), 51-55 (2022). MSC: 90C57 05B40 PDF BibTeX XML Cite \textit{A. Abdi} et al., Math. Program. 192, No. 1--2 (B), 51--55 (2022; Zbl 07495412) Full Text: DOI OpenURL
Abdi, Ahmad; Cornuéjols, Gérard; Huynh, Tony; Lee, Dabeen Idealness of \(k\)-wise intersecting families. (English) Zbl 07495411 Math. Program. 192, No. 1-2 (B), 29-50 (2022). MSC: 90C57 05B40 PDF BibTeX XML Cite \textit{A. Abdi} et al., Math. Program. 192, No. 1--2 (B), 29--50 (2022; Zbl 07495411) Full Text: DOI OpenURL
Lodi, Andrea; Malaguti, Enrico; Nannicini, Giacomo; Thomopulos, Dimitri Nonlinear chance-constrained problems with applications to hydro scheduling. (English) Zbl 07495393 Math. Program. 191, No. 1 (B), 405-444 (2022). MSC: 90C15 49M27 90C57 PDF BibTeX XML Cite \textit{A. Lodi} et al., Math. Program. 191, No. 1 (B), 405--444 (2022; Zbl 07495393) Full Text: DOI OpenURL
Jiao, Hongwei; Shang, Youlin; Wang, Wenjie Solving generalized polynomial problem by using new affine relaxed technique. (English) Zbl 07494126 Int. J. Comput. Math. 99, No. 2, 309-331 (2022). MSC: 90C26 90C32 65K05 PDF BibTeX XML Cite \textit{H. Jiao} et al., Int. J. Comput. Math. 99, No. 2, 309--331 (2022; Zbl 07494126) Full Text: DOI OpenURL
Moon, Kyungduk; Lee, Kangbok; Chopra, Sunil; Kwon, Steve Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy. (English) Zbl 07493210 Eur. J. Oper. Res. 300, No. 2, 743-754 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{K. Moon} et al., Eur. J. Oper. Res. 300, No. 2, 743--754 (2022; Zbl 07493210) Full Text: DOI OpenURL
Zhang, Bo; Gao, YueLin; Liu, Xia; Huang, XiaoLi An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems. (English) Zbl 07492863 J. Optim. Theory Appl. 192, No. 3, 830-855 (2022). MSC: 90C26 90C32 90C57 PDF BibTeX XML Cite \textit{B. Zhang} et al., J. Optim. Theory Appl. 192, No. 3, 830--855 (2022; Zbl 07492863) Full Text: DOI OpenURL
Sharma, Meenarli; Palkar, Prashant; Mahajan, Ashutosh Linearization and parallelization schemes for convex mixed-integer nonlinear optimization. (English) Zbl 07490079 Comput. Optim. Appl. 81, No. 2, 423-478 (2022). MSC: 90C11 90C25 90C57 PDF BibTeX XML Cite \textit{M. Sharma} et al., Comput. Optim. Appl. 81, No. 2, 423--478 (2022; Zbl 07490079) Full Text: DOI OpenURL
De Rosa, Antonio; Khajavirad, Aida The ratio-cut polytope and K-means clustering. (English) Zbl 07489488 SIAM J. Optim. 32, No. 1, 173-203 (2022). MSC: 90C05 90C57 62H30 49Q20 68Q87 PDF BibTeX XML Cite \textit{A. De Rosa} and \textit{A. Khajavirad}, SIAM J. Optim. 32, No. 1, 173--203 (2022; Zbl 07489488) Full Text: DOI arXiv OpenURL
Jiang, Hongyi; Basu, Amitabh Enumerating integer points in polytopes with bounded subdeterminants. (English) Zbl 07489478 SIAM J. Discrete Math. 36, No. 1, 449-460 (2022). MSC: 90C10 90C57 90C60 PDF BibTeX XML Cite \textit{H. Jiang} and \textit{A. Basu}, SIAM J. Discrete Math. 36, No. 1, 449--460 (2022; Zbl 07489478) Full Text: DOI arXiv OpenURL
Ahmed Sidi, Mohamed Lemine; Bocquillon, Ronan; Mohamed Babou, Hafedh; Dhib, Cheikh; Néron, Emmanuel; Soukhal, Ameur; Nanne, Mohamedade Farouk Improved approaches to solve the one-to-one skewgram problem. (English) Zbl 07486374 Comput. Oper. Res. 138, Article ID 105584, 8 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{M. L. Ahmed Sidi} et al., Comput. Oper. Res. 138, Article ID 105584, 8 p. (2022; Zbl 07486374) Full Text: DOI OpenURL
Fleszar, Krzysztof A branch-and-bound algorithm for the quadratic multiple knapsack problem. (English) Zbl 07478884 Eur. J. Oper. Res. 298, No. 1, 89-98 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{K. Fleszar}, Eur. J. Oper. Res. 298, No. 1, 89--98 (2022; Zbl 07478884) Full Text: DOI OpenURL
Wang, Chunfeng; Deng, Yaping; Shen, Peiping A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems. (English) Zbl 1485.90099 J. Comput. Appl. Math. 407, Article ID 114080, 11 p. (2022). MSC: 90C26 90C59 PDF BibTeX XML Cite \textit{C. Wang} et al., J. Comput. Appl. Math. 407, Article ID 114080, 11 p. (2022; Zbl 1485.90099) Full Text: DOI OpenURL
Tang, Peng; Peng, Kaixiang; Jiao, Ruihua A process monitoring and fault isolation framework based on variational autoencoders and branch and bound method. (English) Zbl 1481.93099 J. Franklin Inst. 359, No. 2, 1667-1691 (2022). MSC: 93C95 93C10 PDF BibTeX XML Cite \textit{P. Tang} et al., J. Franklin Inst. 359, No. 2, 1667--1691 (2022; Zbl 1481.93099) Full Text: DOI OpenURL
Gade, Jan-Lucas; Thore, Carl-Johan; Stålhand, Jonas Identification of mechanical properties of arteries with certification of global optimality. (English) Zbl 1484.90085 J. Glob. Optim. 82, No. 1, 195-217 (2022). MSC: 90C26 90C57 90C90 PDF BibTeX XML Cite \textit{J.-L. Gade} et al., J. Glob. Optim. 82, No. 1, 195--217 (2022; Zbl 1484.90085) Full Text: DOI OpenURL
Zhai, Jianyuan; Boukouvala, Fani Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization. (English) Zbl 1484.90091 J. Glob. Optim. 82, No. 1, 21-50 (2022). MSC: 90C26 90C57 PDF BibTeX XML Cite \textit{J. Zhai} and \textit{F. Boukouvala}, J. Glob. Optim. 82, No. 1, 21--50 (2022; Zbl 1484.90091) Full Text: DOI OpenURL
Grandcolas, Stéphane; Pain-Barre, Cyril A hybrid metaheuristic for the two-dimensional strip packing problem. (English) Zbl 1478.90106 Ann. Oper. Res. 309, No. 1, 79-102 (2022). MSC: 90C27 90C59 90C57 90B35 68R10 PDF BibTeX XML Cite \textit{S. Grandcolas} and \textit{C. Pain-Barre}, Ann. Oper. Res. 309, No. 1, 79--102 (2022; Zbl 1478.90106) Full Text: DOI OpenURL
Speakman, Emily; Averkov, Gennadiy Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes. (English) Zbl 1484.52004 Discrete Appl. Math. 308, 36-45 (2022). Reviewer: Gaiane Panina (St. Petersburg) MSC: 52A39 PDF BibTeX XML Cite \textit{E. Speakman} and \textit{G. Averkov}, Discrete Appl. Math. 308, 36--45 (2022; Zbl 1484.52004) Full Text: DOI arXiv OpenURL
Hernández-Pérez, Hipólito; Salazar-González, Juan-José A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem. (English) Zbl 07422912 Eur. J. Oper. Res. 297, No. 2, 467-483 (2022). MSC: 90B06 90C11 90C57 PDF BibTeX XML Cite \textit{H. Hernández-Pérez} and \textit{J.-J. Salazar-González}, Eur. J. Oper. Res. 297, No. 2, 467--483 (2022; Zbl 07422912) Full Text: DOI OpenURL
Novak, Antonin; Sucha, Premysl; Novotny, Matej; Stec, Richard; Hanzalek, Zdenek Scheduling jobs with normally distributed processing times on parallel machines. (English) Zbl 07422909 Eur. J. Oper. Res. 297, No. 2, 422-441 (2022). MSC: 90B36 90C57 PDF BibTeX XML Cite \textit{A. Novak} et al., Eur. J. Oper. Res. 297, No. 2, 422--441 (2022; Zbl 07422909) Full Text: DOI OpenURL
Bachtenkirch, David; Bock, Stefan Finding efficient make-to-order production and batch delivery schedules. (English) Zbl 07422887 Eur. J. Oper. Res. 297, No. 1, 133-152 (2022). MSC: 90B35 90C57 90C59 PDF BibTeX XML Cite \textit{D. Bachtenkirch} and \textit{S. Bock}, Eur. J. Oper. Res. 297, No. 1, 133--152 (2022; Zbl 07422887) Full Text: DOI OpenURL
Zhou, Yi; Lin, Weibo; Hao, Jin-Kao; Xiao, Mingyu; Jin, Yan An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem. (English) Zbl 07422880 Eur. J. Oper. Res. 297, No. 1, 27-39 (2022). MSC: 90C35 05C85 05C69 90C27 90C57 91D30 PDF BibTeX XML Cite \textit{Y. Zhou} et al., Eur. J. Oper. Res. 297, No. 1, 27--39 (2022; Zbl 07422880) Full Text: DOI OpenURL
Bulhões, Teobaldo; Correia, Rubens; Subramanian, Anand Conference scheduling: a clustering-based approach. (English) Zbl 07422879 Eur. J. Oper. Res. 297, No. 1, 15-26 (2022). MSC: 90B35 90C10 90C57 PDF BibTeX XML Cite \textit{T. Bulhões} et al., Eur. J. Oper. Res. 297, No. 1, 15--26 (2022; Zbl 07422879) Full Text: DOI OpenURL
Zhang, Junlong; Özaltın, Osman Y. Bilevel integer programs with stochastic right-hand sides. (English) Zbl 07549355 INFORMS J. Comput. 33, No. 4, 1644-1660 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{J. Zhang} and \textit{O. Y. Özaltın}, INFORMS J. Comput. 33, No. 4, 1644--1660 (2021; Zbl 07549355) Full Text: DOI OpenURL
Zhu, Xiaojun; Tang, Shaojie A branch-and-bound algorithm for building optimal data gathering tree in wireless sensor networks. (English) Zbl 07549344 INFORMS J. Comput. 33, No. 4, 1446-1460 (2021). MSC: 90B18 90C05 90C10 90C57 PDF BibTeX XML Cite \textit{X. Zhu} and \textit{S. Tang}, INFORMS J. Comput. 33, No. 4, 1446--1460 (2021; Zbl 07549344) Full Text: DOI OpenURL
Cen, Xiaoli; Xia, Yong A new global optimization scheme for quadratic programs with low-rank nonconvexity. (English) Zbl 07549339 INFORMS J. Comput. 33, No. 4, 1368-1383 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{X. Cen} and \textit{Y. Xia}, INFORMS J. Comput. 33, No. 4, 1368--1383 (2021; Zbl 07549339) Full Text: DOI OpenURL
Yang, Yu; Boland, Natashia; Savelsbergh, Martin Multivariable branching: a 0-1 knapsack problem case study. (English) Zbl 07549338 INFORMS J. Comput. 33, No. 4, 1354-1367 (2021). MSC: 90-XX PDF BibTeX XML Cite \textit{Y. Yang} et al., INFORMS J. Comput. 33, No. 4, 1354--1367 (2021; Zbl 07549338) Full Text: DOI OpenURL
Berktaş, Nihal; Yaman, Hande A branch-and-bound algorithm for team formation on social networks. (English) Zbl 07548831 INFORMS J. Comput. 33, No. 3, 1162-1176 (2021). MSC: 90-XX 91-XX PDF BibTeX XML Cite \textit{N. Berktaş} and \textit{H. Yaman}, INFORMS J. Comput. 33, No. 3, 1162--1176 (2021; Zbl 07548831) Full Text: DOI OpenURL
Mistry, Miten; Letsios, Dimitrios; Krennrich, Gerhard; Lee, Robert M.; Misener, Ruth Mixed-integer convex nonlinear optimization with gradient-boosted trees embedded. (English) Zbl 07548828 INFORMS J. Comput. 33, No. 3, 1103-1119 (2021). MSC: 90-XX 62-XX PDF BibTeX XML Cite \textit{M. Mistry} et al., INFORMS J. Comput. 33, No. 3, 1103--1119 (2021; Zbl 07548828) Full Text: DOI OpenURL
Zhang, Wenda; Sauppe, Jason J.; Jacobson, Sheldon H. An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints. (English) Zbl 07548827 INFORMS J. Comput. 33, No. 3, 1091-1102 (2021). MSC: 90B35 90C57 90C59 PDF BibTeX XML Cite \textit{W. Zhang} et al., INFORMS J. Comput. 33, No. 3, 1091--1102 (2021; Zbl 07548827) Full Text: DOI OpenURL
Aaid, Djamel; Noui, Amel; Özer, Özen Piecewise quadratic bounding functions for finding real roots of polynomials. (English) Zbl 07542947 Numer. Algebra Control Optim. 11, No. 1, 63-73 (2021). MSC: 26C10 90C20 90C25 90C90 PDF BibTeX XML Cite \textit{D. Aaid} et al., Numer. Algebra Control Optim. 11, No. 1, 63--73 (2021; Zbl 07542947) Full Text: DOI OpenURL
Müller, Tim M.; Leise, Philipp; Lorenz, Imke-Sophie; Altherr, Lena C.; Pelz, Peter F. Optimization and validation of pumping system design and operation for water supply in high-rise buildings. (English) Zbl 07527849 Optim. Eng. 22, No. 2, 643-686 (2021). MSC: 90C11 90C26 90C15 90C57 90C10 PDF BibTeX XML Cite \textit{T. M. Müller} et al., Optim. Eng. 22, No. 2, 643--686 (2021; Zbl 07527849) Full Text: DOI OpenURL
Perevozchikov, A. G.; Reshetov, V. Yu.; Yanochkin, I. E. Generalized target-allocation functions and their evaluation by the branch-and-bound method. (English. Russian original) Zbl 07513596 Comput. Math. Model. 32, No. 2, 183-197 (2021); translation from Prikl. Mat. Inf. 66, 89-103 (2021). MSC: 65-XX 90-XX PDF BibTeX XML Cite \textit{A. G. Perevozchikov} et al., Comput. Math. Model. 32, No. 2, 183--197 (2021; Zbl 07513596); translation from Prikl. Mat. Inf. 66, 89--103 (2021) Full Text: DOI OpenURL
He, Sicheng; Shahabsafa, Mohammad; Lei, Weiming; Mohammad-Nezhad, Ali; Terlaky, Tamás; Zuluaga, Luis; Martins, Joaquim R. R. A. Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems. (English) Zbl 07512257 Optim. Eng. 22, No. 3, 1589-1624 (2021). MSC: 74P15 74P05 74E30 PDF BibTeX XML Cite \textit{S. He} et al., Optim. Eng. 22, No. 3, 1589--1624 (2021; Zbl 07512257) Full Text: DOI OpenURL
Bonvin, Gratien; Demassey, Sophie; Lodi, Andrea Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound. (English) Zbl 07512246 Optim. Eng. 22, No. 3, 1275-1313 (2021). MSC: 90B35 90C11 90C30 90C57 90C59 90B10 90C26 PDF BibTeX XML Cite \textit{G. Bonvin} et al., Optim. Eng. 22, No. 3, 1275--1313 (2021; Zbl 07512246) Full Text: DOI OpenURL
Alizadeh, Pegah; Traversi, Emiliano; Osmani, Aomar Deterministic policies based on maximum regrets in MDPs with imprecise rewards. (English) Zbl 07509003 AI Commun. 34, No. 4, 229-244 (2021). MSC: 68T20 90C40 PDF BibTeX XML Cite \textit{P. Alizadeh} et al., AI Commun. 34, No. 4, 229--244 (2021; Zbl 07509003) Full Text: DOI OpenURL
Aprile, Manuel; Fiorini, Samuel; Huynh, Tony; Joret, Gwenaël; Wood, David R. Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond. (English) Zbl 07503018 Electron. J. Comb. 28, No. 4, Research Paper P4.47, 16 p. (2021). MSC: 05C83 05C40 90C05 90C57 90C11 PDF BibTeX XML Cite \textit{M. Aprile} et al., Electron. J. Comb. 28, No. 4, Research Paper P4.47, 16 p. (2021; Zbl 07503018) Full Text: DOI OpenURL
Aliannezhadi, S.; Molai, A. Abbasi A new algorithm for solving linear programming problems with bipolar fuzzy relation equation constraints. (English) Zbl 1482.90255 Iran. J. Numer. Anal. Optim. 11, No. 2, 407-435 (2021). MSC: 90C70 90C46 90C26 90C05 90C57 PDF BibTeX XML Cite \textit{S. Aliannezhadi} and \textit{A. A. Molai}, Iran. J. Numer. Anal. Optim. 11, No. 2, 407--435 (2021; Zbl 1482.90255) Full Text: DOI OpenURL
Bychkov, Andrey; Pogudin, Gleb Optimal monomial quadratization for ODE systems. (English) Zbl 07495018 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 122-136 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{A. Bychkov} and \textit{G. Pogudin}, Lect. Notes Comput. Sci. 12757, 122--136 (2021; Zbl 07495018) Full Text: DOI arXiv OpenURL
Parjadis, Augustin; Cappart, Quentin; Rousseau, Louis-Martin; Bergman, David Improving branch-and-bound using decision diagrams and reinforcement learning. (English) Zbl 07493645 Stuckey, Peter J. (ed.), Integration of constraint programming, artificial intelligence, and operations research. 18th international conference, CPAIOR 2021, Vienna, Austria, July 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12735, 446-455 (2021). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{A. Parjadis} et al., Lect. Notes Comput. Sci. 12735, 446--455 (2021; Zbl 07493645) Full Text: DOI OpenURL
De Santis, Marianna; Eichfelder, Gabriele A decision space algorithm for multiobjective convex quadratic integer optimization. (English) Zbl 07486218 Comput. Oper. Res. 134, Article ID 105396, 13 p. (2021). MSC: 90Bxx 90C10 90C25 90C29 90C57 PDF BibTeX XML Cite \textit{M. De Santis} and \textit{G. Eichfelder}, Comput. Oper. Res. 134, Article ID 105396, 13 p. (2021; Zbl 07486218) Full Text: DOI OpenURL
Li, Yongzhen; Lin, Yuqin; Shu, Jia Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs. (English) Zbl 07485359 Comput. Oper. Res. 133, Article ID 105347, 12 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{Y. Li} et al., Comput. Oper. Res. 133, Article ID 105347, 12 p. (2021; Zbl 07485359) Full Text: DOI OpenURL
Kouider, Ahmed; Ait Haddadène, Hacène A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach. (English) Zbl 07485344 Comput. Oper. Res. 132, Article ID 105319, 13 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{A. Kouider} and \textit{H. Ait Haddadène}, Comput. Oper. Res. 132, Article ID 105319, 13 p. (2021; Zbl 07485344) Full Text: DOI OpenURL
Li, Zixiang; Kucukkoc, Ibrahim; Tang, Qiuhua Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem. (English) Zbl 07485265 Comput. Oper. Res. 131, Article ID 105235, 9 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{Z. Li} et al., Comput. Oper. Res. 131, Article ID 105235, 9 p. (2021; Zbl 07485265) Full Text: DOI OpenURL
Molaee, Ehsan; Sadeghian, Ramin; Fattahi, Parviz Minimizing maximum tardiness on a single machine with family setup times and machine disruption. (English) Zbl 07485247 Comput. Oper. Res. 129, Article ID 105231, 23 p. (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{E. Molaee} et al., Comput. Oper. Res. 129, Article ID 105231, 23 p. (2021; Zbl 07485247) Full Text: DOI OpenURL
Gawali, Deepak D.; Patil, Bhagyesh V.; Zidna, Ahmed; Nataraj, P. S. V. Constrained global optimization of multivariate polynomials using polynomial B-spline form and B-spline consistency prune approach. (English) Zbl 07477207 RAIRO, Oper. Res. 55, No. 6, 3743-3771 (2021). MSC: 90C26 90C23 90C57 PDF BibTeX XML Cite \textit{D. D. Gawali} et al., RAIRO, Oper. Res. 55, No. 6, 3743--3771 (2021; Zbl 07477207) Full Text: DOI OpenURL
Becker, Matthias; Ginoux, Nicolas; Martin, Sébastien; Róka, Zsuzsanna Tire noise optimization problem: a mixed integer linear programming approach. (English) Zbl 1485.90072 RAIRO, Oper. Res. 55, No. 5, 3073-3085 (2021). MSC: 90C11 90C57 90C90 65K05 PDF BibTeX XML Cite \textit{M. Becker} et al., RAIRO, Oper. Res. 55, No. 5, 3073--3085 (2021; Zbl 1485.90072) Full Text: DOI arXiv OpenURL
Brandenberg, René; Stursberg, Paul Refined cut selection for Benders decomposition: applied to network capacity expansion problems. (English) Zbl 1485.90064 Math. Methods Oper. Res. 94, No. 3, 383-412 (2021). MSC: 90C05 90C57 90C29 PDF BibTeX XML Cite \textit{R. Brandenberg} and \textit{P. Stursberg}, Math. Methods Oper. Res. 94, No. 3, 383--412 (2021; Zbl 1485.90064) Full Text: DOI OpenURL
Li, Jiaxin; Lan, Yan; Chen, Feng; Han, Xin; Blazewicz, Jacek A fast algorithm for knapsack problem with conflict graph. (English) Zbl 1484.90095 Asia-Pac. J. Oper. Res. 38, No. 6, Article ID 2150010, 34 p. (2021). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{J. Li} et al., Asia-Pac. J. Oper. Res. 38, No. 6, Article ID 2150010, 34 p. (2021; Zbl 1484.90095) Full Text: DOI OpenURL
Aktaş, Fatih S.; Ekmekcioglu, Ömer; Pinar, Mustafa Ç. Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration. (English) Zbl 1478.65028 Optim. Eng. 22, No. 4, 2505-2535 (2021). MSC: 65F20 65F22 65K05 90C26 PDF BibTeX XML Cite \textit{F. S. Aktaş} et al., Optim. Eng. 22, No. 4, 2505--2535 (2021; Zbl 1478.65028) Full Text: DOI OpenURL
Thang, Tran Van; Kim, Jong Kyu; Lim, Won Hee Monotonic optimization techniques for solving knapsack problems. (English) Zbl 1477.90093 Nonlinear Funct. Anal. Appl. 26, No. 3, 611-628 (2021). MSC: 90C27 90C57 90C46 PDF BibTeX XML Cite \textit{T. Van Thang} et al., Nonlinear Funct. Anal. Appl. 26, No. 3, 611--628 (2021; Zbl 1477.90093) Full Text: Link OpenURL
Nannicini, Giacomo; Traversi, Emiliano; Calvo, Roberto Wolfler A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs. (English) Zbl 1480.49034 Math. Program. Comput. 13, No. 4, 645-681 (2021). MSC: 49M27 90C15 90C57 90C39 PDF BibTeX XML Cite \textit{G. Nannicini} et al., Math. Program. Comput. 13, No. 4, 645--681 (2021; Zbl 1480.49034) Full Text: DOI OpenURL
Kim, YongJin; Jong, YunChol; Yu, JinWon A parametric solution method for a generalized fractional programming problem. (English) Zbl 1477.90111 Indian J. Pure Appl. Math. 52, No. 4, 971-989 (2021). MSC: 90C32 90C57 90C26 65K05 90C30 PDF BibTeX XML Cite \textit{Y. Kim} et al., Indian J. Pure Appl. Math. 52, No. 4, 971--989 (2021; Zbl 1477.90111) Full Text: DOI OpenURL
Long, Philip M. Superlinear integrality gaps for the minimum majority problem. (English) Zbl 07453660 SIAM J. Discrete Math. 35, No. 4, 3004-3016 (2021). MSC: 68Q17 90C05 90C57 PDF BibTeX XML Cite \textit{P. M. Long}, SIAM J. Discrete Math. 35, No. 4, 3004--3016 (2021; Zbl 07453660) Full Text: DOI OpenURL
Borst, Sander; Dadush, Daniel; Huiberts, Sophie; Tiwari, Samarth On the integrality gap of binary integer programs with Gaussian data. (English) Zbl 1483.90079 Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 427-442 (2021). MSC: 90C10 90C57 PDF BibTeX XML Cite \textit{S. Borst} et al., Lect. Notes Comput. Sci. 12707, 427--442 (2021; Zbl 1483.90079) Full Text: DOI arXiv OpenURL
Verschae, José; Villagra, Matías; von Niederhäusern, Léonard On the geometry of symmetry breaking inequalities. (English) Zbl 1482.90124 Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 73-88 (2021). MSC: 90C10 90C57 PDF BibTeX XML Cite \textit{J. Verschae} et al., Lect. Notes Comput. Sci. 12707, 73--88 (2021; Zbl 1482.90124) Full Text: DOI arXiv OpenURL
Ahipaşaoğlu, Selin Damla A branch-and-bound algorithm for the exact optimal experimental design problem. (English) Zbl 1475.62015 Stat. Comput. 31, No. 5, Paper No. 65, 11 p. (2021). MSC: 62-08 62K05 90C57 PDF BibTeX XML Cite \textit{S. D. Ahipaşaoğlu}, Stat. Comput. 31, No. 5, Paper No. 65, 11 p. (2021; Zbl 1475.62015) Full Text: DOI OpenURL
Cacciola, Matteo; Frangioni, Antonio; Galli, Laura; Stea, Giovanni A Lagrangian approach to chance constrained routing with local broadcast. (English) Zbl 1479.90053 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 277-291 (2021). MSC: 90B18 90B10 90B15 90C11 90C05 90C30 90C26 PDF BibTeX XML Cite \textit{M. Cacciola} et al., AIRO Springer Ser. 5, 277--291 (2021; Zbl 1479.90053) Full Text: DOI OpenURL
Luo, Fengqiao; Mehrotra, Sanjay A geometric branch and bound method for robust maximization of convex functions. (English) Zbl 1481.90241 J. Glob. Optim. 81, No. 4, 835-859 (2021). MSC: 90C17 90C26 90C57 PDF BibTeX XML Cite \textit{F. Luo} and \textit{S. Mehrotra}, J. Glob. Optim. 81, No. 4, 835--859 (2021; Zbl 1481.90241) Full Text: DOI arXiv OpenURL
Markót, Mihály Csaba Improved interval methods for solving circle packing problems in the unit square. (English) Zbl 1477.52026 J. Glob. Optim. 81, No. 3, 773-803 (2021). MSC: 52C15 52C26 65G30 65K05 90C30 PDF BibTeX XML Cite \textit{M. C. Markót}, J. Glob. Optim. 81, No. 3, 773--803 (2021; Zbl 1477.52026) Full Text: DOI OpenURL
Ponleitner, Bettina; Schichl, Hermann Exclusion regions for parameter-dependent systems of equations. (English) Zbl 1481.65076 J. Glob. Optim. 81, No. 3, 621-644 (2021). MSC: 65H10 65H20 65G30 PDF BibTeX XML Cite \textit{B. Ponleitner} and \textit{H. Schichl}, J. Glob. Optim. 81, No. 3, 621--644 (2021; Zbl 1481.65076) Full Text: DOI arXiv OpenURL
Xu, Chao; Li, Wenjun; Wang, Jianxin; Yang, Yongjie An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses. (English) Zbl 1481.90280 J. Comb. Optim. 42, No. 3, 524-542 (2021). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{C. Xu} et al., J. Comb. Optim. 42, No. 3, 524--542 (2021; Zbl 1481.90280) Full Text: DOI OpenURL
Glover, J.; Quan, V.; Zolfaghari, S. Some new perspectives for solving 0–1 integer programming problems using balas method. (English) Zbl 07432765 Comput. Manag. Sci. 18, No. 2, 177-193 (2021). MSC: 90Bxx PDF BibTeX XML Cite \textit{J. Glover} et al., Comput. Manag. Sci. 18, No. 2, 177--193 (2021; Zbl 07432765) Full Text: DOI OpenURL
Kolpakov, R. M. Optimal strategy for solving a special case of the knapsack problem by the branch and bound method. (English. Russian original) Zbl 1480.90213 Mosc. Univ. Math. Bull. 76, No. 3, 97-106 (2021); translation from Vestn. Mosk. Univ., Ser. I 76, No. 3, 13-22 (2021). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{R. M. Kolpakov}, Mosc. Univ. Math. Bull. 76, No. 3, 97--106 (2021; Zbl 1480.90213); translation from Vestn. Mosk. Univ., Ser. I 76, No. 3, 13--22 (2021) Full Text: DOI OpenURL