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
Hirai, Hiroshi; Sato, Ryosuke Polyhedral clinching auctions for two-sided markets. (English) Zbl 07527988 Math. Oper. Res. 47, No. 1, 259-285 (2022). MSC: 91A68 91B26 90C27 PDF BibTeX XML Cite \textit{H. Hirai} and \textit{R. Sato}, Math. Oper. Res. 47, No. 1, 259--285 (2022; Zbl 07527988) 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
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
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
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: 92-XX 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
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: 05C10 05C85 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 07507322 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 07507322) Full Text: DOI OpenURL
Ramos, Guilherme; Aguiar, A. Pedro; Pequito, Sérgio An overview of structural systems theory. (English) Zbl 07507291 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 07507291) 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: 90Cxx PDF BibTeX XML Cite \textit{L. Weerasena}, J. Comb. Optim. 43, No. 3, 589--612 (2022; Zbl 07507013) 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: 90Cxx 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: 90Cxx 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: 90Cxx 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: 90Cxx 05C75 05C78 90C27 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
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: 90Cxx 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: 90Cxx 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: 90Cxx 90-02 90-01 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
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
Bampis, Evripidis; Escoffier, Bruno; Teiller, Alexandre Multistage knapsack. (English) Zbl 07499482 J. Comput. Syst. Sci. 126, 106-118 (2022). MSC: 90C27 68W25 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 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 07499386 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 07499386) Full Text: DOI OpenURL
Nejoomi, A.; Dolati, A. Connected bin packing problem on traceable graphs. (English) Zbl 1482.90186 Iran. J. Numer. Anal. Optim. 12, No. 1, 163-171 (2022). MSC: 90C27 90C35 68Q25 68W25 PDF BibTeX XML Cite \textit{A. Nejoomi} and \textit{A. Dolati}, Iran. J. Numer. Anal. Optim. 12, No. 1, 163--171 (2022; Zbl 1482.90186) Full Text: DOI OpenURL
Kobayashi, Yusuke Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles. (English) Zbl 07495435 Math. Program. 192, No. 1-2 (B), 675-702 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{Y. Kobayashi}, Math. Program. 192, No. 1--2 (B), 675--702 (2022; Zbl 07495435) Full Text: DOI OpenURL
van Hoeve, Willem-Jan Graph coloring with decision diagrams. (English) Zbl 07495434 Math. Program. 192, No. 1-2 (B), 631-674 (2022). MSC: 90C27 90C10 90C35 05C15 PDF BibTeX XML Cite \textit{W.-J. van Hoeve}, Math. Program. 192, No. 1--2 (B), 631--674 (2022; Zbl 07495434) Full Text: DOI OpenURL
Gupta, Anupam; Kumar, Amit; Nagarajan, Viswanath; Shen, Xiangkun Stochastic makespan minimization in structured set systems. (English) Zbl 07495433 Math. Program. 192, No. 1-2 (B), 597-630 (2022). MSC: 68W25 90C27 90B15 PDF BibTeX XML Cite \textit{A. Gupta} et al., Math. Program. 192, No. 1--2 (B), 597--630 (2022; Zbl 07495433) Full Text: DOI OpenURL
Kavitha, Telikepalli; Király, Tamás; Matuschke, Jannik; Schlotter, Ildikó; Schmidt-Kraepelin, Ulrike Popular branchings and their dual certificates. (English) Zbl 07495432 Math. Program. 192, No. 1-2 (B), 567-595 (2022). MSC: 90C27 90C46 68W01 PDF BibTeX XML Cite \textit{T. Kavitha} et al., Math. Program. 192, No. 1--2 (B), 567--595 (2022; Zbl 07495432) Full Text: DOI OpenURL
Conforti, Michele; Fiorini, Samuel; Huynh, Tony; Weltge, Stefan Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. (English) Zbl 07495431 Math. Program. 192, No. 1-2 (B), 547-566 (2022). MSC: 90C27 90C10 05C21 05C85 PDF BibTeX XML Cite \textit{M. Conforti} et al., Math. Program. 192, No. 1--2 (B), 547--566 (2022; Zbl 07495431) Full Text: DOI OpenURL
Traub, Vera; Tröbst, Thorben A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering. (English) Zbl 07495429 Math. Program. 192, No. 1-2 (B), 497-518 (2022). MSC: 68W25 68W20 90C05 90C27 90B06 PDF BibTeX XML Cite \textit{V. Traub} and \textit{T. Tröbst}, Math. Program. 192, No. 1--2 (B), 497--518 (2022; Zbl 07495429) Full Text: DOI OpenURL
Morell, Sarah; Skutella, Martin Single source unsplittable flows with arc-wise lower and upper bounds. (English) Zbl 07495428 Math. Program. 192, No. 1-2 (B), 477-496 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{S. Morell} and \textit{M. Skutella}, Math. Program. 192, No. 1--2 (B), 477--496 (2022; Zbl 07495428) Full Text: DOI OpenURL
Adjiashvili, David; Hommelsheim, Felix; Mühlenthaler, Moritz Flexible graph connectivity. (English) Zbl 07495426 Math. Program. 192, No. 1-2 (B), 409-441 (2022). MSC: 68W25 90C27 05C40 PDF BibTeX XML Cite \textit{D. Adjiashvili} et al., Math. Program. 192, No. 1--2 (B), 409--441 (2022; Zbl 07495426) Full Text: DOI OpenURL
Klimm, Max; Pfetsch, Marc E.; Raber, Rico; Skutella, Martin Packing under convex quadratic constraints. (English) Zbl 07495424 Math. Program. 192, No. 1-2 (B), 361-386 (2022). MSC: 90C27 90C35 68Q25 PDF BibTeX XML Cite \textit{M. Klimm} et al., Math. Program. 192, No. 1--2 (B), 361--386 (2022; Zbl 07495424) Full Text: DOI OpenURL
Hartmann, Tim A.; Lendl, Stefan; Woeginger, Gerhard J. Continuous facility location on graphs. (English) Zbl 07495418 Math. Program. 192, No. 1-2 (B), 207-227 (2022). MSC: 90C27 68Q25 05C85 PDF BibTeX XML Cite \textit{T. A. Hartmann} et al., Math. Program. 192, No. 1--2 (B), 207--227 (2022; Zbl 07495418) Full Text: DOI OpenURL
Frascaria, Dario; Olver, Neil Algorithms for flows over time with scheduling costs. (English) Zbl 07495417 Math. Program. 192, No. 1-2 (B), 177-206 (2022). MSC: 90C27 05C21 90B20 PDF BibTeX XML Cite \textit{D. Frascaria} and \textit{N. Olver}, Math. Program. 192, No. 1--2 (B), 177--206 (2022; Zbl 07495417) 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
Müller, Benjamin; Muñoz, Gonzalo; Gasse, Maxime; Gleixner, Ambros; Lodi, Andrea; Serrano, Felipe On generalized surrogate duality in mixed-integer nonlinear programming. (English) Zbl 07495414 Math. Program. 192, No. 1-2 (B), 89-118 (2022). MSC: 90Cxx 90-08 90C27 90C26 PDF BibTeX XML Cite \textit{B. Müller} et al., Math. Program. 192, No. 1--2 (B), 89--118 (2022; Zbl 07495414) Full Text: DOI OpenURL
Anegg, Georg; Angelidakis, Haris; Kurpisz, Adam; Zenklusen, Rico A technique for obtaining true approximations for \(k\)-center with covering constraints. (English) Zbl 07495410 Math. Program. 192, No. 1-2 (B), 3-27 (2022). MSC: 90C27 68W40 68Q25 PDF BibTeX XML Cite \textit{G. Anegg} et al., Math. Program. 192, No. 1--2 (B), 3--27 (2022; Zbl 07495410) Full Text: DOI OpenURL
Bernstein, Aaron; Disser, Yann; Groß, Martin; Himburg, Sandra General bounds for incremental maximization. (English) Zbl 07495406 Math. Program. 191, No. 2 (A), 953-979 (2022). MSC: 68W27 68W25 90C27 68Q25 PDF BibTeX XML Cite \textit{A. Bernstein} et al., Math. Program. 191, No. 2 (A), 953--979 (2022; Zbl 07495406) Full Text: DOI OpenURL
Bruggmann, Simon; Zenklusen, Rico An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint. (English) Zbl 07495402 Math. Program. 191, No. 2 (A), 795-845 (2022). MSC: 90C27 68W20 68W25 PDF BibTeX XML Cite \textit{S. Bruggmann} and \textit{R. Zenklusen}, Math. Program. 191, No. 2 (A), 795--845 (2022; Zbl 07495402) Full Text: DOI OpenURL
Jartoux, Bruno; Mustafa, Nabil H. A tight analysis of geometric local search. (English) Zbl 07493727 Discrete Comput. Geom. 67, No. 2, 361-379 (2022). MSC: 68W25 90C27 68R10 PDF BibTeX XML Cite \textit{B. Jartoux} and \textit{N. H. Mustafa}, Discrete Comput. Geom. 67, No. 2, 361--379 (2022; Zbl 07493727) Full Text: DOI OpenURL
Chen, Xin; Miao, Qian; Lin, Bertrand M. T.; Sterna, Malgorzata; Blazewicz, Jacek Two-machine flow shop scheduling with a common due date to maximize total early work. (English) Zbl 07493194 Eur. J. Oper. Res. 300, No. 2, 504-511 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{X. Chen} et al., Eur. J. Oper. Res. 300, No. 2, 504--511 (2022; Zbl 07493194) Full Text: DOI OpenURL
Sahinkoc, H. Mert; Bilge, Ümit A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem. (English) Zbl 07493187 Eur. J. Oper. Res. 300, No. 2, 405-417 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{H. M. Sahinkoc} and \textit{Ü. Bilge}, Eur. J. Oper. Res. 300, No. 2, 405--417 (2022; Zbl 07493187) Full Text: DOI OpenURL
Allen, Cody; de Oliveira, Mauricio A minimal cardinality solution to fitting sawtooth piecewise-linear functions. (English) Zbl 07492867 J. Optim. Theory Appl. 192, No. 3, 930-959 (2022). MSC: 90C27 62J07 46N10 PDF BibTeX XML Cite \textit{C. Allen} and \textit{M. de Oliveira}, J. Optim. Theory Appl. 192, No. 3, 930--959 (2022; Zbl 07492867) Full Text: DOI OpenURL
Hegedűs, G. \(L\)-balancing families. (English) Zbl 07491523 Acta Math. Hung. 166, No. 1, 65-69 (2022). MSC: 05D05 13P25 05E40 PDF BibTeX XML Cite \textit{G. Hegedűs}, Acta Math. Hung. 166, No. 1, 65--69 (2022; Zbl 07491523) Full Text: DOI arXiv OpenURL
Heroy, Samuel; Taylor, Dane; Shi, Feng; Forest, M. Gregory; Mucha, Peter J. Rigidity percolation in disordered 3D rod systems. (English) Zbl 07490842 Multiscale Model. Simul. 20, No. 1, 250-281 (2022). MSC: 60K35 68R10 82B43 90C27 91D25 94C15 05C62 05C85 PDF BibTeX XML Cite \textit{S. Heroy} et al., Multiscale Model. Simul. 20, No. 1, 250--281 (2022; Zbl 07490842) Full Text: DOI arXiv OpenURL
Ran, Yingli; Huang, Xiaohui; Zhang, Zhao; Du, Ding-Zhu Approximation algorithm for minimum partial multi-cover under a geometric setting. (English) Zbl 07490500 Optim. Lett. 16, No. 2, 667-680 (2022). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{Y. Ran} et al., Optim. Lett. 16, No. 2, 667--680 (2022; Zbl 07490500) Full Text: DOI OpenURL
Mokeev, Dmitry B.; Malyshev, Dmitry S. On partial descriptions of König graphs for odd paths and all their spanning supergraphs. (English) Zbl 07490490 Optim. Lett. 16, No. 2, 481-496 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Optim. Lett. 16, No. 2, 481--496 (2022; Zbl 07490490) Full Text: DOI OpenURL
Iori, Manuel; de Lima, Vinícius Loti; Martello, Silvano; Monaci, Michele 2DPackLib: a two-dimensional cutting and packing library. (English) Zbl 07490489 Optim. Lett. 16, No. 2, 471-480 (2022). MSC: 90C27 PDF BibTeX XML Cite \textit{M. Iori} et al., Optim. Lett. 16, No. 2, 471--480 (2022; Zbl 07490489) Full Text: DOI OpenURL
Catanzaro, Daniele; Coniglio, Stefano; Furini, Fabio On the exact separation of cover inequalities of maximum-depth. (English) Zbl 07490488 Optim. Lett. 16, No. 2, 449-469 (2022). MSC: 90C27 90C39 90C11 PDF BibTeX XML Cite \textit{D. Catanzaro} et al., Optim. Lett. 16, No. 2, 449--469 (2022; Zbl 07490488) Full Text: DOI OpenURL
Cavero, Sergio; Pardo, Eduardo G.; Duarte, Abraham A general variable neighborhood search for the cyclic antibandwidth problem. (English) Zbl 07490085 Comput. Optim. Appl. 81, No. 2, 657-687 (2022). MSC: 90C35 90C27 90C59 PDF BibTeX XML Cite \textit{S. Cavero} et al., Comput. Optim. Appl. 81, No. 2, 657--687 (2022; Zbl 07490085) Full Text: DOI OpenURL
Xie, Fanrong; Sharma, Anuj; Li, Zuoan An alternate approach to solve two-level priority based assignment problem. (English) Zbl 07490084 Comput. Optim. Appl. 81, No. 2, 613-656 (2022). MSC: 90C27 90B80 PDF BibTeX XML Cite \textit{F. Xie} et al., Comput. Optim. Appl. 81, No. 2, 613--656 (2022; Zbl 07490084) Full Text: DOI OpenURL
Gupta, Sushmita; Saurabh, Saket; Zehavi, Meirav On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization). (English) Zbl 07489485 SIAM J. Discrete Math. 36, No. 1, 596-681 (2022). MSC: 91B68 90C27 05C85 PDF BibTeX XML Cite \textit{S. Gupta} et al., SIAM J. Discrete Math. 36, No. 1, 596--681 (2022; Zbl 07489485) Full Text: DOI OpenURL
Traub, Vera; Vygen, Jens An improved approximation algorithm for the asymmetric traveling salesman problem. (English) Zbl 07488098 SIAM J. Comput. 51, No. 1, 139-173 (2022). MSC: 68W25 05C85 90C27 PDF BibTeX XML Cite \textit{V. Traub} and \textit{J. Vygen}, SIAM J. Comput. 51, No. 1, 139--173 (2022; Zbl 07488098) Full Text: DOI OpenURL
Bérczi, Kristóf; Boros, Endre; Čepek, Ondřej; Kučera, Petr; Makino, Kazuhisa Approximating minimum representations of key Horn functions. (English) Zbl 07488097 SIAM J. Comput. 51, No. 1, 116-138 (2022). MSC: 68W25 90C27 06E30 05C85 PDF BibTeX XML Cite \textit{K. Bérczi} et al., SIAM J. Comput. 51, No. 1, 116--138 (2022; Zbl 07488097) Full Text: DOI arXiv OpenURL
Schmand, Daniel; Schröder, Marc; Vargas Koch, Laura A greedy algorithm for the social golfer and the Oberwolfach problem. (English) Zbl 07487843 Eur. J. Oper. Res. 300, No. 1, 310-319 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{D. Schmand} et al., Eur. J. Oper. Res. 300, No. 1, 310--319 (2022; Zbl 07487843) Full Text: DOI arXiv OpenURL
Pereira, Armando Honorio; Mateus, Geraldo Robson; Urrutia, Sebastián Alberto Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. (English) Zbl 07487836 Eur. J. Oper. Res. 300, No. 1, 207-220 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{A. H. Pereira} et al., Eur. J. Oper. Res. 300, No. 1, 207--220 (2022; Zbl 07487836) Full Text: DOI OpenURL
Lee, Jisun; Joung, Seulgi; Lee, Kyungsik A fully polynomial time approximation scheme for the probability maximizing shortest path problem. (English) Zbl 07487823 Eur. J. Oper. Res. 300, No. 1, 35-45 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{J. Lee} et al., Eur. J. Oper. Res. 300, No. 1, 35--45 (2022; Zbl 07487823) Full Text: DOI OpenURL
Catanzaro, Daniele; Frohn, Martin; Gascuel, Olivier; Pesenti, Raffaele A tutorial on the balanced minimum evolution problem. (English) Zbl 07487821 Eur. J. Oper. Res. 300, No. 1, 1-19 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{D. Catanzaro} et al., Eur. J. Oper. Res. 300, No. 1, 1--19 (2022; Zbl 07487821) Full Text: DOI OpenURL
Douek-Pinkovich, Yifat; Ben-Gal, Irad; Raviv, Tal The stochastic test collection problem: models, exact and heuristic solution approaches. (English) Zbl 07487803 Eur. J. Oper. Res. 299, No. 3, 945-959 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{Y. Douek-Pinkovich} et al., Eur. J. Oper. Res. 299, No. 3, 945--959 (2022; Zbl 07487803) Full Text: DOI OpenURL
Martí, Rafael; Martínez-Gavara, Anna; Pérez-Peló, Sergio; Sánchez-Oro, Jesús A review on discrete diversity and dispersion maximization from an or perspective. (English) Zbl 07487794 Eur. J. Oper. Res. 299, No. 3, 795-813 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{R. Martí} et al., Eur. J. Oper. Res. 299, No. 3, 795--813 (2022; Zbl 07487794) Full Text: DOI OpenURL
Marzo, Ruslán G.; Melo, Rafael A.; Ribeiro, Celso C.; Santos, Marcio C. New formulations and branch-and-cut procedures for the longest induced path problem. (English) Zbl 07486440 Comput. Oper. Res. 139, Article ID 105627, 11 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{R. G. Marzo} et al., Comput. Oper. Res. 139, Article ID 105627, 11 p. (2022; Zbl 07486440) Full Text: DOI arXiv OpenURL
Mladenović, Nenad; Todosijević, Raca; Urošević, Dragan; Ratli, Mustapha Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS. (English) Zbl 07486438 Comput. Oper. Res. 139, Article ID 105622, 17 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{N. Mladenović} et al., Comput. Oper. Res. 139, Article ID 105622, 17 p. (2022; Zbl 07486438) Full Text: DOI OpenURL
Domínguez, Concepción; Labbé, Martine; Marín, Alfredo Mixed-integer formulations for the capacitated rank pricing problem with envy. (English) Zbl 07486428 Comput. Oper. Res. 140, Article ID 105664, 12 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{C. Domínguez} et al., Comput. Oper. Res. 140, Article ID 105664, 12 p. (2022; Zbl 07486428) Full Text: DOI OpenURL
Kucukoglu, Ilker The traveling purchaser problem with fast service option. (English) Zbl 07486416 Comput. Oper. Res. 141, Article ID 105700, 26 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{I. Kucukoglu}, Comput. Oper. Res. 141, Article ID 105700, 26 p. (2022; Zbl 07486416) Full Text: DOI OpenURL
Horváth, Markó; Kis, Tamás; Kovács, András; Fekula, Márk Assembly planning by disjunctive programming and geometrical reasoning. (English) Zbl 07486387 Comput. Oper. Res. 138, Article ID 105603, 13 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{M. Horváth} et al., Comput. Oper. Res. 138, Article ID 105603, 13 p. (2022; Zbl 07486387) Full Text: DOI OpenURL
Glize, Estèle; Jozefowiez, Nicolas; Ngueveu, Sandra Ulrich An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems. (English) Zbl 07486372 Comput. Oper. Res. 138, Article ID 105570, 16 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{E. Glize} et al., Comput. Oper. Res. 138, Article ID 105570, 16 p. (2022; Zbl 07486372) Full Text: DOI OpenURL
Carrano, Eduardo G.; Cruz, Letícia D.; Baptista, Douglas; Camargo, Daniel; Takahashi, Ricardo H. C. An efficient and fast local search based heuristic for reel management in a production line of oil extraction pipes. (English) Zbl 07486352 Comput. Oper. Res. 137, Article ID 105547, 15 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{E. G. Carrano} et al., Comput. Oper. Res. 137, Article ID 105547, 15 p. (2022; Zbl 07486352) Full Text: DOI OpenURL
Friske, Marcelo W.; Buriol, Luciana S.; Camponogara, Eduardo A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem. (English) Zbl 07486342 Comput. Oper. Res. 137, Article ID 105520, 16 p. (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{M. W. Friske} et al., Comput. Oper. Res. 137, Article ID 105520, 16 p. (2022; Zbl 07486342) Full Text: DOI OpenURL
Toffano, Federico; Garraffa, Michele; Lin, Yiqing; Prestwich, Steven; Simonis, Helmut; Wilson, Nic A multi-objective supplier selection framework based on user-preferences. (English) Zbl 07486118 Ann. Oper. Res. 308, No. 1-2, 609-640 (2022). MSC: 90B50 90B05 90B06 90C29 90C27 PDF BibTeX XML Cite \textit{F. Toffano} et al., Ann. Oper. Res. 308, No. 1--2, 609--640 (2022; Zbl 07486118) Full Text: DOI OpenURL
Tarhini, Abbas; Danach, Kassem; Harfouche, Antoine Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers. (English) Zbl 07486116 Ann. Oper. Res. 308, No. 1-2, 549-570 (2022). MSC: 90C27 90C59 90B06 PDF BibTeX XML Cite \textit{A. Tarhini} et al., Ann. Oper. Res. 308, No. 1--2, 549--570 (2022; Zbl 07486116) Full Text: DOI OpenURL
Baste, Julien; Fellows, Michael R.; Jaffke, Lars; Masařík, Tomáš; de Oliveira Oliveira, Mateus; Philip, Geevarghese; Rosamond, Frances A. Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory. (English) Zbl 07482897 Artif. Intell. 303, Article ID 103644, 15 p. (2022). MSC: 68Txx PDF BibTeX XML Cite \textit{J. Baste} et al., Artif. Intell. 303, Article ID 103644, 15 p. (2022; Zbl 07482897) Full Text: DOI arXiv OpenURL
San Segundo, Pablo; Furini, Fabio; León, Rafael A new branch-and-filter exact algorithm for binary constraint satisfaction problems. (English) Zbl 07479751 Eur. J. Oper. Res. 299, No. 2, 448-467 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{P. San Segundo} et al., Eur. J. Oper. Res. 299, No. 2, 448--467 (2022; Zbl 07479751) Full Text: DOI OpenURL
Fernández, Elena; Munoz-Marquez, Manuel New formulations and solutions for the strategic berth template problem. (English) Zbl 07478885 Eur. J. Oper. Res. 298, No. 1, 99-117 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{E. Fernández} and \textit{M. Munoz-Marquez}, Eur. J. Oper. Res. 298, No. 1, 99--117 (2022; Zbl 07478885) Full Text: DOI OpenURL
Sinnl, Markus Exact and heuristic algorithms for the maximum weighted submatrix coverage problem. (English) Zbl 07478855 Eur. J. Oper. Res. 298, No. 3, 821-833 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{M. Sinnl}, Eur. J. Oper. Res. 298, No. 3, 821--833 (2022; Zbl 07478855) Full Text: DOI OpenURL
Seeve, Teemu; Vilkkumaa, Eeva Identifying and visualizing a diverse set of plausible scenarios for strategic planning. (English) Zbl 07478840 Eur. J. Oper. Res. 298, No. 2, 596-610 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{T. Seeve} and \textit{E. Vilkkumaa}, Eur. J. Oper. Res. 298, No. 2, 596--610 (2022; Zbl 07478840) Full Text: DOI OpenURL
Pantourakis, Michail; Tsafarakis, Stelios; Zervoudakis, Konstantinos; Altsitsiadis, Efthymios; Andronikidis, Andreas; Ntamadaki, Vasiliki Clonal selection algorithms for optimal product line design: a comparative study. (English) Zbl 07478839 Eur. J. Oper. Res. 298, No. 2, 585-595 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{M. Pantourakis} et al., Eur. J. Oper. Res. 298, No. 2, 585--595 (2022; Zbl 07478839) Full Text: DOI OpenURL
Ben-Ameur, Walid; Neto, José New bounds for subset selection from conic relaxations. (English) Zbl 07478829 Eur. J. Oper. Res. 298, No. 2, 425-438 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{W. Ben-Ameur} and \textit{J. Neto}, Eur. J. Oper. Res. 298, No. 2, 425--438 (2022; Zbl 07478829) Full Text: DOI OpenURL
Iyer, Rishabh; Khargonkar, Ninad; Bilmes, Jeff; Asnani, Himanshu Generalized submodular information measures: theoretical properties, examples, optimization algorithms, and applications. (English) Zbl 07475723 IEEE Trans. Inf. Theory 68, No. 2, 752-781 (2022). MSC: 94A17 94A24 90C27 PDF BibTeX XML Cite \textit{R. Iyer} et al., IEEE Trans. Inf. Theory 68, No. 2, 752--781 (2022; Zbl 07475723) Full Text: DOI OpenURL
Ji, Min; Ye, Xinna; Qian, Fangyao; Cheng, T. C. E.; Jiang, Yiwei Parallel-machine scheduling in shared manufacturing. (English) Zbl 07475212 J. Ind. Manag. Optim. 18, No. 1, 681-691 (2022). MSC: 90B35 90C27 PDF BibTeX XML Cite \textit{M. Ji} et al., J. Ind. Manag. Optim. 18, No. 1, 681--691 (2022; Zbl 07475212) Full Text: DOI OpenURL
Li, Min; Wang, Yishui; Xu, Dachuan; Zhang, Dongmei The approximation algorithm based on seeding method for functional \(k\)-means problem. (English) Zbl 07475198 J. Ind. Manag. Optim. 18, No. 1, 411-426 (2022). MSC: 90C27 68W25 PDF BibTeX XML Cite \textit{M. Li} et al., J. Ind. Manag. Optim. 18, No. 1, 411--426 (2022; Zbl 07475198) Full Text: DOI OpenURL
Wang, Ji-Bo; Zhang, Bo; He, Hongyu A unified analysis for scheduling problems with variable processing times. (English) Zbl 07475157 J. Ind. Manag. Optim. 18, No. 2, 1063-1077 (2022). MSC: 90B35 90C27 PDF BibTeX XML Cite \textit{J.-B. Wang} et al., J. Ind. Manag. Optim. 18, No. 2, 1063--1077 (2022; Zbl 07475157) Full Text: DOI OpenURL
Arslan, Ömer; İşleyen, Selçuk Kürşat A model and two heuristic methods for the multi-product inventory-location-routing problem with heterogeneous fleet. (English) Zbl 07475151 J. Ind. Manag. Optim. 18, No. 2, 897-932 (2022). MSC: 90B05 90B06 90C11 90C27 PDF BibTeX XML Cite \textit{Ö. Arslan} and \textit{S. K. İşleyen}, J. Ind. Manag. Optim. 18, No. 2, 897--932 (2022; Zbl 07475151) Full Text: DOI OpenURL
Kiselman, Christer Oscar Elements of digital geometry, mathematical morphology, and discrete optimization. (English) Zbl 07473601 Singapore: World Scientific (ISBN 978-981-12-4829-0/hbk; 978-981-12-4831-3/ebook). xxiii, 461 p. (2022). MSC: 52-01 65-01 90-01 65D18 52Cxx 90C27 PDF BibTeX XML Cite \textit{C. O. Kiselman}, Elements of digital geometry, mathematical morphology, and discrete optimization. Singapore: World Scientific (2022; Zbl 07473601) Full Text: DOI OpenURL