Becker, Tristan; Schiffer, Maximilian; Walther, Grit A general branch-and-cut framework for rotating workforce scheduling. (English) Zbl 07552222 INFORMS J. Comput. 34, No. 3, 1548-1564 (2022). MSC: 90C35 90C10 PDF BibTeX XML Cite \textit{T. Becker} et al., INFORMS J. Comput. 34, No. 3, 1548--1564 (2022; Zbl 07552222) Full Text: DOI OpenURL
Lin, Yi-Kuei; Huang, Cheng-Fu; Chang, Chin-Chia Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation. (English) Zbl 07550817 Ann. Oper. Res. 312, No. 1, 345-368 (2022). MSC: 90C35 68Q25 90B15 90B25 90B10 PDF BibTeX XML Cite \textit{Y.-K. Lin} et al., Ann. Oper. Res. 312, No. 1, 345--368 (2022; Zbl 07550817) Full Text: DOI OpenURL
Erturk, Mine Su; Xu, Kuang Anonymous stochastic routing. (English) Zbl 07547885 Stoch. Syst. 12, No. 1, 92-126 (2022). MSC: 90C35 91A28 68P15 PDF BibTeX XML Cite \textit{M. S. Erturk} and \textit{K. Xu}, Stoch. Syst. 12, No. 1, 92--126 (2022; Zbl 07547885) Full Text: DOI OpenURL
Sinjorgo, Lennart; Sotirov, Renata On the generalized \(\vartheta\)-number and related problems for highly symmetric graphs. (English) Zbl 07543647 SIAM J. Optim. 32, No. 2, 1344-1378 (2022). MSC: 90C22 05C15 90C35 PDF BibTeX XML Cite \textit{L. Sinjorgo} and \textit{R. Sotirov}, SIAM J. Optim. 32, No. 2, 1344--1378 (2022; Zbl 07543647) 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
Shin, Sungho; Anitescu, Mihai; Zavala, Victor M. Exponential decay of sensitivity in graph-structured nonlinear programs. (English) Zbl 07535639 SIAM J. Optim. 32, No. 2, 1156-1183 (2022). MSC: 90C30 90C35 PDF BibTeX XML Cite \textit{S. Shin} et al., SIAM J. Optim. 32, No. 2, 1156--1183 (2022; Zbl 07535639) Full Text: DOI OpenURL
Lindner, Niels; Reisch, Julian An analysis of the parameterized complexity of periodic timetabling. (English) Zbl 07533036 J. Sched. 25, No. 2, 157-176 (2022). MSC: 68Q17 90B20 68Q25 90B06 90B35 90C35 90C39 90B35 68M20 PDF BibTeX XML Cite \textit{N. Lindner} and \textit{J. Reisch}, J. Sched. 25, No. 2, 157--176 (2022; Zbl 07533036) Full Text: DOI OpenURL
Devriendt, Karel; Martin-Gutierrez, Samuel; Lambiotte, Renaud Variance and covariance of distributions on graphs. (English) Zbl 07525526 SIAM Rev. 64, No. 2, 343-359 (2022). MSC: 05D40 05C82 05C12 05C69 05C80 90C35 05C85 60C05 PDF BibTeX XML Cite \textit{K. Devriendt} et al., SIAM Rev. 64, No. 2, 343--359 (2022; Zbl 07525526) Full Text: DOI OpenURL
Batlle, Pau; Bruna, Joan; Fernandez-Granda, Carlos; Preciado, Victor M. Adaptive test allocation for outbreak detection and tracking in social contact networks. (English) Zbl 07516609 SIAM J. Control Optim. 60, No. 2, S274-S293 (2022). Reviewer: Yilun Shang (Newcastle) MSC: 92D30 91D30 60J20 90C35 PDF BibTeX XML Cite \textit{P. Batlle} et al., SIAM J. Control Optim. 60, No. 2, S274--S293 (2022; Zbl 07516609) Full Text: DOI OpenURL
Zorzenon, Davide; Komenda, Jan; Raisch, Jörg The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory. (English) Zbl 07516296 Discrete Appl. Math. 315, 56-70 (2022). MSC: 90C35 PDF BibTeX XML Cite \textit{D. Zorzenon} et al., Discrete Appl. Math. 315, 56--70 (2022; Zbl 07516296) Full Text: DOI OpenURL
Golin, Mordecai; Sandeep, Sai Minmax regret for sink location on dynamic flow paths with general capacities. (English) Zbl 07516293 Discrete Appl. Math. 315, 1-26 (2022). MSC: 90B80 90B10 90C35 90C47 05C85 PDF BibTeX XML Cite \textit{M. Golin} and \textit{S. Sandeep}, Discrete Appl. Math. 315, 1--26 (2022; Zbl 07516293) Full Text: DOI OpenURL
Ouzia, Hacene; Maculan, Nelson Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\). (English) Zbl 07513941 J. Glob. Optim. 83, No. 1, 119-136 (2022). MSC: 90C35 90C11 PDF BibTeX XML Cite \textit{H. Ouzia} and \textit{N. Maculan}, J. Glob. Optim. 83, No. 1, 119--136 (2022; Zbl 07513941) Full Text: DOI OpenURL
Goldberg, Noam; Poss, Michael Linearized formulations for failure aware barter exchange. (English) Zbl 07511913 Optim. Lett. 16, No. 4, 1301-1313 (2022). MSC: 90C35 90C90 PDF BibTeX XML Cite \textit{N. Goldberg} and \textit{M. Poss}, Optim. Lett. 16, No. 4, 1301--1313 (2022; Zbl 07511913) 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
Demange, Marc; Di Fonso, Alessia; Di Stefano, Gabriele; Vittorini, Pierpaolo A graph theoretical approach to the firebreak locating problem. (English) Zbl 07509397 Theor. Comput. Sci. 914, 47-72 (2022). MSC: 68Q25 68Q17 68R10 90B80 90C35 PDF BibTeX XML Cite \textit{M. Demange} et al., Theor. Comput. Sci. 914, 47--72 (2022; Zbl 07509397) Full Text: DOI OpenURL
Lenz, Ralf; Becker, Kai Helge Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches. (English) Zbl 07507161 OR Spectrum 44, No. 1, 179-224 (2022). MSC: 90B10 90C11 90C35 90C30 90B06 PDF BibTeX XML Cite \textit{R. Lenz} and \textit{K. H. Becker}, OR Spectrum 44, No. 1, 179--224 (2022; Zbl 07507161) Full Text: DOI OpenURL
Shenmaier, Vladimir Linear-size universal discretization of geometric center-based problems in fixed dimensions. (English) Zbl 07507010 J. Comb. Optim. 43, No. 3, 528-542 (2022). MSC: 90C35 PDF BibTeX XML Cite \textit{V. Shenmaier}, J. Comb. Optim. 43, No. 3, 528--542 (2022; Zbl 07507010) Full Text: DOI OpenURL
Velednitsky, Mark Solving \((k-1)\)-stable instances of k-terminal cut with isolating cuts. (English) Zbl 07507000 J. Comb. Optim. 43, No. 2, 297-311 (2022). MSC: 90C35 PDF BibTeX XML Cite \textit{M. Velednitsky}, J. Comb. Optim. 43, No. 2, 297--311 (2022; Zbl 07507000) 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
Abbaas, Omar; Ventura, Jose A. A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network. (English) Zbl 07500341 Optim. Lett. 16, No. 3, 953-982 (2022). MSC: 90C35 90B85 PDF BibTeX XML Cite \textit{O. Abbaas} and \textit{J. A. Ventura}, Optim. Lett. 16, No. 3, 953--982 (2022; Zbl 07500341) Full Text: DOI OpenURL
Yemshanov, Denys; Haight, Robert G.; Liu, Ning; Rempel, Rob; Koch, Frank H.; Rodgers, Art Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach. (English) Zbl 07500335 Optim. Lett. 16, No. 3, 747-788 (2022). MSC: 90C35 90C11 90C90 PDF BibTeX XML Cite \textit{D. Yemshanov} et al., Optim. Lett. 16, No. 3, 747--788 (2022; Zbl 07500335) Full Text: DOI OpenURL
Neto, José A polyhedral view to a generalization of multiple domination. (English) Zbl 07499190 Discrete Appl. Math. 313, 1-17 (2022). MSC: 05C69 90C10 90C35 PDF BibTeX XML Cite \textit{J. Neto}, Discrete Appl. Math. 313, 1--17 (2022; Zbl 07499190) 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
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
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 90C35 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
Candogan, Utkan Onur; Chandrasekaran, Venkat Convex graph invariant relaxations for graph edit distance. (English) Zbl 07495397 Math. Program. 191, No. 2 (A), 595-629 (2022). MSC: 90C35 90C25 90C22 90C90 PDF BibTeX XML Cite \textit{U. O. Candogan} and \textit{V. Chandrasekaran}, Math. Program. 191, No. 2 (A), 595--629 (2022; Zbl 07495397) Full Text: DOI OpenURL
Faenza, Yuri; Muñoz, Gonzalo; Pokutta, Sebastian New limits of treewidth-based tractability in optimization. (English) Zbl 07495396 Math. Program. 191, No. 2 (A), 559-594 (2022). MSC: 90C35 90C05 90C22 PDF BibTeX XML Cite \textit{Y. Faenza} et al., Math. Program. 191, No. 2 (A), 559--594 (2022; Zbl 07495396) Full Text: DOI OpenURL
Lin, Yi-Kuei; Chen, Shin-Guang Reliability evaluation in terms of flow data mining for multistate networks. (English) Zbl 1485.90031 Ann. Oper. Res. 311, No. 1, 225-237 (2022). MSC: 90B25 90B15 90B10 90C35 PDF BibTeX XML Cite \textit{Y.-K. Lin} and \textit{S.-G. Chen}, Ann. Oper. Res. 311, No. 1, 225--237 (2022; Zbl 1485.90031) Full Text: DOI OpenURL
Chen, Hangdi; Lu, Changhong; Ye, Qingjie Generalized power domination in claw-free regular graphs. (English) Zbl 1485.05133 Graphs Comb. 38, No. 3, Paper No. 68, 17 p. (2022). MSC: 05C69 90C35 05C85 68R10 05C35 05C90 PDF BibTeX XML Cite \textit{H. Chen} et al., Graphs Comb. 38, No. 3, Paper No. 68, 17 p. (2022; Zbl 1485.05133) Full Text: DOI arXiv OpenURL
Bomze, Immanuel M.; Rinaldi, Francesco; Zeffiro, Damiano Fast cluster detection in networks by first order optimization. (English) Zbl 07493846 SIAM J. Math. Data Sci. 4, No. 1, 285-305 (2022). MSC: 90C35 05C50 05C82 65K05 90C06 90C30 PDF BibTeX XML Cite \textit{I. M. Bomze} et al., SIAM J. Math. Data Sci. 4, No. 1, 285--305 (2022; Zbl 07493846) Full Text: DOI arXiv 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
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
Schewe, Lars; Schmidt, Martin; Thürauf, Johannes Global optimization for the multilevel European gas market system with nonlinear flow models on trees. (English) Zbl 07489943 J. Glob. Optim. 82, No. 3, 627-653 (2022). MSC: 90B10 90B06 90C26 90C35 90C11 90C30 PDF BibTeX XML Cite \textit{L. Schewe} et al., J. Glob. Optim. 82, No. 3, 627--653 (2022; Zbl 07489943) Full Text: DOI OpenURL
Nip, Kameng; Shi, Tianning; Wang, Zhenbo Some graph optimization problems with weights satisfying linear constraints. (English) Zbl 1485.90144 J. Comb. Optim. 43, No. 1, 200-225 (2022). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{K. Nip} et al., J. Comb. Optim. 43, No. 1, 200--225 (2022; Zbl 1485.90144) Full Text: DOI OpenURL
Khanjani-Shiraz, Rashed; Babapour-Azar, Ali; Hosseini-Noudeh, Zohreh; Pardalos, Panos M. Distributionally robust maximum probability shortest path problem. (English) Zbl 1485.90082 J. Comb. Optim. 43, No. 1, 140-167 (2022). MSC: 90C17 90C35 PDF BibTeX XML Cite \textit{R. Khanjani-Shiraz} et al., J. Comb. Optim. 43, No. 1, 140--167 (2022; Zbl 1485.90082) Full Text: DOI OpenURL
Cui, Shu-Yu; Wang, Yiqiao; Huang, Danjun; Du, Hongwei; Wang, Weifan Structure and pancyclicity of maximal planar graphs with diameter two. (English) Zbl 1485.90106 J. Comb. Optim. 43, No. 1, 1-27 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{S.-Y. Cui} et al., J. Comb. Optim. 43, No. 1, 1--27 (2022; Zbl 1485.90106) Full Text: DOI OpenURL
Bermolen, Paola; Goicoechea, Valeria; Jonckheere, Matthieu; Mordecki, Ernesto Large deviation principle for the greedy exploration algorithm over Erdős-Rényi graphs. (English) Zbl 1484.90130 ALEA, Lat. Am. J. Probab. Math. Stat. 19, No. 1, 439-456 (2022). MSC: 90C35 90C59 90B18 PDF BibTeX XML Cite \textit{P. Bermolen} et al., ALEA, Lat. Am. J. Probab. Math. Stat. 19, No. 1, 439--456 (2022; Zbl 1484.90130) Full Text: arXiv Link OpenURL
Young, Stephen J. The weighted spectrum of the universal cover and an Alon-Boppana result for the normalized Laplacian. (English) Zbl 1482.05217 J. Comb. 13, No. 1, 23-40 (2022). MSC: 05C50 05C22 05C70 90C35 PDF BibTeX XML Cite \textit{S. J. Young}, J. Comb. 13, No. 1, 23--40 (2022; Zbl 1482.05217) Full Text: DOI OpenURL
Chen, Chen; Tong, Hanghang Network connectivity. Concepts, computation, and optimization. (English) Zbl 1481.68006 Synthesis Lectures on Learning, Networks, and Algorithms 28. San Rafael, CA: Morgan & Claypool Publishers (ISBN 978-1-63639-295-0; 978-1-63639-296-7/ebook). xiii, 151 p. (2022). MSC: 68-02 05C40 05C82 68Q25 68R10 68T05 68W25 90B10 90C35 90C59 PDF BibTeX XML Cite \textit{C. Chen} and \textit{H. Tong}, Network connectivity. Concepts, computation, and optimization. San Rafael, CA: Morgan \& Claypool Publishers (2022; Zbl 1481.68006) Full Text: DOI OpenURL
Ratli, Mustapha; Urošević, Dragan; Ait El Cadi, Abdessamad; Brimberg, Jack; Mladenović, Nenad; Todosijević, Raca An efficient heuristic for a hub location routing problem. (English) Zbl 1483.90171 Optim. Lett. 16, No. 1, 281-300 (2022). MSC: 90C35 90B80 90B06 90C59 PDF BibTeX XML Cite \textit{M. Ratli} et al., Optim. Lett. 16, No. 1, 281--300 (2022; Zbl 1483.90171) Full Text: DOI OpenURL
Morapitiye, Sunil; Kis, Tamás Strong cuts from compatibility relations for the dial-a-ride problem. (English) Zbl 1483.90170 Discrete Appl. Math. 309, 240-257 (2022). MSC: 90C35 90B06 PDF BibTeX XML Cite \textit{S. Morapitiye} and \textit{T. Kis}, Discrete Appl. Math. 309, 240--257 (2022; Zbl 1483.90170) Full Text: DOI OpenURL
Wagler, Annegret K. On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets. (English) Zbl 1479.05126 Discrete Appl. Math. 308, 209-219 (2022). MSC: 05C17 05C75 90C35 PDF BibTeX XML Cite \textit{A. K. Wagler}, Discrete Appl. Math. 308, 209--219 (2022; Zbl 1479.05126) Full Text: DOI OpenURL
Fampa, Marcia Insight into the computation of Steiner minimal trees in Euclidean space of general dimension. (English) Zbl 1483.90134 Discrete Appl. Math. 308, 4-19 (2022). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{M. Fampa}, Discrete Appl. Math. 308, 4--19 (2022; Zbl 1483.90134) Full Text: DOI OpenURL
Georges, J. P.; Kuenzel, K.; Mauro, D. W.; Skardal, P. S. On a distance-constrained graph labeling to model cooperation. (English) Zbl 1477.05160 Discrete Appl. Math. 306, 17-31 (2022). MSC: 05C78 05C12 90C35 05C40 PDF BibTeX XML Cite \textit{J. P. Georges} et al., Discrete Appl. Math. 306, 17--31 (2022; Zbl 1477.05160) Full Text: DOI OpenURL
Maskooki, Alaleh; Deb, Kalyanmoy; Kallio, Markku A customized genetic algorithm for bi-objective routing in a dynamic network. (English) Zbl 07422922 Eur. J. Oper. Res. 297, No. 2, 615-629 (2022). MSC: 90B06 90C27 90C29 90C35 90C59 PDF BibTeX XML Cite \textit{A. Maskooki} et al., Eur. J. Oper. Res. 297, No. 2, 615--629 (2022; Zbl 07422922) Full Text: DOI OpenURL
Taillard, Éric D. A linearithmic heuristic for the travelling salesman problem. (English) Zbl 07422910 Eur. J. Oper. Res. 297, No. 2, 442-450 (2022). MSC: 90C27 90C35 90C59 PDF BibTeX XML Cite \textit{É. D. Taillard}, Eur. J. Oper. Res. 297, No. 2, 442--450 (2022; Zbl 07422910) Full Text: DOI OpenURL
Nguyen, Di H.; Smith, J. Cole Network interdiction with asymmetric cost uncertainty. (English) Zbl 07422893 Eur. J. Oper. Res. 297, No. 1, 239-251 (2022). MSC: 90B10 05C35 90C35 PDF BibTeX XML Cite \textit{D. H. Nguyen} and \textit{J. C. Smith}, Eur. J. Oper. Res. 297, No. 1, 239--251 (2022; Zbl 07422893) Full Text: DOI OpenURL
Veremyev, Alexander; Boginski, Vladimir; Pasiliao, Eduardo L.; Prokopyev, Oleg A. On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs. (English) Zbl 07422884 Eur. J. Oper. Res. 297, No. 1, 86-101 (2022). MSC: 90C35 05C69 90C10 91D30 PDF BibTeX XML Cite \textit{A. Veremyev} et al., Eur. J. Oper. Res. 297, No. 1, 86--101 (2022; Zbl 07422884) Full Text: DOI OpenURL
Tanınmış, Kübra; Aras, Necati; Altınel, İ. Kuban Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks. (English) Zbl 07422881 Eur. J. Oper. Res. 297, No. 1, 40-52 (2022). MSC: 90C11 90C47 90C35 91A65 91D30 PDF BibTeX XML Cite \textit{K. Tanınmış} et al., Eur. J. Oper. Res. 297, No. 1, 40--52 (2022; Zbl 07422881) Full Text: DOI arXiv 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
Bernardino, Raquel; Paias, Ana Corrigendum to “Solving the family traveling salesman problem”. (English) Zbl 07421380 Eur. J. Oper. Res. 296, No. 1, 388-391 (2022). MSC: 90C27 90C35 90B06 90C59 PDF BibTeX XML Cite \textit{R. Bernardino} and \textit{A. Paias}, Eur. J. Oper. Res. 296, No. 1, 388--391 (2022; Zbl 07421380) Full Text: DOI OpenURL
Farnam, Madineh; Darehmiraki, Majid Path programming problems in fuzzy environment. (English) Zbl 1480.90246 Ahmadian, Ali (ed.) et al., Soft computing approach for mathematical modeling of engineering problems. Boca Raton, FL: CRC Press. 83-114 (2022). MSC: 90C35 90C70 PDF BibTeX XML Cite \textit{M. Farnam} and \textit{M. Darehmiraki}, in: Soft computing approach for mathematical modeling of engineering problems. Boca Raton, FL: CRC Press. 83--114 (2022; Zbl 1480.90246) Full Text: DOI OpenURL
Schierreich, Šimon; Suchý, Ondřej Waypoint routing on bounded treewidth graphs. (English) Zbl 1472.68121 Inf. Process. Lett. 173, Article ID 106165, 9 p. (2022). MSC: 68R10 05C85 68Q27 90C27 90C35 PDF BibTeX XML Cite \textit{Š. Schierreich} and \textit{O. Suchý}, Inf. Process. Lett. 173, Article ID 106165, 9 p. (2022; Zbl 1472.68121) Full Text: DOI arXiv OpenURL
Sekizaki, Shinya; Yamasaki, Takuya; Nishizaki, Ichiro; Hayashida, Tomohiro; Kanazawa, Yuki; Hikoyama, Kazuhisa; Uenishi, Hirokazu Distribution line downsizing based on a set of non-dominated solutions for a network reconfiguration problem of an electric distribution system with many objectives. (English) Zbl 07527863 Optim. Eng. 22, No. 2, 1117-1139 (2021). MSC: 90B10 90B25 90C29 90C35 PDF BibTeX XML Cite \textit{S. Sekizaki} et al., Optim. Eng. 22, No. 2, 1117--1139 (2021; Zbl 07527863) Full Text: DOI OpenURL
Zazai, M. Fawad; Fügenschuh, Armin R. Computing the trajectories for the development of optimal routes. (English) Zbl 07527857 Optim. Eng. 22, No. 2, 975-999 (2021). MSC: 90C35 68R10 68U05 90B90 05C85 PDF BibTeX XML Cite \textit{M. F. Zazai} and \textit{A. R. Fügenschuh}, Optim. Eng. 22, No. 2, 975--999 (2021; Zbl 07527857) Full Text: DOI OpenURL
Hofmann, Tobias; Wenzel, David How to minimize cycle times of robot manufacturing systems. (English) Zbl 07527855 Optim. Eng. 22, No. 2, 895-912 (2021). MSC: 90B35 90C27 68Q25 90C35 05C38 PDF BibTeX XML Cite \textit{T. Hofmann} and \textit{D. Wenzel}, Optim. Eng. 22, No. 2, 895--912 (2021; Zbl 07527855) Full Text: DOI OpenURL
Krug, Richard; Mehrmann, Volker; Schmidt, Martin Nonlinear optimization of district heating networks. (English) Zbl 07527852 Optim. Eng. 22, No. 2, 783-819 (2021). MSC: 90C30 90C35 90C90 90B10 PDF BibTeX XML Cite \textit{R. Krug} et al., Optim. Eng. 22, No. 2, 783--819 (2021; Zbl 07527852) Full Text: DOI OpenURL
Fügenschuh, Armin (ed.); Lorenz, Ulf (ed.); Pelz, Peter F. (ed.) Editorial. OPTE special issue on technical operations research (TOR). (English) Zbl 07527847 Optim. Eng. 22, No. 2, 581-586 (2021). MSC: 00Bxx 90B90 90B06 90B10 90C35 PDF BibTeX XML Cite \textit{A. Fügenschuh} (ed.) et al., Optim. Eng. 22, No. 2, 581--586 (2021; Zbl 07527847) Full Text: DOI OpenURL
Malashenko, Y. E.; Nazarova, I. A. Analysis of equal-share and equalized flow distribution at the peak load in the multiuser network. (English. Russian original) Zbl 07516559 J. Comput. Syst. Sci. Int. 60, No. 5, 776-784 (2021); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2021, No. 5, 111-119 (2021). MSC: 90B18 90C35 65K05 68M10 PDF BibTeX XML Cite \textit{Y. E. Malashenko} and \textit{I. A. Nazarova}, J. Comput. Syst. Sci. Int. 60, No. 5, 776--784 (2021; Zbl 07516559); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upravl. 2021, No. 5, 111--119 (2021) Full Text: DOI OpenURL
Shim, Sangho; Bandi, Chaithanya; Chopra, Sunil On the (near) optimality of extended formulations for multi-way cut in social networks. (English) Zbl 1485.90071 Optim. Eng. 22, No. 3, 1557-1588 (2021). MSC: 90C10 90C35 91D30 PDF BibTeX XML Cite \textit{S. Shim} et al., Optim. Eng. 22, No. 3, 1557--1588 (2021; Zbl 1485.90071) Full Text: DOI OpenURL
Courtain, Sylvain; Leleux, Pierre; Kivimäki, Ilkka; Guex, Guillaume; Saerens, Marco Randomized shortest paths with net flows and capacity constraints. (English) Zbl 1484.68157 Inf. Sci. 556, 341-360 (2021). MSC: 68R10 05C21 05C82 68T09 90B15 90C35 PDF BibTeX XML Cite \textit{S. Courtain} et al., Inf. Sci. 556, 341--360 (2021; Zbl 1484.68157) Full Text: DOI OpenURL
Hanh, Phan Thi Hong; Thanh, Pham Dinh; Binh, Huynh Thi Thanh Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem. (English) Zbl 1483.68510 Inf. Sci. 553, 280-304 (2021). MSC: 68W50 90C35 90C59 PDF BibTeX XML Cite \textit{P. T. H. Hanh} et al., Inf. Sci. 553, 280--304 (2021; Zbl 1483.68510) Full Text: DOI OpenURL
Zhang, Yuzhou; Mei, Yi; Zhang, Buzhong; Jiang, Keqin Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition. (English) Zbl 1484.90132 Inf. Sci. 553, 208-224 (2021). MSC: 90C35 PDF BibTeX XML Cite \textit{Y. Zhang} et al., Inf. Sci. 553, 208--224 (2021; Zbl 1484.90132) Full Text: DOI OpenURL
Schiff, Krzysztof An ant algorithm for the maximum number of 3-cliques in 3-partite graphs. (English) Zbl 07504937 Control Cybern. 50, No. 2, 347-358 (2021). MSC: 05C30 05C35 05C70 90C35 90C27 PDF BibTeX XML Cite \textit{K. Schiff}, Control Cybern. 50, No. 2, 347--358 (2021; Zbl 07504937) OpenURL
Wagner, Dorothea; Wolf, Matthias The complexity of flow expansion and electrical flow expansion. (English) Zbl 07497746 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 431-441 (2021). MSC: 90B10 05C21 05C85 68Q17 68W40 90C35 94C15 PDF BibTeX XML Cite \textit{D. Wagner} and \textit{M. Wolf}, Lect. Notes Comput. Sci. 12607, 431--441 (2021; Zbl 07497746) Full Text: DOI OpenURL
Anthony, Barbara M.; Christman, Ananya D.; Chung, Christine; Yuen, David Serving rides of equal importance for time-limited dial-a-ride. (English) Zbl 1485.90035 Pardalos, Panos (ed.) et al., Mathematical optimization theory and operations research. 20th international conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12755, 35-50 (2021). MSC: 90B35 90C35 90C27 68W25 68Q25 PDF BibTeX XML Cite \textit{B. M. Anthony} et al., Lect. Notes Comput. Sci. 12755, 35--50 (2021; Zbl 1485.90035) Full Text: DOI OpenURL
Krylatov, Alexander Equilibrium traffic flow assignment in a multi-subnet urban road network. (English) Zbl 1485.90020 Pardalos, Panos (ed.) et al., Mathematical optimization theory and operations research. 20th international conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12755, 3-16 (2021). MSC: 90B20 90B10 68Q15 90C30 90C35 PDF BibTeX XML Cite \textit{A. Krylatov}, Lect. Notes Comput. Sci. 12755, 3--16 (2021; Zbl 1485.90020) Full Text: DOI OpenURL
Basavanagoud, B.; Jakkannavar, Praveen; Policepatil, Shruti Integrity of total transformation graphs. (English) Zbl 1482.05179 Electron. J. Graph Theory Appl. 9, No. 2, 309-329 (2021). MSC: 05C40 90C35 PDF BibTeX XML Cite \textit{B. Basavanagoud} et al., Electron. J. Graph Theory Appl. 9, No. 2, 309--329 (2021; Zbl 1482.05179) Full Text: DOI OpenURL
Ibrahim, Muhammad; Khan, S.; Asim, Muhammad Ahsan; Waseem, Muhammad Total irregularity strength of some cubic graphs. (English) Zbl 1482.05293 Proyecciones 40, No. 4, 905-918 (2021). MSC: 05C78 90C35 90C27 PDF BibTeX XML Cite \textit{M. Ibrahim} et al., Proyecciones 40, No. 4, 905--918 (2021; Zbl 1482.05293) Full Text: DOI OpenURL
Revathi, M.; Valliathal, M. Comparative analysis of fuzzy critical path method in agriculture project management. (English) Zbl 1483.90066 Int. J. Inf. Manage. Sci. 32, No. 1, 1-20 (2021). MSC: 90B50 03E72 90C35 PDF BibTeX XML Cite \textit{M. Revathi} and \textit{M. Valliathal}, Int. J. Inf. Manage. Sci. 32, No. 1, 1--20 (2021; Zbl 1483.90066) Full Text: DOI OpenURL
Hurlbert, Glenn; Kenter, Franklin Graph pebbling: a blend of graph theory, number theory, and optimization. (English) Zbl 1482.05231 Notices Am. Math. Soc. 68, No. 11, 1900-1913 (2021). MSC: 05C57 11B13 90B10 90C35 91A43 PDF BibTeX XML Cite \textit{G. Hurlbert} and \textit{F. Kenter}, Notices Am. Math. Soc. 68, No. 11, 1900--1913 (2021; Zbl 1482.05231) Full Text: DOI OpenURL
Mitsche, Dieter; Penrose, Mathew D. Limit theory of combinatorial optimization for random geometric graphs. (English) Zbl 1482.05313 Ann. Appl. Probab. 31, No. 6, 2721-2771 (2021). MSC: 05C80 60D05 60F15 90C27 90C35 60G55 PDF BibTeX XML Cite \textit{D. Mitsche} and \textit{M. D. Penrose}, Ann. Appl. Probab. 31, No. 6, 2721--2771 (2021; Zbl 1482.05313) Full Text: DOI arXiv OpenURL
Koehler, Jana; Bürgler, Josef; Fontana, Urs; Fux, Etienne; Herzog, Florian; Pouly, Marc; Saller, Sophia; Salyaeva, Anastasia; Scheiblechner, Peter; Waelti, Kai Cable tree wiring – benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints. (English) Zbl 07471953 Constraints 26, No. 1-4, 56-106 (2021). MSC: 68T20 90B35 68Q25 90C27 90C35 PDF BibTeX XML Cite \textit{J. Koehler} et al., Constraints 26, No. 1--4, 56--106 (2021; Zbl 07471953) Full Text: DOI arXiv OpenURL
Kalinowski, Thomas; Mohammadian, Sogol Feasible bases for a polytope related to the Hamilton cycle problem. (English) Zbl 1484.90135 Math. Oper. Res. 46, No. 4, 1366-1389 (2021). MSC: 90C40 90C35 05C80 05C81 PDF BibTeX XML Cite \textit{T. Kalinowski} and \textit{S. Mohammadian}, Math. Oper. Res. 46, No. 4, 1366--1389 (2021; Zbl 1484.90135) Full Text: DOI arXiv OpenURL
Cameron, Thomas R.; Charmot, Sebastian; Pulaj, Jonad On the linear ordering problem and the rankability of data. (English) Zbl 1484.90046 Found. Data Sci. 3, No. 2, 133-149 (2021). MSC: 90C09 90C27 90C35 PDF BibTeX XML Cite \textit{T. R. Cameron} et al., Found. Data Sci. 3, No. 2, 133--149 (2021; Zbl 1484.90046) Full Text: DOI arXiv OpenURL
Wang, Ke; Zhou, Yulin; Tian, Guichao; Goh, Mark A structured solution framework for fuzzy minimum spanning tree problem and its variants under different criteria. (English) Zbl 1478.90137 Fuzzy Optim. Decis. Mak. 20, No. 4, 497-528 (2021). MSC: 90C35 90C70 05C72 05C22 90C27 PDF BibTeX XML Cite \textit{K. Wang} et al., Fuzzy Optim. Decis. Mak. 20, No. 4, 497--528 (2021; Zbl 1478.90137) Full Text: DOI OpenURL
Ma, Xiaoyu; Yi, Peng; Chen, Jie Distributed gradient tracking methods with finite data rates. (English) Zbl 1483.90169 J. Syst. Sci. Complex. 34, No. 5, 1927-1952 (2021). MSC: 90C35 90C30 90B18 05C82 PDF BibTeX XML Cite \textit{X. Ma} et al., J. Syst. Sci. Complex. 34, No. 5, 1927--1952 (2021; Zbl 1483.90169) Full Text: DOI OpenURL
Szabó, Sándor A clique search problem and its application to machine scheduling. (English) Zbl 1483.90145 SN Oper. Res. Forum 2, No. 4, Paper No. 69, 12 p. (2021). MSC: 90C27 90C35 90B35 05C69 05C15 PDF BibTeX XML Cite \textit{S. Szabó}, SN Oper. Res. Forum 2, No. 4, Paper No. 69, 12 p. (2021; Zbl 1483.90145) Full Text: DOI OpenURL
Naves, Guyslain; Shepherd, Bruce; Xia, Henry Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. (English) Zbl 1482.90232 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, 326-339 (2021). MSC: 90C35 90C59 PDF BibTeX XML Cite \textit{G. Naves} et al., Lect. Notes Comput. Sci. 12707, 326--339 (2021; Zbl 1482.90232) Full Text: DOI arXiv OpenURL
Matoya, Kazuki; Oki, Taihei Pfaffian pairs and parities: counting on linear matroid intersection and parity problems. (English) Zbl 1482.90231 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, 223-237 (2021). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{K. Matoya} and \textit{T. Oki}, Lect. Notes Comput. Sci. 12707, 223--237 (2021; Zbl 1482.90231) Full Text: DOI arXiv OpenURL
de Lima, Vinícius L.; Iori, Manuel; Miyazawa, Flávio K. New exact techniques applied to a class of network flow formulations. (English) Zbl 1482.90228 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, 178-192 (2021). MSC: 90C35 PDF BibTeX XML Cite \textit{V. L. de Lima} et al., Lect. Notes Comput. Sci. 12707, 178--192 (2021; Zbl 1482.90228) Full Text: DOI OpenURL
Shen, Jie; Ren, Jingyi; Wang, Langdi Study on subproblem of bundle method for telecommunication network optimization problem. (Chinese. English summary) Zbl 07448481 J. Liaoning Norm. Univ., Nat. Sci. 44, No. 2, 145-149 (2021). MSC: 90C35 90C46 PDF BibTeX XML Cite \textit{J. Shen} et al., J. Liaoning Norm. Univ., Nat. Sci. 44, No. 2, 145--149 (2021; Zbl 07448481) Full Text: DOI OpenURL
Tjandraatmadja, Christian; van Hoeve, Willem-Jan Incorporating bounds from decision diagrams into integer programming. (English) Zbl 1476.90202 Math. Program. Comput. 13, No. 2, 225-256 (2021). MSC: 90C10 90C35 PDF BibTeX XML Cite \textit{C. Tjandraatmadja} and \textit{W.-J. van Hoeve}, Math. Program. Comput. 13, No. 2, 225--256 (2021; Zbl 1476.90202) Full Text: DOI OpenURL
Abdolhosseinzadeh, Mohsen; Alipour, Mir Mohammad Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks. (English) Zbl 1476.90334 Numer. Algebra Control Optim. 11, No. 2, 321-332 (2021). MSC: 90C35 90C59 62K20 90B10 PDF BibTeX XML Cite \textit{M. Abdolhosseinzadeh} and \textit{M. M. Alipour}, Numer. Algebra Control Optim. 11, No. 2, 321--332 (2021; Zbl 1476.90334) Full Text: DOI OpenURL
Du, Gang; Liang, Xi; Ouyang, Xiaoling; Wang, Chunming Risk prediction of hypertension complications based on the intelligent algorithm optimized Bayesian network. (English) Zbl 1482.90229 J. Comb. Optim. 42, No. 4, 966-987 (2021). MSC: 90C35 90C59 90C90 PDF BibTeX XML Cite \textit{G. Du} et al., J. Comb. Optim. 42, No. 4, 966--987 (2021; Zbl 1482.90229) Full Text: DOI OpenURL
Wang, Zhiguo; Huang, Lufei; He, Cici Xiao A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design. (English) Zbl 1482.90205 J. Comb. Optim. 42, No. 4, 785-812 (2021). MSC: 90C29 90C35 90C90 PDF BibTeX XML Cite \textit{Z. Wang} et al., J. Comb. Optim. 42, No. 4, 785--812 (2021; Zbl 1482.90205) Full Text: DOI OpenURL
Chudnovsky, Maria; Seymour, Paul Subdivided claws and the clique-stable set separation property. (English) Zbl 1484.05164 Wood, David R. (ed.) et al., 2019–20 MATRIX annals. Cham: Springer. MATRIX Book Ser. 4, 483-487 (2021). MSC: 05C70 05C69 05C75 90C35 PDF BibTeX XML Cite \textit{M. Chudnovsky} and \textit{P. Seymour}, MATRIX Book Ser. 4, 483--487 (2021; Zbl 1484.05164) Full Text: DOI arXiv OpenURL
Chang, Kung-Ching; Shao, Sihong; Zhang, Dong; Zhang, Weixi Lovász extension and graph cut. (English) Zbl 07440981 Commun. Math. Sci. 19, No. 3, 761-786 (2021). Reviewer: Roman Čada (Plzeň) MSC: 90C35 05C85 58E05 90C27 PDF BibTeX XML Cite \textit{K.-C. Chang} et al., Commun. Math. Sci. 19, No. 3, 761--786 (2021; Zbl 07440981) Full Text: DOI arXiv OpenURL
Bodirsky, Manuel; Mamino, Marcello; Viola, Caterina Piecewise linear valued constraint satisfaction problems with fixed number of variables. (English) Zbl 1481.90270 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, 265-276 (2021). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{M. Bodirsky} et al., AIRO Springer Ser. 5, 265--276 (2021; Zbl 1481.90270) Full Text: DOI arXiv OpenURL
Barbato, Michele; Ceselli, Alberto; Facchinetti, Nicolas Synchronized pickup and delivery problems with connecting FIFO stack. (English) Zbl 1479.90023 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, 237-249 (2021). MSC: 90B06 90B10 90B15 90C27 90C35 PDF BibTeX XML Cite \textit{M. Barbato} et al., AIRO Springer Ser. 5, 237--249 (2021; Zbl 1479.90023) Full Text: DOI OpenURL
Bacci, Tiziano; Nicoloso, Sara On the benchmark instances for the bin packing problem with conflicts. (English) Zbl 1481.90269 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, 171-179 (2021). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{T. Bacci} and \textit{S. Nicoloso}, AIRO Springer Ser. 5, 171--179 (2021; Zbl 1481.90269) Full Text: DOI arXiv OpenURL
Boeckmann, Jan; Thielen, Clemens An approximation algorithm for network flow interdiction with unit costs and two capacities. (English) Zbl 1479.90043 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, 157-169 (2021). MSC: 90B10 90C35 68W25 PDF BibTeX XML Cite \textit{J. Boeckmann} and \textit{C. Thielen}, AIRO Springer Ser. 5, 157--169 (2021; Zbl 1479.90043) Full Text: DOI OpenURL
Samer, Phillippe; Haugland, Dag The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope. (English) Zbl 1481.90279 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, 107-116 (2021). MSC: 90C27 90C10 05C90 90C35 PDF BibTeX XML Cite \textit{P. Samer} and \textit{D. Haugland}, AIRO Springer Ser. 5, 107--116 (2021; Zbl 1481.90279) Full Text: DOI OpenURL
Liberti, Leo; Iommazzo, Gabriele; Lavor, Carlile; Maculan, Nelson A cycle-based formulation for the distance geometry problem. (English) Zbl 1481.90305 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, 93-106 (2021). MSC: 90C35 05C90 90B10 90B15 90C27 PDF BibTeX XML Cite \textit{L. Liberti} et al., AIRO Springer Ser. 5, 93--106 (2021; Zbl 1481.90305) Full Text: DOI OpenURL
Díaz, Josep; Diner, Öznur Yaşar; Serna, Maria; Serra, Oriol On list \(k\)-coloring convex bipartite graphs. (English) Zbl 1479.05100 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, 15-26 (2021). MSC: 05C15 05C70 05C85 05C90 90B10 90B15 90C27 90C35 PDF BibTeX XML Cite \textit{J. Díaz} et al., AIRO Springer Ser. 5, 15--26 (2021; Zbl 1479.05100) Full Text: DOI arXiv OpenURL
Hochstättler, Winfried; Wiehe, Johanna The chromatic polynomial of a digraph. (English) Zbl 1479.05163 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, 1-14 (2021). MSC: 05C31 05C15 05C85 05C90 90B10 90B15 90C27 90C35 PDF BibTeX XML Cite \textit{W. Hochstättler} and \textit{J. Wiehe}, AIRO Springer Ser. 5, 1--14 (2021; Zbl 1479.05163) Full Text: DOI arXiv OpenURL
Hasanzadeh, Mehran; Alizadeh, Behrooz; Afrashteh, Esmaeil; Baroughi, Fahimeh Optimal algorithms for inverse eccentric vertex location problem on extended star networks. (English) Zbl 1478.90020 Asia-Pac. J. Oper. Res. 38, No. 4, Article ID 2150001, 19 p. (2021). MSC: 90B10 90C27 90C35 90B80 90C60 PDF BibTeX XML Cite \textit{M. Hasanzadeh} et al., Asia-Pac. J. Oper. Res. 38, No. 4, Article ID 2150001, 19 p. (2021; Zbl 1478.90020) Full Text: DOI OpenURL
Zhang, Bo; Peng, Jin; Li, Shengguo Minimax models for capacitated \(p\)-center problem in uncertain environment. (English) Zbl 1478.90055 Fuzzy Optim. Decis. Mak. 20, No. 3, 273-292 (2021). MSC: 90B80 90C35 90B06 PDF BibTeX XML Cite \textit{B. Zhang} et al., Fuzzy Optim. Decis. Mak. 20, No. 3, 273--292 (2021; Zbl 1478.90055) Full Text: DOI OpenURL