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
Bashir, Bashir; Karsu, Özlem Solution approaches for equitable multiobjective integer programming problems. (English) Zbl 07550784 Ann. Oper. Res. 311, No. 2, 967-995 (2022). MSC: 90C29 90C10 90C27 90B50 90-02 PDF BibTeX XML Cite \textit{B. Bashir} and \textit{Ö. Karsu}, Ann. Oper. Res. 311, No. 2, 967--995 (2022; Zbl 07550784) Full Text: DOI OpenURL
Straszak, Damian; Vishnoi, Nisheeth K. Iteratively reweighted least squares and slime mold dynamics: connection and convergence. (English) Zbl 07550215 Math. Program. 194, No. 1-2 (A), 685-717 (2022). MSC: 37M99 92F99 68W40 90C27 90C25 PDF BibTeX XML Cite \textit{D. Straszak} and \textit{N. K. Vishnoi}, Math. Program. 194, No. 1--2 (A), 685--717 (2022; Zbl 07550215) Full Text: DOI OpenURL
Lendl, Stefan; Peis, Britta; Timmermans, Veerle Matroid bases with cardinality constraints on the intersection. (English) Zbl 07550214 Math. Program. 194, No. 1-2 (A), 661-684 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{S. Lendl} et al., Math. Program. 194, No. 1--2 (A), 661--684 (2022; Zbl 07550214) Full Text: DOI OpenURL
Iwamasa, Yuni; Takazawa, Kenjiro Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications. (English) Zbl 07550203 Math. Program. 194, No. 1-2 (A), 229-256 (2022). MSC: 68Q25 90C27 PDF BibTeX XML Cite \textit{Y. Iwamasa} and \textit{K. Takazawa}, Math. Program. 194, No. 1--2 (A), 229--256 (2022; Zbl 07550203) Full Text: DOI OpenURL
Maehara, Takanori; Nakashima, So; Yamaguchi, Yutaro Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice – continuous greedy algorithm on median complex –. (English) Zbl 07550199 Math. Program. 194, No. 1-2 (A), 85-119 (2022). MSC: 90C27 68W25 06D99 PDF BibTeX XML Cite \textit{T. Maehara} et al., Math. Program. 194, No. 1--2 (A), 85--119 (2022; Zbl 07550199) Full Text: DOI OpenURL
Chen, Li-Hsuan; Hsieh, Sun-Yuan; Hung, Ling-Ju; Klasing, Ralf On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality. (English) Zbl 07549528 Algorithmica 84, No. 7, 1993-2027 (2022). MSC: 68R10 05C22 05C69 68Q17 68Q25 68W25 90B80 90C27 PDF BibTeX XML Cite \textit{L.-H. Chen} et al., Algorithmica 84, No. 7, 1993--2027 (2022; Zbl 07549528) Full Text: DOI OpenURL
Huang, Dawei; Pettie, Seth Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers. (English) Zbl 07549527 Algorithmica 84, No. 7, 1952-1992 (2022). MSC: 68W25 05C70 05C85 68R10 90C27 PDF BibTeX XML Cite \textit{D. Huang} and \textit{S. Pettie}, Algorithmica 84, No. 7, 1952--1992 (2022; Zbl 07549527) Full Text: DOI OpenURL
Zohali, Hassan; Naderi, Bahman; Roshanaei, Vahid Solving the type-2 assembly line balancing with setups using logic-based Benders decomposition. (English) Zbl 07549380 INFORMS J. Comput. 34, No. 1, 315-332 (2022). MSC: 90-XX PDF BibTeX XML Cite \textit{H. Zohali} et al., INFORMS J. Comput. 34, No. 1, 315--332 (2022; Zbl 07549380) Full Text: DOI OpenURL
Erementchouk, Mikhail; Shukla, Aditya; Mazumder, Pinaki On computational capabilities of Ising machines based on nonlinear oscillators. (English) Zbl 07548982 Physica D 437, Article ID 133334, 7 p. (2022). MSC: 68Q09 82C20 90C27 90C59 PDF BibTeX XML Cite \textit{M. Erementchouk} et al., Physica D 437, Article ID 133334, 7 p. (2022; Zbl 07548982) Full Text: DOI OpenURL
Frieze, Alan M.; Tkocz, Tomasz A randomly weighted minimum arborescence with a random cost constraint. (English) Zbl 07548082 Math. Oper. Res. 47, No. 2, 1664-1680 (2022). MSC: 05C80 90C27 PDF BibTeX XML Cite \textit{A. M. Frieze} and \textit{T. Tkocz}, Math. Oper. Res. 47, No. 2, 1664--1680 (2022; Zbl 07548082) Full Text: DOI OpenURL
Ghuge, Rohan; Nagarajan, Viswanath Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems. (English) Zbl 07548079 Math. Oper. Res. 47, No. 2, 1612-1630 (2022). MSC: 68W25 68R10 90C27 PDF BibTeX XML Cite \textit{R. Ghuge} and \textit{V. Nagarajan}, Math. Oper. Res. 47, No. 2, 1612--1630 (2022; Zbl 07548079) Full Text: DOI OpenURL
Shioura, Akiyoshi \(M\)-convex function minimization under \(\mathrm{L}1\)-distance constraint and its application to dock reallocation in bike-sharing system. (English) Zbl 07548078 Math. Oper. Res. 47, No. 2, 1566-1611 (2022). MSC: 90C27 68Q25 PDF BibTeX XML Cite \textit{A. Shioura}, Math. Oper. Res. 47, No. 2, 1566--1611 (2022; Zbl 07548078) Full Text: DOI OpenURL
Harshaw, Christopher; Kazemi, Ehsan; Feldman, Moran; Karbasi, Amin The power of subsampling in submodular maximization. (English) Zbl 07548071 Math. Oper. Res. 47, No. 2, 1365-1393 (2022). MSC: 68W20 68W25 68W27 90C27 PDF BibTeX XML Cite \textit{C. Harshaw} et al., Math. Oper. Res. 47, No. 2, 1365--1393 (2022; Zbl 07548071) Full Text: DOI OpenURL
Frank, András; Murota, Kazuo A discrete convex min-max formula for box-TDI polyhedra. (English) Zbl 07548058 Math. Oper. Res. 47, No. 2, 1026-1047 (2022). MSC: 90C27 90C25 90C10 PDF BibTeX XML Cite \textit{A. Frank} and \textit{K. Murota}, Math. Oper. Res. 47, No. 2, 1026--1047 (2022; Zbl 07548058) Full Text: DOI OpenURL
Ezra, Tomer; Feldman, Michal; Gravin, Nick; Tang, Zhihao Gavin Prophet matching with general arrivals. (English) Zbl 07548051 Math. Oper. Res. 47, No. 2, 878-898 (2022). MSC: 68W27 05C70 60G40 68R10 90C27 PDF BibTeX XML Cite \textit{T. Ezra} et al., Math. Oper. Res. 47, No. 2, 878--898 (2022; Zbl 07548051) Full Text: DOI OpenURL
Nikolov, Aleksandar; Singh, Mohit; Tantipongpipat, Uthaipon (Tao) Proportional volume sampling and approximation algorithms for \(A\)-optimal design. (English) Zbl 07548050 Math. Oper. Res. 47, No. 2, 847-877 (2022). MSC: 90C27 62J05 62K05 62K15 68W20 68W25 PDF BibTeX XML Cite \textit{A. Nikolov} et al., Math. Oper. Res. 47, No. 2, 847--877 (2022; Zbl 07548050) Full Text: DOI OpenURL
Meng, Fanchao; Cao, Bo; Chu, Dianhui; Ji, Qingran; Zhou, Xuequan Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem. (English) Zbl 07546533 Comput. Oper. Res. 143, Article ID 105803, 12 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{F. Meng} et al., Comput. Oper. Res. 143, Article ID 105803, 12 p. (2022; Zbl 07546533) Full Text: DOI OpenURL
Zheng, Jiongzhi; Hong, Yawei; Xu, Wenchang; Li, Wentao; Chen, Yongfu An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem. (English) Zbl 07546523 Comput. Oper. Res. 143, Article ID 105772, 12 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{J. Zheng} et al., Comput. Oper. Res. 143, Article ID 105772, 12 p. (2022; Zbl 07546523) Full Text: DOI OpenURL
Sun, Yuan; Wang, Sheng; Shen, Yunzhuang; Li, Xiaodong; Ernst, Andreas T.; Kirley, Michael Boosting ant colony optimization via solution prediction and machine learning. (English) Zbl 07546521 Comput. Oper. Res. 143, Article ID 105769, 16 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{Y. Sun} et al., Comput. Oper. Res. 143, Article ID 105769, 16 p. (2022; Zbl 07546521) Full Text: DOI OpenURL
Cacchiani, Valentina; Iori, Manuel; Locatelli, Alberto; Martello, Silvano Knapsack problems – an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems. (English) Zbl 07546506 Comput. Oper. Res. 143, Article ID 105693, 14 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{V. Cacchiani} et al., Comput. Oper. Res. 143, Article ID 105693, 14 p. (2022; Zbl 07546506) Full Text: DOI OpenURL
Cacchiani, Valentina; Iori, Manuel; Locatelli, Alberto; Martello, Silvano Knapsack problems – an overview of recent advances. I: Single knapsack problems. (English) Zbl 07546505 Comput. Oper. Res. 143, Article ID 105692, 13 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{V. Cacchiani} et al., Comput. Oper. Res. 143, Article ID 105692, 13 p. (2022; Zbl 07546505) Full Text: DOI OpenURL
Abreu, Levi R.; Prata, Bruno A.; Framinan, Jose M.; Nagano, Marcelo S. New efficient heuristics for scheduling open shops with makespan minimization. (English) Zbl 07546501 Comput. Oper. Res. 142, Article ID 105744, 21 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{L. R. Abreu} et al., Comput. Oper. Res. 142, Article ID 105744, 21 p. (2022; Zbl 07546501) Full Text: DOI OpenURL
Pascoal, Marta; Craveirinha, José; Clímaco, João An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks. (English) Zbl 07542724 Top 30, No. 2, 405-425 (2022). MSC: 90C27 90C35 90C29 PDF BibTeX XML Cite \textit{M. Pascoal} et al., Top 30, No. 2, 405--425 (2022; Zbl 07542724) Full Text: DOI OpenURL
Popa, Alexandru Models and algorithms for social distancing in order to stop the spread of COVID-19. (English) Zbl 07541747 Acta Cybern. 25, No. 3, 733-749 (2022). MSC: 68Q07 68Q25 PDF BibTeX XML Cite \textit{A. Popa}, Acta Cybern. 25, No. 3, 733--749 (2022; Zbl 07541747) Full Text: DOI OpenURL
Roostapour, Vahid; Neumann, Aneta; Neumann, Frank Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. (English) Zbl 07540259 Theor. Comput. Sci. 924, 129-147 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{V. Roostapour} et al., Theor. Comput. Sci. 924, 129--147 (2022; Zbl 07540259) Full Text: DOI OpenURL
Yeh, Hao-Ping; Lu, Wei; Chen, Li-Hsuan; Hung, Ling-Ju; Klasing, Ralf; Hsieh, Sun-Yuan Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs. (English) Zbl 07540191 Theor. Comput. Sci. 922, 13-24 (2022). MSC: 68R10 05C12 68Q17 68Q25 68W25 90B80 90C27 PDF BibTeX XML Cite \textit{H.-P. Yeh} et al., Theor. Comput. Sci. 922, 13--24 (2022; Zbl 07540191) Full Text: DOI OpenURL
Nguyen, Kien Trung; Nhan, Tran Hoai Ngoc; Teh, Wen Chean; Hung, Nguyen Thanh The connected \(p\)-median problem on complete multi-layered graphs. (English) Zbl 07539619 Discrete Math. Algorithms Appl. 14, No. 3, Article ID 2150118, 13 p. (2022). MSC: 90B80 90B10 90C27 PDF BibTeX XML Cite \textit{K. T. Nguyen} et al., Discrete Math. Algorithms Appl. 14, No. 3, Article ID 2150118, 13 p. (2022; Zbl 07539619) Full Text: DOI OpenURL
Ferrarini, Luca; Gualandi, Stefano Total coloring and total matching: polyhedra and facets. (English) Zbl 07539485 Eur. J. Oper. Res. 303, No. 1, 129-142 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{L. Ferrarini} and \textit{S. Gualandi}, Eur. J. Oper. Res. 303, No. 1, 129--142 (2022; Zbl 07539485) Full Text: DOI OpenURL
Silva, Allyson; Coelho, Leandro C.; Darvish, Maryam; Renaud, Jacques A cutting plane method and a parallel algorithm for packing rectangles in a circular container. (English) Zbl 07539484 Eur. J. Oper. Res. 303, No. 1, 114-128 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{A. Silva} et al., Eur. J. Oper. Res. 303, No. 1, 114--128 (2022; Zbl 07539484) Full Text: DOI OpenURL
Crainic, Teodor Gabriel; Gendron, Bernard; Akhavan Kazemzadeh, Mohammad Rahim A taxonomy of multilayer network design and a survey of transportation and telecommunication applications. (English) Zbl 07539477 Eur. J. Oper. Res. 303, No. 1, 1-13 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{T. G. Crainic} et al., Eur. J. Oper. Res. 303, No. 1, 1--13 (2022; Zbl 07539477) Full Text: DOI OpenURL
Ageron, Romain Trigonometric approximation of the Max-Cut polytope is star-like. (English) Zbl 07539468 Optim. Lett. 16, No. 6, 1963-1967 (2022). MSC: 90C20 90C27 PDF BibTeX XML Cite \textit{R. Ageron}, Optim. Lett. 16, No. 6, 1963--1967 (2022; Zbl 07539468) 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
Koutecký, Martin; Levin, Asaf; Meesum, Syed M.; Onn, Shmuel Approximate separable multichoice optimization over monotone systems. (English) Zbl 07538836 Discrete Optim. 44, Article ID 100629, 15 p. (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{M. Koutecký} et al., Discrete Optim. 44, Article ID 100629, 15 p. (2022; Zbl 07538836) Full Text: DOI OpenURL
Gu, Xunhao; Zhao, Songzheng; Wang, Yang Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem. (English) Zbl 07538835 Discrete Optim. 44, Article ID 100625, 16 p. (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{X. Gu} et al., Discrete Optim. 44, Article ID 100625, 16 p. (2022; Zbl 07538835) 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
Chan, Timothy F.; Cooper, Jacob W.; Koutecký, Martin; Král, Daniel; Pekárková, Kristýna Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming. (English) Zbl 07538274 SIAM J. Comput. 51, No. 3, 664-700 (2022). MSC: 90C10 90C27 05B35 PDF BibTeX XML Cite \textit{T. F. Chan} et al., SIAM J. Comput. 51, No. 3, 664--700 (2022; Zbl 07538274) 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
Hawa, Asyl L.; Lewis, Rhyd; Thompson, Jonathan M. Exact and approximate methods for the score-constrained packing problem. (English) Zbl 07538169 Eur. J. Oper. Res. 302, No. 3, 847-859 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{A. L. Hawa} et al., Eur. J. Oper. Res. 302, No. 3, 847--859 (2022; Zbl 07538169) Full Text: DOI OpenURL
Mancini, Simona; Triki, Chefi; Piya, Sujan Optimal selection of touristic packages based on user preferences during sports mega-events. (English) Zbl 07538167 Eur. J. Oper. Res. 302, No. 3, 819-830 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{S. Mancini} et al., Eur. J. Oper. Res. 302, No. 3, 819--830 (2022; Zbl 07538167) Full Text: DOI OpenURL
Nolz, Pamela C.; Absi, Nabil; Feillet, Dominique; Seragiotto, Clóvis The consistent electric-vehicle routing problem with backhauls and charging management. (English) Zbl 07538158 Eur. J. Oper. Res. 302, No. 2, 700-716 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{P. C. Nolz} et al., Eur. J. Oper. Res. 302, No. 2, 700--716 (2022; Zbl 07538158) Full Text: DOI OpenURL
Böhm, Martin; Hoeksma, Ruben; Megow, Nicole; Nölke, Lukas; Simon, Bertrand On hop-constrained Steiner trees in tree-like metrics. (English) Zbl 07537556 SIAM J. Discrete Math. 36, No. 2, 1249-1273 (2022). MSC: 68Q25 90C27 05C12 PDF BibTeX XML Cite \textit{M. Böhm} et al., SIAM J. Discrete Math. 36, No. 2, 1249--1273 (2022; Zbl 07537556) Full Text: DOI OpenURL
Cherabli, Meriem; Ourbih-Tari, Megdouda; Boubalou, Meriem Refined descriptive sampling simulated annealing algorithm for solving the traveling salesman problem. (English) Zbl 07537031 Monte Carlo Methods Appl. 28, No. 2, 175-188 (2022). MSC: 65C05 00A72 11K45 62D05 90C27 90C59 PDF BibTeX XML Cite \textit{M. Cherabli} et al., Monte Carlo Methods Appl. 28, No. 2, 175--188 (2022; Zbl 07537031) Full Text: DOI OpenURL
Lifshits, M. A.; Tadevosian, A. A. On the maximum of random assignment process. (English) Zbl 07535892 Stat. Probab. Lett. 187, Article ID 109530, 6 p. (2022). MSC: 60C05 90B80 90C27 PDF BibTeX XML Cite \textit{M. A. Lifshits} and \textit{A. A. Tadevosian}, Stat. Probab. Lett. 187, Article ID 109530, 6 p. (2022; Zbl 07535892) Full Text: DOI OpenURL
Gao, Yuan; Yuan, Jinjiang; Ng, C. T.; Cheng, T. C. E. Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost. (English) Zbl 07535482 4OR 20, No. 2, 273-287 (2022). MSC: 90B35 90C27 PDF BibTeX XML Cite \textit{Y. Gao} et al., 4OR 20, No. 2, 273--287 (2022; Zbl 07535482) Full Text: DOI OpenURL
Fried, Sela On the coefficients of the distinct monomials in the expansion of \(x_1(x_1+x_2) \cdots (x_1+x_2+ \cdots+x_n)\). (English) Zbl 07534345 J. Integer Seq. 25, No. 4, Article 22.4.2, 16 p. (2022). MSC: 11P81 05A17 90C27 PDF BibTeX XML Cite \textit{S. Fried}, J. Integer Seq. 25, No. 4, Article 22.4.2, 16 p. (2022; Zbl 07534345) Full Text: Link OpenURL
Schwartz, Stephan An overview of graph covering and partitioning. (English) Zbl 07533000 Discrete Math. 345, No. 8, Article ID 112884, 17 p. (2022). MSC: 05C70 90C27 PDF BibTeX XML Cite \textit{S. Schwartz}, Discrete Math. 345, No. 8, Article ID 112884, 17 p. (2022; Zbl 07533000) Full Text: DOI OpenURL
de Araújo, Kennedy Anderson Gumarães; Guedes, Jedson Bernadino; Prata, Bruno de Athayde Hybrid matheuristics for the multi-capacitated clustering problem. (English) Zbl 07531874 RAIRO, Oper. Res. 56, No. 3, 1167-1185 (2022). MSC: 90C11 90C27 90C59 PDF BibTeX XML Cite \textit{K. A. G. de Araújo} et al., RAIRO, Oper. Res. 56, No. 3, 1167--1185 (2022; Zbl 07531874) Full Text: DOI OpenURL
Goerigk, Marc; Lendl, Stefan; Wulf, Lasse Two-stage robust optimization problems with two-stage uncertainty. (English) Zbl 07530089 Eur. J. Oper. Res. 302, No. 1, 62-78 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{M. Goerigk} et al., Eur. J. Oper. Res. 302, No. 1, 62--78 (2022; Zbl 07530089) Full Text: DOI OpenURL
Jooken, Jorik; Leyman, Pieter; De Causmaecker, Patrick A new class of hard problem instances for the 0–1 knapsack problem. (English) Zbl 07530062 Eur. J. Oper. Res. 301, No. 3, 841-854 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{J. Jooken} et al., Eur. J. Oper. Res. 301, No. 3, 841--854 (2022; Zbl 07530062) Full Text: DOI OpenURL
Bidar, Mahdi; Mouhoub, Malek Nature-inspired techniques for dynamic constraint satisfaction problems. (English) Zbl 07528438 SN Oper. Res. Forum 3, No. 2, Paper No. 28, 33 p. (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{M. Bidar} and \textit{M. Mouhoub}, SN Oper. Res. Forum 3, No. 2, Paper No. 28, 33 p. (2022; Zbl 07528438) Full Text: DOI OpenURL
Kilic, Kemal Ihsan; Mostarda, Leonardo Novel concave hull-based heuristic algorithm For TSP. (English) Zbl 07528435 SN Oper. Res. Forum 3, No. 2, Paper No. 25, 45 p. (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{K. I. Kilic} and \textit{L. Mostarda}, SN Oper. Res. Forum 3, No. 2, Paper No. 25, 45 p. (2022; Zbl 07528435) Full Text: DOI OpenURL
Aprile, Manuel; Fiorini, Samuel Regular matroids have polynomial extension complexity. (English) Zbl 07528000 Math. Oper. Res. 47, No. 1, 540-559 (2022). MSC: 90C27 52B40 PDF BibTeX XML Cite \textit{M. Aprile} and \textit{S. Fiorini}, Math. Oper. Res. 47, No. 1, 540--559 (2022; Zbl 07528000) 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
Li, Jianping; Pan, Pengxiang; Cai, Lijian; Lichen, Junran; Wang, Wencheng Bin packing with divisible item sizes and rejection penalties. (English) Zbl 07526502 Optim. Lett. 16, No. 5, 1587-1597 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{J. Li} et al., Optim. Lett. 16, No. 5, 1587--1597 (2022; Zbl 07526502) Full Text: DOI OpenURL
Alfaro, Carlos A.; Perez, Sergio L.; Valencia, Carlos E.; Vargas, Marcos C. The assignment problem revisited. (English) Zbl 07526499 Optim. Lett. 16, No. 5, 1531-1548 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{C. A. Alfaro} et al., Optim. Lett. 16, No. 5, 1531--1548 (2022; Zbl 07526499) Full Text: DOI OpenURL
Onn, Shmuel Matching orderable and separable hypergraphs. (English) Zbl 07526490 Optim. Lett. 16, No. 5, 1393-1401 (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{S. Onn}, Optim. Lett. 16, No. 5, 1393--1401 (2022; Zbl 07526490) Full Text: DOI OpenURL
Jia, Xiao-Dan; Hou, Bo; Liu, Wen An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties. (English) Zbl 07524845 J. Oper. Res. Soc. China 10, No. 1, 183-192 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{X.-D. Jia} et al., J. Oper. Res. Soc. China 10, No. 1, 183--192 (2022; Zbl 07524845) Full Text: DOI OpenURL
Wang, Feng-Min; Wang, Jia-Jia; Li, Na; Jiang, Yan-Jun; Li, Shi-Cheng A cost-sharing scheme for the \(k\)-level facility location game with penalties. (English) Zbl 07524844 J. Oper. Res. Soc. China 10, No. 1, 173-182 (2022). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{F.-M. Wang} et al., J. Oper. Res. Soc. China 10, No. 1, 173--182 (2022; Zbl 07524844) Full Text: DOI OpenURL
Baïou, Mourad; Colares, Rafael; Kerivin, Hervé The complexity of the unit stop number problem and its implications to other related problems. (English) Zbl 07524438 Theor. Comput. Sci. 919, 36-46 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{M. Baïou} et al., Theor. Comput. Sci. 919, 36--46 (2022; Zbl 07524438) Full Text: DOI OpenURL
Murota, Kazuo; Tamura, Akihisa Discrete Fenchel duality for a pair of integrally convex and separable convex functions. (English) Zbl 07523440 Japan J. Ind. Appl. Math. 39, No. 2, 599-630 (2022). MSC: 26B25 90C27 90C25 PDF BibTeX XML Cite \textit{K. Murota} and \textit{A. Tamura}, Japan J. Ind. Appl. Math. 39, No. 2, 599--630 (2022; Zbl 07523440) Full Text: DOI OpenURL
Li, Wenxin; Lee, Joohyun; Shroff, Ness A faster FPTAS for knapsack problem with cardinality constraint. (English) Zbl 07516297 Discrete Appl. Math. 315, 71-85 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{W. Li} et al., Discrete Appl. Math. 315, 71--85 (2022; Zbl 07516297) Full Text: DOI OpenURL
Laurent, Monique; Vargas, Luis Felipe Finite convergence of sum-of-squares hierarchies for the stability number of a graph. (English) Zbl 07516285 SIAM J. Optim. 32, No. 2, 491-518 (2022). MSC: 05C99 90C20 90C22 90C26 90C27 11E25 PDF BibTeX XML Cite \textit{M. Laurent} and \textit{L. F. Vargas}, SIAM J. Optim. 32, No. 2, 491--518 (2022; Zbl 07516285) Full Text: DOI OpenURL
Donets, G. P.; Biletskyi, V. I. Optimal search for locally feasible solutions of a linear function on permutations. (English. Ukrainian original) Zbl 07514992 Cybern. Syst. Anal. 58, No. 1, 29-35 (2022); translation from Kibern. Sist. Anal. 58, No. 1, 37-44 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{G. P. Donets} and \textit{V. I. Biletskyi}, Cybern. Syst. Anal. 58, No. 1, 29--35 (2022; Zbl 07514992); translation from Kibern. Sist. Anal. 58, No. 1, 37--44 (2022) Full Text: DOI OpenURL
Pérez Cáceres, Leslie (ed.); Verel, Sébastien (ed.) Evolutionary computation in combinatorial optimization. 22nd European conference, EvoCOP 2022, held as part of EvoStar 2022, Madrid, Spain, April 20–22, 2022. Proceedings. (English) Zbl 07514202 Lecture Notes in Computer Science 13222. Cham: Springer (ISBN 978-3-031-04147-1/pbk; 978-3-031-04148-8/ebook). xiv, 209 p. (2022). MSC: 68-06 68T20 90C27 90C59 00B25 PDF BibTeX XML Cite \textit{L. Pérez Cáceres} (ed.) and \textit{S. Verel} (ed.), Evolutionary computation in combinatorial optimization. 22nd European conference, EvoCOP 2022, held as part of EvoStar 2022, Madrid, Spain, April 20--22, 2022. Proceedings. Cham: Springer (2022; Zbl 07514202) Full Text: DOI OpenURL
Cafieri, Sonia; Hansen, Pierre; Messine, Frédéric Global exact optimization for covering a rectangle with 6 circles. (English) Zbl 07513943 J. Glob. Optim. 83, No. 1, 163-185 (2022). MSC: 90C26 90C27 90C11 PDF BibTeX XML Cite \textit{S. Cafieri} et al., J. Glob. Optim. 83, No. 1, 163--185 (2022; Zbl 07513943) Full Text: DOI OpenURL
Liberti, Leo; Manca, Benedetto Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections. (English) Zbl 07513940 J. Glob. Optim. 83, No. 1, 83-118 (2022). MSC: 90C27 90C11 PDF BibTeX XML Cite \textit{L. Liberti} and \textit{B. Manca}, J. Glob. Optim. 83, No. 1, 83--118 (2022; Zbl 07513940) Full Text: DOI OpenURL
González, Begoña; Rossit, Daniel A.; Méndez, Máximo; Frutos, Mariano Objective space division-based hybrid evolutionary algorithm for handing overlapping solutions in combinatorial problems. (English) Zbl 07513310 Math. Biosci. Eng. 19, No. 4, 3369-3401 (2022). MSC: 91B06 90C27 90C29 PDF BibTeX XML Cite \textit{B. González} et al., Math. Biosci. Eng. 19, No. 4, 3369--3401 (2022; Zbl 07513310) Full Text: DOI OpenURL
Yang, Yichen; Liu, Zhaohui; Yu, Wei Approximation algorithms for the \(k\)-depots Hamiltonian path problem. (English) Zbl 07511909 Optim. Lett. 16, No. 4, 1215-1234 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{Y. Yang} et al., Optim. Lett. 16, No. 4, 1215--1234 (2022; Zbl 07511909) Full Text: DOI OpenURL
Nasernejad, Mehrdad; Khashyarmanesh, Kazem; Roberts, Leslie G.; Toledo, Jonathan The strong persistence property and symbolic strong persistence property. (English) Zbl 07511563 Czech. Math. J. 72, No. 1, 209-237 (2022). MSC: 13C13 13B25 13A30 13P25 05C25 05E40 PDF BibTeX XML Cite \textit{M. Nasernejad} et al., Czech. Math. J. 72, No. 1, 209--237 (2022; Zbl 07511563) Full Text: DOI OpenURL
Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michal A subexponential parameterized algorithm for directed subset traveling salesman problem on planar graphs. (English) Zbl 07510285 SIAM J. Comput. 51, No. 2, 254-289 (2022). MSC: 05C85 05C10 68R10 90C35 90C27 PDF BibTeX XML Cite \textit{D. Marx} et al., SIAM J. Comput. 51, No. 2, 254--289 (2022; Zbl 07510285) Full Text: DOI OpenURL
Hadfield, Charles; Bravyi, Sergey; Raymond, Rudy; Mezzacapo, Antonio Measurements of quantum Hamiltonians with locally-biased classical shadows. (English) Zbl 07509379 Commun. Math. Phys. 391, No. 3, 951-967 (2022). MSC: 82C22 90C25 90C27 81P68 PDF BibTeX XML Cite \textit{C. Hadfield} et al., Commun. Math. Phys. 391, No. 3, 951--967 (2022; Zbl 07509379) Full Text: DOI OpenURL
Ceselli, Alberto; Létocart, Lucas; Traversi, Emiliano Dantzig-Wolfe reformulations for binary quadratic problems. (English) Zbl 1484.90048 Math. Program. Comput. 14, No. 1, 85-120 (2022). MSC: 90C11 90C20 90C27 PDF BibTeX XML Cite \textit{A. Ceselli} et al., Math. Program. Comput. 14, No. 1, 85--120 (2022; Zbl 1484.90048) Full Text: DOI OpenURL
Ramos, Guilherme; Aguiar, A. Pedro; Pequito, Sérgio An overview of structural systems theory. (English) Zbl 1485.93021 Automatica 140, Article ID 110229, 26 p. (2022). MSC: 93A05 93B05 93A14 90C25 93-02 PDF BibTeX XML Cite \textit{G. Ramos} et al., Automatica 140, Article ID 110229, 26 p. (2022; Zbl 1485.93021) Full Text: DOI OpenURL
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf Lower bounds for batched bin packing. (English) Zbl 07507014 J. Comb. Optim. 43, No. 3, 613-629 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{J. Balogh} et al., J. Comb. Optim. 43, No. 3, 613--629 (2022; Zbl 07507014) Full Text: DOI OpenURL
Weerasena, Lakmali Advancing local search approximations for multiobjective combinatorial optimization problems. (English) Zbl 07507013 J. Comb. Optim. 43, No. 3, 589-612 (2022). MSC: 90C27 90C29 90C59 PDF BibTeX XML Cite \textit{L. Weerasena}, J. Comb. Optim. 43, No. 3, 589--612 (2022; Zbl 07507013) Full Text: DOI OpenURL
Chen, Yong; Cai, Yinhui; Liu, Longcheng; Chen, Guangting; Goebel, Randy; Lin, Guohui; Su, Bing; Zhang, An Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. (English) Zbl 07507012 J. Comb. Optim. 43, No. 3, 571-588 (2022). MSC: 90C27 90B35 PDF BibTeX XML Cite \textit{Y. Chen} et al., J. Comb. Optim. 43, No. 3, 571--588 (2022; Zbl 07507012) Full Text: DOI OpenURL
Goerigk, Marc; Kasperski, Adam; Zieliński, Paweł Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty. (English) Zbl 07507009 J. Comb. Optim. 43, No. 3, 497-527 (2022). MSC: 90C17 90C27 PDF BibTeX XML Cite \textit{M. Goerigk} et al., J. Comb. Optim. 43, No. 3, 497--527 (2022; Zbl 07507009) Full Text: DOI OpenURL
Ravelo, Santiago Valdés Approximation algorithms for simple assembly line balancing problems. (English) Zbl 07507006 J. Comb. Optim. 43, No. 2, 432-443 (2022). MSC: 90C27 90C90 PDF BibTeX XML Cite \textit{S. V. Ravelo}, J. Comb. Optim. 43, No. 2, 432--443 (2022; Zbl 07507006) Full Text: DOI OpenURL
Gurski, Frank; Komander, Dominique; Rehs, Carolin; Rethmann, Jochen; Wanke, Egon Computing directed Steiner path covers. (English) Zbl 07507005 J. Comb. Optim. 43, No. 2, 402-431 (2022). MSC: 90C27 90C09 PDF BibTeX XML Cite \textit{F. Gurski} et al., J. Comb. Optim. 43, No. 2, 402--431 (2022; Zbl 07507005) Full Text: DOI OpenURL
Zhang, Zhen-Kun; Zhao, Zhong; Pang, Liu-Yong Decomposability of a class of \(k\)-cutwidth critical graphs. (English) Zbl 07507004 J. Comb. Optim. 43, No. 2, 384-401 (2022). MSC: 90C27 05C75 05C78 PDF BibTeX XML Cite \textit{Z.-K. Zhang} et al., J. Comb. Optim. 43, No. 2, 384--401 (2022; Zbl 07507004) Full Text: DOI OpenURL
Das, Sayani; Mishra, Sounaka On the complexity of minimum \(q\)-domination partization problems. (English) Zbl 07507003 J. Comb. Optim. 43, No. 2, 363-383 (2022). MSC: 90C27 05C15 PDF BibTeX XML Cite \textit{S. Das} and \textit{S. Mishra}, J. Comb. Optim. 43, No. 2, 363--383 (2022; Zbl 07507003) Full Text: DOI OpenURL
Yuan, Yuan; Lan, Yan; Ding, Ning; Han, Xin A PTAS for non-resumable open shop scheduling with an availability constraint. (English) Zbl 07507002 J. Comb. Optim. 43, No. 2, 350-362 (2022). MSC: 90C27 90B35 PDF BibTeX XML Cite \textit{Y. Yuan} et al., J. Comb. Optim. 43, No. 2, 350--362 (2022; Zbl 07507002) Full Text: DOI OpenURL
Wiegele, Angelika; Zhao, Shudian SDP-based bounds for graph partition via extended ADMM. (English) Zbl 07506813 Comput. Optim. Appl. 82, No. 1, 251-291 (2022). MSC: 90C27 90C22 PDF BibTeX XML Cite \textit{A. Wiegele} and \textit{S. Zhao}, Comput. Optim. Appl. 82, No. 1, 251--291 (2022; Zbl 07506813) Full Text: DOI OpenURL
Liu, Xiaoyuan; Ushijima-Mwesigwa, Hayato; Mandal, Avradip; Upadhyay, Sarvagya; Safro, Ilya; Roy, Arnab Leveraging special-purpose hardware for local search heuristics. (English) Zbl 07506804 Comput. Optim. Appl. 82, No. 1, 1-29 (2022). MSC: 68R05 90C27 90C59 90Cxx PDF BibTeX XML Cite \textit{X. Liu} et al., Comput. Optim. Appl. 82, No. 1, 1--29 (2022; Zbl 07506804) Full Text: DOI 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
Goebbels, Steffen; Gurski, Frank; Komander, Dominique The knapsack problem with special neighbor constraints. (English) Zbl 07505270 Math. Methods Oper. Res. 95, No. 1, 1-34 (2022). MSC: 90C27 05C69 05C20 05C05 PDF BibTeX XML Cite \textit{S. Goebbels} et al., Math. Methods Oper. Res. 95, No. 1, 1--34 (2022; Zbl 07505270) 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
Campello, B. S. C.; Ghidini, C. T. L. S.; Ayres, A. O. C.; Oliveira, W. A. A residual recombination heuristic for one-dimensional cutting stock problems. (English) Zbl 07502761 Top 30, No. 1, 194-220 (2022). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{B. S. C. Campello} et al., Top 30, No. 1, 194--220 (2022; Zbl 07502761) Full Text: DOI OpenURL
Ghirardi, Marco; Salassa, Fabio A simple and effective algorithm for the maximum happy vertices problem. (English) Zbl 07502760 Top 30, No. 1, 181-193 (2022). MSC: 90C27 90C11 90C59 PDF BibTeX XML Cite \textit{M. Ghirardi} and \textit{F. Salassa}, Top 30, No. 1, 181--193 (2022; Zbl 07502760) Full Text: DOI OpenURL
Fröhlich, Nicolas; Ruzika, Stefan Interdicting facilities in tree networks. (English) Zbl 07502757 Top 30, No. 1, 95-118 (2022). MSC: 90C27 90B80 90C39 05C05 PDF BibTeX XML Cite \textit{N. Fröhlich} and \textit{S. Ruzika}, Top 30, No. 1, 95--118 (2022; Zbl 07502757) Full Text: DOI OpenURL
Rodríguez-Pereira, Jessica; Laporte, Gilbert The target visitation arc routing problem. (English) Zbl 07502755 Top 30, No. 1, 60-76 (2022). MSC: 90B06 90C27 PDF BibTeX XML Cite \textit{J. Rodríguez-Pereira} and \textit{G. Laporte}, Top 30, No. 1, 60--76 (2022; Zbl 07502755) Full Text: DOI OpenURL
Abboud, Amir; Bringmann, Karl; Hermelin, Danny; Shabtay, Dvir Scheduling lower bounds via AND subset sum. (English) Zbl 1483.68142 J. Comput. Syst. Sci. 127, 29-40 (2022). MSC: 68Q17 90B35 90C27 PDF BibTeX XML Cite \textit{A. Abboud} et al., J. Comput. Syst. Sci. 127, 29--40 (2022; Zbl 1483.68142) Full Text: DOI OpenURL
Takazawa, Kenjiro Excluded \(t\)-factors in bipartite graphs: unified framework for nonbipartite matchings, restricted 2-matchings, and matroids. (English) Zbl 07501964 SIAM J. Discrete Math. 36, No. 1, 702-727 (2022). MSC: 05C70 05B35 05C85 68R10 90C27 90C35 PDF BibTeX XML Cite \textit{K. Takazawa}, SIAM J. Discrete Math. 36, No. 1, 702--727 (2022; Zbl 07501964) Full Text: DOI OpenURL
Christofides, Nicos Worst-case analysis of a new heuristic for the travelling salesman problem. (English) Zbl 07500864 SN Oper. Res. Forum 3, No. 1, Paper No. 20, 4 p. (2022). MSC: 90C27 90C59 90C60 PDF BibTeX XML Cite \textit{N. Christofides}, SN Oper. Res. Forum 3, No. 1, Paper No. 20, 4 p. (2022; Zbl 07500864) Full Text: DOI OpenURL
Berger, Mathias; Radu, David; Dubois, Antoine; Pandžić, Hrvoje; Dvorkin, Yury; Louveaux, Quentin; Ernst, Damien Siting renewable power generation assets with combinatorial optimisation. (English) Zbl 07500339 Optim. Lett. 16, No. 3, 877-907 (2022). MSC: 90C27 90C90 PDF BibTeX XML Cite \textit{M. Berger} et al., Optim. Lett. 16, No. 3, 877--907 (2022; Zbl 07500339) Full Text: DOI OpenURL
Bampis, Evripidis; Escoffier, Bruno; Teiller, Alexandre Multistage knapsack. (English) Zbl 07499482 J. Comput. Syst. Sci. 126, 106-118 (2022). MSC: 90C27 68W25 90C59 PDF BibTeX XML Cite \textit{E. Bampis} et al., J. Comput. Syst. Sci. 126, 106--118 (2022; Zbl 07499482) Full Text: DOI OpenURL
Friggstad, Zachary; Swamy, Chaitanya A constant-factor approximation for directed latency in quasi-polynomial time. (English) Zbl 07499479 J. Comput. Syst. Sci. 126, 44-58 (2022). MSC: 90C27 68W25 90C59 PDF BibTeX XML Cite \textit{Z. Friggstad} and \textit{C. Swamy}, J. Comput. Syst. Sci. 126, 44--58 (2022; Zbl 07499479) Full Text: DOI OpenURL
Ghiyasvand, Mehdi; Keshtkar, Iman Solving the absolute 1-center problem in the quickest path case. (English) Zbl 1484.90093 Bull. Iran. Math. Soc. 48, No. 2, 643-671 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{M. Ghiyasvand} and \textit{I. Keshtkar}, Bull. Iran. Math. Soc. 48, No. 2, 643--671 (2022; Zbl 1484.90093) Full Text: DOI OpenURL