Chaudhuri, Arindam Fuzzy machine learning. Advanced approaches to solve optimization problems (to appear). (English) Zbl 07166042 Berlin: De Gruyter (ISBN 978-3-11-060358-3/hbk). 150 p. (2022). MSC: 90-02 68-02 68T05 68T07 90B06 90B50 90C27 90C59 90C70 PDF BibTeX XML Cite \textit{A. Chaudhuri}, Fuzzy machine learning. Advanced approaches to solve optimization problems (to appear). Berlin: De Gruyter (2022; Zbl 07166042)
Vitor, Fabio; Easton, Todd Approximate and exact merging of knapsack constraints with cover inequalities. (English) Zbl 07313474 Optimization 70, No. 2, 437-460 (2021). MSC: 90C10 90C27 90C39 90C57 PDF BibTeX XML Cite \textit{F. Vitor} and \textit{T. Easton}, Optimization 70, No. 2, 437--460 (2021; Zbl 07313474) Full Text: DOI
Borgwardt, Steffen; Viss, Charles Constructing clustering transformations. (English) Zbl 07310604 SIAM J. Discrete Math. 35, No. 1, 152-178 (2021). MSC: 90C05 52B05 90C08 90C27 PDF BibTeX XML Cite \textit{S. Borgwardt} and \textit{C. Viss}, SIAM J. Discrete Math. 35, No. 1, 152--178 (2021; Zbl 07310604) Full Text: DOI
Allen-Zhu, Zeyuan; Li, Yuanzhi; Singh, Aarti; Wang, Yining Near-optimal discrete optimization for experimental design: a regret minimization approach. (English) Zbl 07310586 Math. Program. 186, No. 1-2 (A), 439-478 (2021). MSC: 90C27 62K05 PDF BibTeX XML Cite \textit{Z. Allen-Zhu} et al., Math. Program. 186, No. 1--2 (A), 439--478 (2021; Zbl 07310586) Full Text: DOI
Schmidt, Daniel; Zey, Bernd; Margot, François Stronger MIP formulations for the Steiner forest problem. (English) Zbl 07310584 Math. Program. 186, No. 1-2 (A), 373-407 (2021). MSC: 90C27 90C57 90B10 PDF BibTeX XML Cite \textit{D. Schmidt} et al., Math. Program. 186, No. 1--2 (A), 373--407 (2021; Zbl 07310584) Full Text: DOI
Boyd, Sylvia; Sebő, András The salesman’s improved tours for fundamental classes. (English) Zbl 07310581 Math. Program. 186, No. 1-2 (A), 289-307 (2021). MSC: 90C27 05C85 PDF BibTeX XML Cite \textit{S. Boyd} and \textit{A. Sebő}, Math. Program. 186, No. 1--2 (A), 289--307 (2021; Zbl 07310581) Full Text: DOI
Chandrasekaran, Karthekeyan; Xu, Chao; Yu, Xilin Hypergraph \(k\)-cut in randomized polynomial time. (English) Zbl 07310575 Math. Program. 186, No. 1-2 (A), 85-113 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{K. Chandrasekaran} et al., Math. Program. 186, No. 1--2 (A), 85--113 (2021; Zbl 07310575) Full Text: DOI
Nguyen, Danny; Pak, Igor On the number of integer points in translated and expanded polyhedra. (English) Zbl 07308721 Discrete Comput. Geom. 65, No. 2, 405-424 (2021). MSC: 11D 05E 52C 52B 05A 52C07 11D07 05E40 05A15 52B20 PDF BibTeX XML Cite \textit{D. Nguyen} and \textit{I. Pak}, Discrete Comput. Geom. 65, No. 2, 405--424 (2021; Zbl 07308721) Full Text: DOI
Iwata, Satoru; Kobayashi, Yusuke A weighted linear matroid parity algorithm. (English) Zbl 07307636 SIAM J. Comput. 50, STOC17-238-STOC17-280 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{S. Iwata} and \textit{Y. Kobayashi}, SIAM J. Comput. 50, STOC17--238-STOC17--280 (2021; Zbl 07307636) Full Text: DOI
Ceselli, Alberto; Felipe, Ángel; Ortuño, M. Teresa; Righini, Giovanni; Tirado, Gregorio A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies. (English) Zbl 07307578 SN Oper. Res. Forum 2, No. 1, Paper No. 8, 34 p. (2021). MSC: 90B06 90C27 90C57 PDF BibTeX XML Cite \textit{A. Ceselli} et al., SN Oper. Res. Forum 2, No. 1, Paper No. 8, 34 p. (2021; Zbl 07307578) Full Text: DOI
Ben Ticha, Hamza; Absi, Nabil; Feillet, Dominique; Quilliot, Alain; Van Woensel, Tom The time-dependent vehicle routing problem with time windows and road-network information. (English) Zbl 07307574 SN Oper. Res. Forum 2, No. 1, Paper No. 4, 26 p. (2021). MSC: 90B06 90C27 90C57 PDF BibTeX XML Cite \textit{H. Ben Ticha} et al., SN Oper. Res. Forum 2, No. 1, Paper No. 4, 26 p. (2021; Zbl 07307574) Full Text: DOI
Kumar, Arvind Lovász-Saks-Schrijver ideals and parity binomial edge ideals of graphs. (English) Zbl 07307286 Eur. J. Comb. 93, Article ID 103274, 20 p. (2021). MSC: 05E40 05C25 13P25 PDF BibTeX XML Cite \textit{A. Kumar}, Eur. J. Comb. 93, Article ID 103274, 20 p. (2021; Zbl 07307286) Full Text: DOI
Frieze, Alan; Pegden, Wesley; Sorkin, Gregory B.; Tkocz, Tomasz Minimum-weight combinatorial structures under random cost-constraints. (English) Zbl 07303543 Electron. J. Comb. 28, No. 1, Research Paper P1.20, 18 p. (2021). MSC: 05C80 05C85 90C27 PDF BibTeX XML Cite \textit{A. Frieze} et al., Electron. J. Comb. 28, No. 1, Research Paper P1.20, 18 p. (2021; Zbl 07303543) Full Text: DOI
Letchford, Adam N.; Vu, Anh N. Facets from gadgets. (English) Zbl 07300741 Math. Program. 185, No. 1-2 (A), 297-314 (2021). MSC: 90C57 90C27 PDF BibTeX XML Cite \textit{A. N. Letchford} and \textit{A. N. Vu}, Math. Program. 185, No. 1--2 (A), 297--314 (2021; Zbl 07300741) Full Text: DOI
Szeszlér, Dávid New polyhedral and algorithmic results on greedoids. (English) Zbl 07300740 Math. Program. 185, No. 1-2 (A), 275-296 (2021). MSC: 90C27 91A80 PDF BibTeX XML Cite \textit{D. Szeszlér}, Math. Program. 185, No. 1--2 (A), 275--296 (2021; Zbl 07300740) Full Text: DOI
Haddadan, Arash; Newman, Alantha; Ravi, R. Shorter tours and longer detours: uniform covers and a bit beyond. (English) Zbl 07300739 Math. Program. 185, No. 1-2 (A), 245-273 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{A. Haddadan} et al., Math. Program. 185, No. 1--2 (A), 245--273 (2021; Zbl 07300739) Full Text: DOI
Gnacik, Michał; Guzik, Marcin; Kania, Tomasz Approximate modularity: Kalton’s constant is not smaller than 3. (English) Zbl 07299108 Proc. Am. Math. Soc. 149, No. 2, 661-669 (2021). MSC: 28A60 39B82 90C27 94C10 PDF BibTeX XML Cite \textit{M. Gnacik} et al., Proc. Am. Math. Soc. 149, No. 2, 661--669 (2021; Zbl 07299108) Full Text: DOI
Magnouche, Y.; Mahjoub, A. R.; Martin, S. The multi-terminal vertex separator problem: branch-and-cut-and-price. (English) Zbl 07293746 Discrete Appl. Math. 290, 86-111 (2021). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{Y. Magnouche} et al., Discrete Appl. Math. 290, 86--111 (2021; Zbl 07293746) Full Text: DOI
Abdi, Ahmad; Cornuéjols, Gérard The max-flow min-cut property and \(\pm 1\)-resistant sets. (English) Zbl 07289404 Discrete Appl. Math. 289, 455-476 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{A. Abdi} and \textit{G. Cornuéjols}, Discrete Appl. Math. 289, 455--476 (2021; Zbl 07289404) Full Text: DOI
Lin, Chang-Chun; Chiang, Yen-I Alternative formulations for the obnoxious \(p\)-median problem. (English) Zbl 07289397 Discrete Appl. Math. 289, 366-373 (2021). MSC: 90B80 90C27 90C09 PDF BibTeX XML Cite \textit{C.-C. Lin} and \textit{Y.-I Chiang}, Discrete Appl. Math. 289, 366--373 (2021; Zbl 07289397) Full Text: DOI
Gao, Hui; Yang, Daqing Packing of maximal independent mixed arborescences. (English) Zbl 07289392 Discrete Appl. Math. 289, 313-319 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{H. Gao} and \textit{D. Yang}, Discrete Appl. Math. 289, 313--319 (2021; Zbl 07289392) Full Text: DOI
van Ee, Martijn Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem. (English) Zbl 07289383 Discrete Appl. Math. 289, 219-229 (2021). MSC: 90B22 90B80 68W25 90C27 90C35 PDF BibTeX XML Cite \textit{M. van Ee}, Discrete Appl. Math. 289, 219--229 (2021; Zbl 07289383) Full Text: DOI
Zhang, Peng; Liu, Zhendong Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph. (English) Zbl 07285603 Theor. Comput. Sci. 849, 173-183 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{P. Zhang} and \textit{Z. Liu}, Theor. Comput. Sci. 849, 173--183 (2021; Zbl 07285603) Full Text: DOI
Heßler, Katrin; Irnich, Stefan A branch-and-cut algorithm for the soft-clustered vehicle-routing problem. (English) Zbl 1452.90267 Discrete Appl. Math. 288, 218-234 (2021). MSC: 90C27 90B06 90C57 PDF BibTeX XML Cite \textit{K. Heßler} and \textit{S. Irnich}, Discrete Appl. Math. 288, 218--234 (2021; Zbl 1452.90267) Full Text: DOI
Bianchessi, Nicola; Irnich, Stefan; Tilk, Christian A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. (English) Zbl 1452.90057 Discrete Appl. Math. 288, 152-170 (2021). MSC: 90B06 90C57 90C39 90C27 PDF BibTeX XML Cite \textit{N. Bianchessi} et al., Discrete Appl. Math. 288, 152--170 (2021; Zbl 1452.90057) Full Text: DOI
Hrga, Timotej; Lužar, Borut; Povh, Janez; Wiegele, Angelika BiqBin: moving boundaries for NP-hard problems by HPC. (English) Zbl 1440.90061 Dimov, Ivan (ed.) et al., Advances in high performance computing. Results of the international conference on high performance computing, Borovets, Bulgaria, September 2–6, 2019. Cham: Springer. Stud. Comput. Intell. 902, 327-339 (2021). MSC: 90C27 65K05 65Y10 68Q17 90C57 PDF BibTeX XML Cite \textit{T. Hrga} et al., Stud. Comput. Intell. 902, 327--339 (2021; Zbl 1440.90061) Full Text: DOI
Chentsov, Aleksandr Georgievich; Chentsov, Pavel Aleksandrovich To the question of optimization of the starting point in the routing problem with restrictions. (Russian. English summary) Zbl 07312117 Izv. Inst. Mat. Inform., Udmurt. Gos. Univ. 55, 135-154 (2020). MSC: 90B06 90C27 90C39 PDF BibTeX XML Cite \textit{A. G. Chentsov} and \textit{P. A. Chentsov}, Izv. Inst. Mat. Inform., Udmurt. Gos. Univ. 55, 135--154 (2020; Zbl 07312117) Full Text: DOI MNR
Monabbati, S. E.; Torabi, H. Mathematical modeling of finite topologies. (English) Zbl 07311928 Carpathian Math. Publ. 12, No. 2, 434-442 (2020). MSC: 90C 54A99 90C10 90C27 PDF BibTeX XML Cite \textit{S. E. Monabbati} and \textit{H. Torabi}, Carpathian Math. Publ. 12, No. 2, 434--442 (2020; Zbl 07311928) Full Text: DOI
Khashyarmanesh, Kazem; Nasernejad, Mehrdad On the minimal path cover sets of union of certain graphs. (English) Zbl 07311169 Quaest. Math. 43, No. 7, 881-901 (2020). MSC: 05C05 05C38 05E40 13P25 PDF BibTeX XML Cite \textit{K. Khashyarmanesh} and \textit{M. Nasernejad}, Quaest. Math. 43, No. 7, 881--901 (2020; Zbl 07311169) Full Text: DOI
Furue, Hiroki; Hirai, Hiroshi On a weighted linear matroid intersection algorithm by Deg-Det computation. (English) Zbl 07309986 Japan J. Ind. Appl. Math. 37, No. 3, 677-696 (2020). MSC: 68W40 PDF BibTeX XML Cite \textit{H. Furue} and \textit{H. Hirai}, Japan J. Ind. Appl. Math. 37, No. 3, 677--696 (2020; Zbl 07309986) Full Text: DOI
Sepasian, Ali Reza; Tayyebi, Javad Further study on reverse 1-center problem on trees. (English) Zbl 07309394 Asia-Pac. J. Oper. Res. 37, No. 6, Article ID 2050034, 18 p. (2020). MSC: 90B10 90B80 90C27 90C59 PDF BibTeX XML Cite \textit{A. R. Sepasian} and \textit{J. Tayyebi}, Asia-Pac. J. Oper. Res. 37, No. 6, Article ID 2050034, 18 p. (2020; Zbl 07309394) Full Text: DOI
Xie, Fanrong; Li, Zuoan An iterative solution technique to minimize the average transportation cost of capacitated transportation problem with bounds on rim conditions. (English) Zbl 07309386 Asia-Pac. J. Oper. Res. 37, No. 5, Article ID 2050024, 33 p. (2020). MSC: 90B06 90B10 90C27 PDF BibTeX XML Cite \textit{F. Xie} and \textit{Z. Li}, Asia-Pac. J. Oper. Res. 37, No. 5, Article ID 2050024, 33 p. (2020; Zbl 07309386) Full Text: DOI
Munari, Pedro; Savelsbergh, Martin A column generation-based heuristic for the split delivery vehicle routing problem with time windows. (English) Zbl 07307559 SN Oper. Res. Forum 1, No. 4, Paper No. 26, 25 p. (2020). MSC: 90B06 90C27 90C59 PDF BibTeX XML Cite \textit{P. Munari} and \textit{M. Savelsbergh}, SN Oper. Res. Forum 1, No. 4, Paper No. 26, 25 p. (2020; Zbl 07307559) Full Text: DOI
Shang, Ke; Chan, Felix T. S.; Karungaru, Stephen; Terada, Kenji; Feng, Zuren; Ke, Liangjun Two-stage robust optimization for the orienteering problem with stochastic weights. (English) Zbl 07306798 Complexity 2020, Article ID 5649821, 15 p. (2020). MSC: 90C27 90B06 90C15 PDF BibTeX XML Cite \textit{K. Shang} et al., Complexity 2020, Article ID 5649821, 15 p. (2020; Zbl 07306798) Full Text: DOI
Messaoudi, Mayssoun; El Hallaoui, Issmail; Rousseau, Louis-Martin; Tahir, Adil Solving a real-world multi-attribute VRP using a primal-based approach. (English) Zbl 07306401 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 286-296 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{M. Messaoudi} et al., Lect. Notes Comput. Sci. 12176, 286--296 (2020; Zbl 07306401) Full Text: DOI
Diniz, Pedro; Martinelli, Rafael; Poggi, Marcus An efficient matheuristic for the inventory routing problem. (English) Zbl 07306400 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 273-285 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{P. Diniz} et al., Lect. Notes Comput. Sci. 12176, 273--285 (2020; Zbl 07306400) Full Text: DOI
Cerulli, Raffaele; D’Ambrosio, Ciriaco; Raiconi, Andrea; Vitale, Gaetano The knapsack problem with forfeits. (English) Zbl 07306399 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 263-272 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{R. Cerulli} et al., Lect. Notes Comput. Sci. 12176, 263--272 (2020; Zbl 07306399) Full Text: DOI
Wojciechowski, P.; Williamson, Matthew; Subramani, K. On finding shortest paths in arc-dependent networks. (English) Zbl 07306398 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 249-260 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{P. Wojciechowski} et al., Lect. Notes Comput. Sci. 12176, 249--260 (2020; Zbl 07306398) Full Text: DOI
Masumura, Yuya; Oki, Taihei; Yamaguchi, Yutaro Dynamic programming approach to the generalized minimum Manhattan network problem. (English) Zbl 07306397 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 237-248 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{Y. Masumura} et al., Lect. Notes Comput. Sci. 12176, 237--248 (2020; Zbl 07306397) Full Text: DOI
Frangioni, Antonio; Gendron, Bernard; Gorgone, Enrico Quasi-separable Dantzig-Wolfe reformulations for network design. (English) Zbl 07306396 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 227-236 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{A. Frangioni} et al., Lect. Notes Comput. Sci. 12176, 227--236 (2020; Zbl 07306396) Full Text: DOI
Takazawa, Kenjiro Notes on equitable partitions into matching forests in mixed graphs and \(b\)-branchings in digraphs. (English) Zbl 07306395 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 214-224 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{K. Takazawa}, Lect. Notes Comput. Sci. 12176, 214--224 (2020; Zbl 07306395) Full Text: DOI
Madarasi, Péter The distance matching problem. (English) Zbl 07306394 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 202-213 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{P. Madarasi}, Lect. Notes Comput. Sci. 12176, 202--213 (2020; Zbl 07306394) Full Text: DOI
Homsi, Gabriel; Gendron, Bernard; Jena, Sanjay Dominik Dynamic and stochastic rematching for ridesharing systems: formulations and reductions. (English) Zbl 07306393 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 193-201 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{G. Homsi} et al., Lect. Notes Comput. Sci. 12176, 193--201 (2020; Zbl 07306393) Full Text: DOI
Trindade, Renan Spencer; de Araújo, Olinto C. B.; Fampa, Marcia Arc-flow approach for parallel batch processing machine scheduling with non-identical job sizes. (English) Zbl 07306392 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 179-190 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{R. S. Trindade} et al., Lect. Notes Comput. Sci. 12176, 179--190 (2020; Zbl 07306392) Full Text: DOI
Bérczi, Kristóf; Király, Tamás; Omlor, Simon Scheduling with non-renewable resources: minimizing the sum of completion times. (English) Zbl 07306391 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 167-178 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{K. Bérczi} et al., Lect. Notes Comput. Sci. 12176, 167--178 (2020; Zbl 07306391) Full Text: DOI
Bendotti, Pascale; Chrétienne, Philippe; Fouilhoux, Pierre; Pass-Lanneau, Adèle Anchored rescheduling problems under generalized precedence constraints. (English) Zbl 07306390 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 156-166 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{P. Bendotti} et al., Lect. Notes Comput. Sci. 12176, 156--166 (2020; Zbl 07306390) Full Text: DOI
Aba, Massinissa Ait; Zaourar, Lilia; Munier, Alix Polynomial scheduling algorithm for parallel applications on hybrid platforms. (English) Zbl 07306389 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 143-155 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{M. A. Aba} et al., Lect. Notes Comput. Sci. 12176, 143--155 (2020; Zbl 07306389) Full Text: DOI
Miyazawa, Flávio K.; Moura, Phablo F. S.; Ota, Matheus J.; Wakabayashi, Yoshiko Cut and flow formulations for the balanced connected \(k\)-partition problem. (English) Zbl 07306388 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 128-139 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{F. K. Miyazawa} et al., Lect. Notes Comput. Sci. 12176, 128--139 (2020; Zbl 07306388) Full Text: DOI
Lee, Jon; Paat, Joseph; Stallknecht, Ingo; Xu, Luze Improving proximity bounds using sparsity. (English) Zbl 07306387 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 115-127 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{J. Lee} et al., Lect. Notes Comput. Sci. 12176, 115--127 (2020; Zbl 07306387) Full Text: DOI
D’Ambrosio, Claudia; Lee, Jon; Skipper, Daphne; Thomopulos, Dimitri Handling separable non-convexities using disjunctive cuts. (English) Zbl 07306386 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 102-114 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{C. D'Ambrosio} et al., Lect. Notes Comput. Sci. 12176, 102--114 (2020; Zbl 07306386) Full Text: DOI
Bökler, Fritz; Chimani, Markus; Wagner, Mirko H.; Wiedera, Tilo An experimental study of ILP formulations for the longest induced path problem. (English) Zbl 07306385 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 89-101 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{F. Bökler} et al., Lect. Notes Comput. Sci. 12176, 89--101 (2020; Zbl 07306385) Full Text: DOI
Aissi, Hassene; Mahjoub, A. Ridha On the linear relaxation of the \(s-t\)-cut problem with budget constraints. (English) Zbl 07306384 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 81-88 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{H. Aissi} and \textit{A. R. Mahjoub}, Lect. Notes Comput. Sci. 12176, 81--88 (2020; Zbl 07306384) Full Text: DOI
Taktak, Raouia; Uchoa, Eduardo On the multiple Steiner traveling salesman problem with order constraints. (English) Zbl 07306383 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 66-77 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{R. Taktak} and \textit{E. Uchoa}, Lect. Notes Comput. Sci. 12176, 66--77 (2020; Zbl 07306383) Full Text: DOI
Chen, Rui; Dash, Sanjeeb; Günlük, Oktay Cardinality constrained multilinear sets. (English) Zbl 07306382 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 54-65 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{R. Chen} et al., Lect. Notes Comput. Sci. 12176, 54--65 (2020; Zbl 07306382) Full Text: DOI
Soraya, Chaghoub; Diarrassouba, Ibrahima A polyhedral study for the buy-at-bulk facility location problem. (English) Zbl 07306381 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 42-53 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{C. Soraya} and \textit{I. Diarrassouba}, Lect. Notes Comput. Sci. 12176, 42--53 (2020; Zbl 07306381) Full Text: DOI
Barbato, Michele; Grappe, Roland; Lacroix, Mathieu; Lancini, Emiliano On \(k\)-edge-connected polyhedra: box-TDIness in series-parallel graphs. (English) Zbl 07306380 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 27-41 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{M. Barbato} et al., Lect. Notes Comput. Sci. 12176, 27--41 (2020; Zbl 07306380) Full Text: DOI
Baïou, Mourad; Barahona, Francisco On the \(p\)-median polytope and the directed odd cycle inequalities. (English) Zbl 07306379 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 15-26 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{M. Baïou} and \textit{F. Barahona}, Lect. Notes Comput. Sci. 12176, 15--26 (2020; Zbl 07306379) Full Text: DOI
Argiroffo, Gabriela; Bianchi, Silvia; Lucarini, Yanina; Wagler, Annegret Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs. (English) Zbl 07306378 Baïou, Mourad (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). Lecture Notes in Computer Science 12176, 3-14 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{G. Argiroffo} et al., Lect. Notes Comput. Sci. 12176, 3--14 (2020; Zbl 07306378) Full Text: DOI
Adasme, Pablo; Dehghan Firoozabadi, Ali Degree-constrained \(k\)-minimum spanning tree problem. (English) Zbl 07304968 Complexity 2020, Article ID 7628105, 25 p. (2020). MSC: 90C35 90C27 90C59 05C05 05C85 PDF BibTeX XML Cite \textit{P. Adasme} and \textit{A. Dehghan Firoozabadi}, Complexity 2020, Article ID 7628105, 25 p. (2020; Zbl 07304968) Full Text: DOI
Maxim, Laurentiu G.; Rodriguez, Jose Israel; Wang, Botong Defect of Euclidean distance degree. (English) Zbl 07304609 Adv. Appl. Math. 121, Article ID 102101, 22 p. (2020). MSC: 14Q15 14C17 14N10 13P25 32S30 57R20 90C26 PDF BibTeX XML Cite \textit{L. G. Maxim} et al., Adv. Appl. Math. 121, Article ID 102101, 22 p. (2020; Zbl 07304609) Full Text: DOI
Li, Yue; Tang, Rui-Yun; MuRong, Li-Wen; Sun, Qian Collaborative optimization of dock door assignment and vehicle scheduling in cross-docking. (English) Zbl 07303144 J. Oper. Res. Soc. China 8, No. 3, 493-514 (2020). MSC: 90B06 PDF BibTeX XML Cite \textit{Y. Li} et al., J. Oper. Res. Soc. China 8, No. 3, 493--514 (2020; Zbl 07303144) Full Text: DOI
Bi, Shujun; Pan, Shaohua; Sun, Defeng A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery. (English) Zbl 1452.90258 Math. Program. Comput. 12, No. 4, 569-602 (2020). MSC: 90C27 90C33 49M20 PDF BibTeX XML Cite \textit{S. Bi} et al., Math. Program. Comput. 12, No. 4, 569--602 (2020; Zbl 1452.90258) Full Text: DOI
Salemi, Hosseinali; Buchanan, Austin Parsimonious formulations for low-diameter clusters. (English) Zbl 1452.90083 Math. Program. Comput. 12, No. 3, 493-528 (2020). MSC: 90B10 90C10 90C27 90C35 05C12 05C69 05C85 91D30 PDF BibTeX XML Cite \textit{H. Salemi} and \textit{A. Buchanan}, Math. Program. Comput. 12, No. 3, 493--528 (2020; Zbl 1452.90083) Full Text: DOI
Medrano, F. Antonio The complete vertex \(p\)-center problem. (English) Zbl 1452.90224 EURO J. Comput. Optim. 8, No. 3-4, 327-343 (2020). MSC: 90C10 90C11 90C27 90C90 PDF BibTeX XML Cite \textit{F. A. Medrano}, EURO J. Comput. Optim. 8, No. 3--4, 327--343 (2020; Zbl 1452.90224) Full Text: DOI
Recalde, Diego; Torres, Ramiro; Vaca, Polo An exact approach for the multi-constraint graph partitioning problem. (English) Zbl 1452.90225 EURO J. Comput. Optim. 8, No. 3-4, 289-308 (2020). MSC: 90C10 90C27 90C57 05C70 PDF BibTeX XML Cite \textit{D. Recalde} et al., EURO J. Comput. Optim. 8, No. 3--4, 289--308 (2020; Zbl 1452.90225) Full Text: DOI
Lozano, Leonardo; Bergman, David; Smith, J. Cole On the consistent path problem. (English) Zbl 07298157 Oper. Res. 68, No. 6, 1913-1931 (2020). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{L. Lozano} et al., Oper. Res. 68, No. 6, 1913--1931 (2020; Zbl 07298157) Full Text: DOI
Walteros, Jose L.; Buchanan, Austin Why is maximum clique often easy in practice? (English) Zbl 07298155 Oper. Res. 68, No. 6, 1866-1895 (2020). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{J. L. Walteros} and \textit{A. Buchanan}, Oper. Res. 68, No. 6, 1866--1895 (2020; Zbl 07298155) Full Text: DOI
Ma, Will; Simchi-Levi, David Algorithms for online matching, assortment, and pricing with tight weight-dependent competitive ratios. (English) Zbl 07298150 Oper. Res. 68, No. 6, 1787-1803 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{W. Ma} and \textit{D. Simchi-Levi}, Oper. Res. 68, No. 6, 1787--1803 (2020; Zbl 07298150) Full Text: DOI
Modaresi, Sajad; Sauré, Denis; Vielma, Juan Pablo Learning in combinatorial optimization: what and how to explore. (English) Zbl 07298137 Oper. Res. 68, No. 5, 1585-1604 (2020). MSC: 90C27 90C11 90C90 PDF BibTeX XML Cite \textit{S. Modaresi} et al., Oper. Res. 68, No. 5, 1585--1604 (2020; Zbl 07298137) Full Text: DOI
Hazimeh, Hussein; Mazumder, Rahul Fast best subset selection: coordinate descent and local combinatorial optimization algorithms. (English) Zbl 07298132 Oper. Res. 68, No. 5, 1517-1537 (2020). MSC: 90C30 90C27 90C11 PDF BibTeX XML Cite \textit{H. Hazimeh} and \textit{R. Mazumder}, Oper. Res. 68, No. 5, 1517--1537 (2020; Zbl 07298132) Full Text: DOI
Gupta, Varun; Radovanović, Ana Interior-point-based online stochastic bin packing. (English) Zbl 07298130 Oper. Res. 68, No. 5, 1474-1492 (2020). MSC: 90C27 90C15 90C51 PDF BibTeX XML Cite \textit{V. Gupta} and \textit{A. Radovanović}, Oper. Res. 68, No. 5, 1474--1492 (2020; Zbl 07298130) Full Text: DOI
Ma, Shiqian; Wang, Fei; Wei, Linchuan; Wolkowicz, Henry Robust principal component analysis using facial reduction. (English) Zbl 1452.90252 Optim. Eng. 21, No. 3, 1195-1219 (2020). MSC: 90C26 65K10 90C27 PDF BibTeX XML Cite \textit{S. Ma} et al., Optim. Eng. 21, No. 3, 1195--1219 (2020; Zbl 1452.90252) Full Text: DOI
Xu, Yicheng; Möhring, Rolf H.; Xu, Dachuan; Zhang, Yong; Zou, Yifei A constant FPT approximation algorithm for hard-capacitated \(k\)-means. (English) Zbl 07297578 Optim. Eng. 21, No. 3, 709-722 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{Y. Xu} et al., Optim. Eng. 21, No. 3, 709--722 (2020; Zbl 07297578) Full Text: DOI
Yang, Ruiqi; Xu, Dachuan; Du, Donglei; Zhang, Dongmei A survey on streaming algorithms for maximizing submodular functions. (Chinese. English summary) Zbl 07296150 Oper. Res. Trans. 24, No. 2, 73-86 (2020). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{R. Yang} et al., Oper. Res. Trans. 24, No. 2, 73--86 (2020; Zbl 07296150) Full Text: DOI
Chen, Rubing; Yuan, Jinjiang Single-machine scheduling to minimize total weighted late work with positional due-indices. (English) Zbl 07296145 Oper. Res. Trans. 24, No. 2, 131-144 (2020). MSC: 90B35 90C27 PDF BibTeX XML Cite \textit{R. Chen} and \textit{J. Yuan}, Oper. Res. Trans. 24, No. 2, 131--144 (2020; Zbl 07296145) Full Text: DOI
Zhang, Yuzhong A survey on job scheduling with rejection. (Chinese. English summary) Zbl 07296144 Oper. Res. Trans. 24, No. 2, 111-130 (2020). MSC: 90B35 90C27 90C59 PDF BibTeX XML Cite \textit{Y. Zhang}, Oper. Res. Trans. 24, No. 2, 111--130 (2020; Zbl 07296144) Full Text: DOI
Ma, Long; Kou, Meng; Zhang, Jing; Wang, Chunxi Solving nonlinear 0-1 programming problems by cellular gray wolf optimization algorithm. (English) Zbl 07296034 Math. Pract. Theory 50, No. 12, 155-167 (2020). MSC: 90C30 90C10 90C59 PDF BibTeX XML Cite \textit{L. Ma} et al., Math. Pract. Theory 50, No. 12, 155--167 (2020; Zbl 07296034)
Ren, Jingmin; Pan, Dazhi Core accelerated firefly algorithm for solving bounded knapsack problem. (English) Zbl 07296022 Math. Pract. Theory 50, No. 11, 172-182 (2020). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{J. Ren} and \textit{D. Pan}, Math. Pract. Theory 50, No. 11, 172--182 (2020; Zbl 07296022)
Wang, Chenglin; Zheng, Ying; Huangfu, Yilong; Hao, Hongtao Study on optimization problem for location-routing of fresh logistics distribution network. (Chinese. English summary) Zbl 07296018 Math. Pract. Theory 50, No. 10, 33-43 (2020). MSC: 90B06 90B80 90C35 90C59 90C27 90C29 PDF BibTeX XML Cite \textit{C. Wang} et al., Math. Pract. Theory 50, No. 10, 33--43 (2020; Zbl 07296018)
Wang, Suxin; Wen, Heng; Lu, Fuqiang; Liu, Haobo; Wang, Leizhen Modeling of 3D cargo loading problem and optimization of crow search algorithm. (Chinese. English summary) Zbl 07295351 J. Hunan Univ., Nat. Sci. 47, No. 8, 21-30 (2020). MSC: 90C27 90C59 PDF BibTeX XML Cite \textit{S. Wang} et al., J. Hunan Univ., Nat. Sci. 47, No. 8, 21--30 (2020; Zbl 07295351) Full Text: DOI
Liu, Sheng; Shen, Dayong; Shang, Xiuqin; Zhao, Hongxia; Dong, Xisong; Wang, Feiyue A multi-level tree search algorithm for three dimensional container loading problem. (Chinese. English summary) Zbl 07294807 Acta Autom. Sin. 46, No. 6, 1178-1187 (2020). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{S. Liu} et al., Acta Autom. Sin. 46, No. 6, 1178--1187 (2020; Zbl 07294807) Full Text: DOI
Alt, Helmut; de Berg, Mark; Knauer, Christian Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons. (English) Zbl 07293356 J. Comput. Geom. 11, No. 1, 653-655 (2020). MSC: 68U05 52B55 52C15 68W25 90C27 PDF BibTeX XML Cite \textit{H. Alt} et al., J. Comput. Geom. 11, No. 1, 653--655 (2020; Zbl 07293356) Full Text: Link
Hu, Jiang; Liu, Xin; Wen, Zai-Wen; Yuan, Ya-Xiang A brief introduction to manifold optimization. (English) Zbl 07292555 J. Oper. Res. Soc. China 8, No. 2, 199-248 (2020). MSC: 15A18 49Q99 65K05 90C22 90C26 90C27 90C30 PDF BibTeX XML Cite \textit{J. Hu} et al., J. Oper. Res. Soc. China 8, No. 2, 199--248 (2020; Zbl 07292555) Full Text: DOI
Huroyan, Vahan; Lerman, Gilad; Wu, Hau-Tieng Solving jigsaw puzzles by the graph connection Laplacian. (English) Zbl 1451.90111 SIAM J. Imaging Sci. 13, No. 4, 1717-1753 (2020). MSC: 90C20 90C27 90C35 90C90 PDF BibTeX XML Cite \textit{V. Huroyan} et al., SIAM J. Imaging Sci. 13, No. 4, 1717--1753 (2020; Zbl 1451.90111) Full Text: DOI
Singh, Mohit; Xie, Weijun Approximation algorithms for \(D\)-optimal design. (English) Zbl 07291326 Math. Oper. Res. 45, No. 4, 1512-1534 (2020). MSC: 62K05 90C27 68W25 PDF BibTeX XML Cite \textit{M. Singh} and \textit{W. Xie}, Math. Oper. Res. 45, No. 4, 1512--1534 (2020; Zbl 07291326) Full Text: DOI
Jansen, Klaus; Klein, Kim-Manuel About the structure of the integer cone and its application to bin packing. (English) Zbl 07291325 Math. Oper. Res. 45, No. 4, 1498-1511 (2020). MSC: 90C27 90C10 PDF BibTeX XML Cite \textit{K. Jansen} and \textit{K.-M. Klein}, Math. Oper. Res. 45, No. 4, 1498--1511 (2020; Zbl 07291325) Full Text: DOI
Cao, Junyu; Olvera-Cravioto, Mariana; Shen, Zuo-Jun (Max) Last-mile shared delivery: a discrete sequential packing approach. (English) Zbl 1451.90016 Math. Oper. Res. 45, No. 4, 1466-1497 (2020). MSC: 90B06 60C05 90C27 90C59 PDF BibTeX XML Cite \textit{J. Cao} et al., Math. Oper. Res. 45, No. 4, 1466--1497 (2020; Zbl 1451.90016) Full Text: DOI
Kolpakov, Roman M.; Posypkin, Mikhail A. Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method. (English. Russian original) Zbl 07291226 Discrete Math. Appl. 30, No. 5, 313-325 (2020); translation from Diskretn. Mat. 31, No. 4, 20-37 (2019). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{R. M. Kolpakov} and \textit{M. A. Posypkin}, Discrete Math. Appl. 30, No. 5, 313--325 (2020; Zbl 07291226); translation from Diskretn. Mat. 31, No. 4, 20--37 (2019) Full Text: DOI
Mahdavi Pajouh, Foad Minimum cost edge blocker clique problem. (English) Zbl 07290929 Ann. Oper. Res. 294, No. 1-2, 345-376 (2020). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{F. Mahdavi Pajouh}, Ann. Oper. Res. 294, No. 1--2, 345--376 (2020; Zbl 07290929) Full Text: DOI
Hu, Hao; Sotirov, Renata On solving the quadratic shortest path problem. (English) Zbl 1451.90018 INFORMS J. Comput. 32, No. 2, 219-233 (2020). MSC: 90B06 90B10 90C27 90C22 05C20 05C38 PDF BibTeX XML Cite \textit{H. Hu} and \textit{R. Sotirov}, INFORMS J. Comput. 32, No. 2, 219--233 (2020; Zbl 1451.90018) Full Text: DOI
Alfandari, Laurent; Denoyel, Victoire; Thiele, Aurélie Solving utility-maximization selection problems with multinomial logit demand: is the first-choice model a good approximation? (English) Zbl 07290749 Ann. Oper. Res. 292, No. 1, 553-573 (2020). MSC: 90C27 90C10 91B16 PDF BibTeX XML Cite \textit{L. Alfandari} et al., Ann. Oper. Res. 292, No. 1, 553--573 (2020; Zbl 07290749) Full Text: DOI
Hojny, Christopher; Gally, Tristan; Habeck, Oliver; Lüthen, Hendrik; Matter, Frederic; Pfetsch, Marc E.; Schmitt, Andreas Knapsack polytopes: a survey. (English) Zbl 07290746 Ann. Oper. Res. 292, No. 1, 469-517 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{C. Hojny} et al., Ann. Oper. Res. 292, No. 1, 469--517 (2020; Zbl 07290746) Full Text: DOI
Nguyen, Kien Trung; Hung, Nguyen Thanh The inverse connected \(p\)-median problem on block graphs under various cost functions. (English) Zbl 1451.90031 Ann. Oper. Res. 292, No. 1, 97-112 (2020). MSC: 90B10 90B80 90C27 PDF BibTeX XML Cite \textit{K. T. Nguyen} and \textit{N. T. Hung}, Ann. Oper. Res. 292, No. 1, 97--112 (2020; Zbl 1451.90031) Full Text: DOI
Baïou, Mourad (ed.); Gendron, Bernard (ed.); Günlük, Oktay (ed.); Mahjoub, Ali Ridha (ed.) Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020. Revised selected papers. (English) Zbl 07290430 Lecture Notes in Computer Science 12176. Cham: Springer (ISBN 978-3-030-53261-1/pbk; 978-3-030-53262-8/ebook). xi, 298 p. (2020). MSC: 90-06 90C27 00B25 PDF BibTeX XML Cite \textit{M. Baïou} (ed.) et al., Combinatorial optimization. 6th international symposium, ISCO 2020, Montreal, QC, Canada, May 4--6, 2020. Revised selected papers. Cham: Springer (2020; Zbl 07290430) Full Text: DOI
Gerke, Stefanie; Mezei, Balázs F.; Sorkin, Gregory B. Successive shortest paths in complete graphs with random edge weights. (English) Zbl 07290206 Random Struct. Algorithms 57, No. 4, 1205-1247 (2020). MSC: 05C38 05C12 05C80 05C22 60C05 PDF BibTeX XML Cite \textit{S. Gerke} et al., Random Struct. Algorithms 57, No. 4, 1205--1247 (2020; Zbl 07290206) Full Text: DOI
Yudhanegara, Mokhammad Ridwan; Indratno, Sapto Wahyu; Sari, RR. Kurnia Novita Clustering for item delivery using rule-\(k\)-means. (English) Zbl 07289258 J. Indones. Math. Soc. 26, No. 2, 185-191 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{M. R. Yudhanegara} et al., J. Indones. Math. Soc. 26, No. 2, 185--191 (2020; Zbl 07289258) Full Text: DOI
Bogdanov, I. P. Optimal scheduling of passenger air transportation in regional network. (Russian. English summary) Zbl 07288912 Mat. Model. 32, No. 9, 73-86 (2020). MSC: 90B06 90C27 90B35 90C05 90C11 PDF BibTeX XML Cite \textit{I. P. Bogdanov}, Mat. Model. 32, No. 9, 73--86 (2020; Zbl 07288912) Full Text: DOI MNR
Aprahamian, Hrayer; Bish, Ebru K.; Bish, Douglas R. Static risk-based group testing schemes under imperfectly observable risk. (English) Zbl 07288693 Stoch. Syst. 10, No. 4, 361-390 (2020). MSC: 60 PDF BibTeX XML Cite \textit{H. Aprahamian} et al., Stoch. Syst. 10, No. 4, 361--390 (2020; Zbl 07288693) Full Text: DOI
Gurski, Frank; Komander, Dominique; Rehs, Carolin Solutions for subset sum problems with special digraph constraints. (English) Zbl 07285844 Math. Methods Oper. Res. 92, No. 2, 401-433 (2020). MSC: 90C27 05C85 90C39 05C69 PDF BibTeX XML Cite \textit{F. Gurski} et al., Math. Methods Oper. Res. 92, No. 2, 401--433 (2020; Zbl 07285844) Full Text: DOI
Crema, Alejandro Min max min robust (relative) regret combinatorial optimization. (English) Zbl 07285839 Math. Methods Oper. Res. 92, No. 2, 249-283 (2020). MSC: 90C27 90C17 PDF BibTeX XML Cite \textit{A. Crema}, Math. Methods Oper. Res. 92, No. 2, 249--283 (2020; Zbl 07285839) Full Text: DOI