Mancini, Simona; Meloni, Carlo; Ciavotta, Michele A decomposition approach for multidimensional knapsacks with family-split penalties. (English) Zbl 07816763 Int. Trans. Oper. Res. 31, No. 4, 2247-2271 (2024). MSC: 90-XX PDFBibTeX XMLCite \textit{S. Mancini} et al., Int. Trans. Oper. Res. 31, No. 4, 2247--2271 (2024; Zbl 07816763) Full Text: DOI OA License
Boyd, Sylvia; Cheriyan, Joseph; Haddadan, Arash; Ibrahimpur, Sharat Approximation algorithms for flexible graph connectivity. (English) Zbl 07807816 Math. Program. 204, No. 1-2 (A), 493-516 (2024). MSC: 68W25 90C17 90C27 90C59 05C40 PDFBibTeX XMLCite \textit{S. Boyd} et al., Math. Program. 204, No. 1--2 (A), 493--516 (2024; Zbl 07807816) Full Text: DOI
Ma, Ran; Xu, Juannian; Zhang, Yuzhong A best possible online algorithm for minimizing the total completion time and the total soft penalty cost. (English) Zbl 07792596 Optim. Lett. 18, No. 1, 319-338 (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{R. Ma} et al., Optim. Lett. 18, No. 1, 319--338 (2024; Zbl 07792596) Full Text: DOI
Cavagnini, Rossana; Schneider, Michael; Theiß, Alina A tabu search with geometry-based sparsification methods for angular traveling salesman problems. (English) Zbl 07791151 Networks 83, No. 1, 30-52 (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{R. Cavagnini} et al., Networks 83, No. 1, 30--52 (2024; Zbl 07791151) Full Text: DOI OA License
Ray, Arka There is no APTAS for 2-dimensional vector bin packing: revisited. (English) Zbl 07749691 Inf. Process. Lett. 183, Article ID 106430, 7 p. (2024). MSC: 68Q17 68W25 68W40 90C27 PDFBibTeX XMLCite \textit{A. Ray}, Inf. Process. Lett. 183, Article ID 106430, 7 p. (2024; Zbl 07749691) Full Text: DOI arXiv
Megow, Nicole; Schlöter, Jens Set selection under explorable stochastic uncertainty via covering techniques. (English) Zbl 1528.90169 Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 319-333 (2023). MSC: 90C15 90C10 PDFBibTeX XMLCite \textit{N. Megow} and \textit{J. Schlöter}, Lect. Notes Comput. Sci. 13904, 319--333 (2023; Zbl 1528.90169) Full Text: DOI arXiv
Eberle, Franziska; Gupta, Anupam; Megow, Nicole; Moseley, Benjamin; Zhou, Rudy Configuration balancing for stochastic requests. (English) Zbl 1528.90112 Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 127-141 (2023). MSC: 90B36 90C15 90C27 PDFBibTeX XMLCite \textit{F. Eberle} et al., Lect. Notes Comput. Sci. 13904, 127--141 (2023; Zbl 1528.90112) Full Text: DOI arXiv
Cardinal, Jean; Steiner, Raphael Inapproximability of shortest paths on perfect matching polytopes. (English) Zbl 07763008 Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 72-86 (2023). MSC: 90C35 PDFBibTeX XMLCite \textit{J. Cardinal} and \textit{R. Steiner}, Lect. Notes Comput. Sci. 13904, 72--86 (2023; Zbl 07763008) Full Text: DOI arXiv
Erschler, Anna; Mitrofanov, Ivan Assouad-Nagata dimension and gap for ordered metric spaces. (English) Zbl 07755952 Comment. Math. Helv. 98, No. 2, 217-260 (2023). MSC: 54E35 90C35 20F18 20F65 20F69 54F45 PDFBibTeX XMLCite \textit{A. Erschler} and \textit{I. Mitrofanov}, Comment. Math. Helv. 98, No. 2, 217--260 (2023; Zbl 07755952) Full Text: DOI arXiv
Bhattacharya, Sayan; Henzinger, Monika; Nanongkai, Danupon; Wu, Xiaowei Deterministic near-optimal approximation algorithms for dynamic set cover. (English) Zbl 1523.68171 SIAM J. Comput. 52, No. 5, 1132-1192 (2023). MSC: 68W25 68P05 90C59 PDFBibTeX XMLCite \textit{S. Bhattacharya} et al., SIAM J. Comput. 52, No. 5, 1132--1192 (2023; Zbl 1523.68171) Full Text: DOI
Benedito, Marcelo P. L.; Pedrosa, Lehilton L. C.; Rosado, Hugo K. K. On the complexity of the cable-trench problem. (English) Zbl 07737625 Discrete Appl. Math. 340, 272-285 (2023). MSC: 90C35 PDFBibTeX XMLCite \textit{M. P. L. Benedito} et al., Discrete Appl. Math. 340, 272--285 (2023; Zbl 07737625) Full Text: DOI
Brodowsky, Ulrich A.; Hougardy, Stefan; Zhong, Xianghui The approximation ratio of the \(k\)-Opt heuristic for the Euclidean traveling salesman problem. (English) Zbl 1522.90150 SIAM J. Comput. 52, No. 4, 841-864 (2023). MSC: 90C27 68W25 68W40 PDFBibTeX XMLCite \textit{U. A. Brodowsky} et al., SIAM J. Comput. 52, No. 4, 841--864 (2023; Zbl 1522.90150) Full Text: DOI arXiv
Shabtay, Dvir; Gilenson, Miri A state-of-the-art survey on multi-scenario scheduling. (English) Zbl 07709800 Eur. J. Oper. Res. 310, No. 1, 3-23 (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{D. Shabtay} and \textit{M. Gilenson}, Eur. J. Oper. Res. 310, No. 1, 3--23 (2023; Zbl 07709800) Full Text: DOI
Xepapadeas, Petros Serial dictatorship vs. Nash in assessing Pareto optimality in many-to-many matchings with an application in water management. (English) Zbl 1517.90075 J. Dyn. Games 10, No. 2, 208-237 (2023). MSC: 90B50 91B32 91-06 91A10 PDFBibTeX XMLCite \textit{P. Xepapadeas}, J. Dyn. Games 10, No. 2, 208--237 (2023; Zbl 1517.90075) Full Text: DOI
Jozefiak, Adam; Shepherd, F. Bruce; Weninger, Noah A knapsack intersection hierarchy. (English) Zbl 1525.90278 Oper. Res. Lett. 51, No. 1, 72-78 (2023). MSC: 90C10 90C27 PDFBibTeX XMLCite \textit{A. Jozefiak} et al., Oper. Res. Lett. 51, No. 1, 72--78 (2023; Zbl 1525.90278) Full Text: DOI
Györgyi, Péter; Kis, Tamás; Tamási, Tímea; Békési, József Joint replenishment meets scheduling. (English) Zbl 1517.90047 J. Sched. 26, No. 1, 77-94 (2023). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Györgyi} et al., J. Sched. 26, No. 1, 77--94 (2023; Zbl 1517.90047) Full Text: DOI arXiv
Erschler, Anna; Mitrofanov, Ivan Spaces that can be ordered effectively: virtually free groups and hyperbolicity. (English) Zbl 1522.20180 Geom. Dedicata 217, No. 4, Paper No. 68, 42 p. (2023). Reviewer: Andrzej Szczepański (Gdańsk) MSC: 20F67 20F65 20F69 20F18 90C27 PDFBibTeX XMLCite \textit{A. Erschler} and \textit{I. Mitrofanov}, Geom. Dedicata 217, No. 4, Paper No. 68, 42 p. (2023; Zbl 1522.20180) Full Text: DOI arXiv
Taşkesen, Bahar; Shafieezadeh-Abadeh, Soroosh; Kuhn, Daniel; Natarajan, Karthik Discrete optimal transport with independent marginals is \(\#\)P-hard. (English) Zbl 1519.90112 SIAM J. Optim. 33, No. 2, 589-614 (2023). MSC: 90C05 90C25 03D15 90C39 PDFBibTeX XMLCite \textit{B. Taşkesen} et al., SIAM J. Optim. 33, No. 2, 589--614 (2023; Zbl 1519.90112) Full Text: DOI arXiv
Taşkesen, Bahar; Shafieezadeh-Abadeh, Soroosh; Kuhn, Daniel Semi-discrete optimal transport: hardness, regularization and numerical solution. (English) Zbl 1518.90049 Math. Program. 199, No. 1-2 (A), 1033-1106 (2023). MSC: 90C08 90C17 PDFBibTeX XMLCite \textit{B. Taşkesen} et al., Math. Program. 199, No. 1--2 (A), 1033--1106 (2023; Zbl 1518.90049) Full Text: DOI arXiv
Cristi, Andrés; Mari, Mathieu; Wiese, Andreas Fixed-parameter algorithms for unsplittable flow cover. (English) Zbl 07680320 Theory Comput. Syst. 67, No. 1, 89-124 (2023). MSC: 68Qxx 68Wxx 90Cxx PDFBibTeX XMLCite \textit{A. Cristi} et al., Theory Comput. Syst. 67, No. 1, 89--124 (2023; Zbl 07680320) Full Text: DOI
Ciardo, Lorenzo; Živný, Stanislav CLAP: a new algorithm for promise CSPs. (English) Zbl 07672223 SIAM J. Comput. 52, No. 1, 1-37 (2023). MSC: 68Q25 68R01 90C05 PDFBibTeX XMLCite \textit{L. Ciardo} and \textit{S. Živný}, SIAM J. Comput. 52, No. 1, 1--37 (2023; Zbl 07672223) Full Text: DOI arXiv
Naves, Guyslain; Shepherd, F. Bruce; Xia, Henry Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. (English) Zbl 1509.05168 Math. Program. 197, No. 2 (B), 1049-1067 (2023). MSC: 05C85 90C10 68W25 PDFBibTeX XMLCite \textit{G. Naves} et al., Math. Program. 197, No. 2 (B), 1049--1067 (2023; Zbl 1509.05168) Full Text: DOI
Chakrabarty, Deeparnab; Negahbani, Maryam Robust \(k\)-center with two types of radii. (English) Zbl 1508.68414 Math. Program. 197, No. 2 (B), 991-1007 (2023). MSC: 68W25 90B80 90C27 PDFBibTeX XMLCite \textit{D. Chakrabarty} and \textit{M. Negahbani}, Math. Program. 197, No. 2 (B), 991--1007 (2023; Zbl 1508.68414) Full Text: DOI
Altschuler, Jason M.; Parrilo, Pablo A. Near-linear convergence of the random Osborne algorithm for matrix balancing. (English) Zbl 07658253 Math. Program. 198, No. 1 (A), 363-397 (2023). MSC: 65F08 65F50 90C25 PDFBibTeX XMLCite \textit{J. M. Altschuler} and \textit{P. A. Parrilo}, Math. Program. 198, No. 1 (A), 363--397 (2023; Zbl 07658253) Full Text: DOI arXiv
Faenza, Yuri; Segev, Danny; Zhang, Lingyi Approximation algorithms for the generalized incremental knapsack problem. (English) Zbl 1508.68415 Math. Program. 198, No. 1 (A), 27-83 (2023). MSC: 68W25 68Q25 90C10 90C27 90C59 PDFBibTeX XMLCite \textit{Y. Faenza} et al., Math. Program. 198, No. 1 (A), 27--83 (2023; Zbl 1508.68415) Full Text: DOI arXiv
Karapetyan, Areg; Elbassioni, Khaled; Khonji, Majid; Chau, Sid Chi-Kin Approximations for generalized unsplittable flow on paths with application to power systems optimization. (English) Zbl 1511.90350 Ann. Oper. Res. 320, No. 1, 173-204 (2023). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{A. Karapetyan} et al., Ann. Oper. Res. 320, No. 1, 173--204 (2023; Zbl 1511.90350) Full Text: DOI arXiv
Zhang, Zhen; Feng, Qilong; Huang, Junyu; Wang, Jianxin Improved approximation algorithms for solving the squared metric \(k\)-facility location problem. (English) Zbl 07635996 Theor. Comput. Sci. 942, 107-122 (2023). MSC: 90B80 68W25 PDFBibTeX XMLCite \textit{Z. Zhang} et al., Theor. Comput. Sci. 942, 107--122 (2023; Zbl 07635996) Full Text: DOI
Meng, Ying; Li, Tianyang; Tang, Lixin Learning-based multi-objective evolutionary algorithm for batching decision problem. (English) Zbl 1520.90190 Comput. Oper. Res. 149, Article ID 106026, 14 p. (2023). MSC: 90C29 90C59 PDFBibTeX XMLCite \textit{Y. Meng} et al., Comput. Oper. Res. 149, Article ID 106026, 14 p. (2023; Zbl 1520.90190) Full Text: DOI
Demeulemeester, Tom; Goossens, Dries; Hermans, Ben; Leus, Roel A pessimist’s approach to one-sided matching. (English) Zbl 07632155 Eur. J. Oper. Res. 305, No. 3, 1087-1099 (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{T. Demeulemeester} et al., Eur. J. Oper. Res. 305, No. 3, 1087--1099 (2023; Zbl 07632155) Full Text: DOI arXiv
Jowhari, Hossein An estimator for matching size in low arboricity graphs with two applications. (English) Zbl 1507.90147 J. Comb. Optim. 45, No. 1, Paper No. 21, 14 p. (2023). MSC: 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{H. Jowhari}, J. Comb. Optim. 45, No. 1, Paper No. 21, 14 p. (2023; Zbl 1507.90147) Full Text: DOI arXiv
Bampis, Evripidis; Cella, Carmine-Emanuele; Escoffier, Bruno; Rocco, Mila; Teiller, Alexandre Target-based computer-assisted orchestration: complexity and approximation algorithms. (English) Zbl 07594676 Eur. J. Oper. Res. 304, No. 3, 926-938 (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{E. Bampis} et al., Eur. J. Oper. Res. 304, No. 3, 926--938 (2023; Zbl 07594676) Full Text: DOI
Saito, Yusuke; Shioura, Akiyoshi Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines. (English) Zbl 1528.90111 Ljubić, Ivana (ed.) et al., Combinatorial optimization. 7th international symposium, ISCO 2022, virtual event, May 18–20, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13526, 324-335 (2022). MSC: 90B35 90B10 90C60 PDFBibTeX XMLCite \textit{Y. Saito} and \textit{A. Shioura}, Lect. Notes Comput. Sci. 13526, 324--335 (2022; Zbl 1528.90111) Full Text: DOI
Perez-Salazar, Sebastian; Singh, Mohit; Toriello, Alejandro Adaptive bin packing with overflow. (English) Zbl 07639672 Math. Oper. Res. 47, No. 4, 3317-3356 (2022). MSC: 68W25 90C27 90C39 90C40 PDFBibTeX XMLCite \textit{S. Perez-Salazar} et al., Math. Oper. Res. 47, No. 4, 3317--3356 (2022; Zbl 07639672) Full Text: DOI arXiv
Fagnon, Vincent; Lucarelli, Giorgio; Mommessin, Clément; Trystram, Denis Two-agent scheduling with resource augmentation on multiple machines. (English) Zbl 1512.68042 Cano, José (ed.) et al., Euro-Par 2022: parallel processing. 28th international conference on parallel and distributed computing, Glasgow, UK, August 22–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13440, 253-267 (2022). MSC: 68M20 68W27 90B35 PDFBibTeX XMLCite \textit{V. Fagnon} et al., Lect. Notes Comput. Sci. 13440, 253--267 (2022; Zbl 1512.68042) Full Text: DOI
Etesami, S. Rasoul An optimal control framework for online job scheduling with general cost functions. (English) Zbl 1502.90073 Oper. Res. 70, No. 5, 2674-2701 (2022). MSC: 90B35 90B05 PDFBibTeX XMLCite \textit{S. R. Etesami}, Oper. Res. 70, No. 5, 2674--2701 (2022; Zbl 1502.90073) Full Text: DOI arXiv
Gupta, Swati; Khodabakhsh, Ali; Mortagy, Hassan; Nikolova, Evdokia Electrical flows over spanning trees. (English) Zbl 1506.90167 Math. Program. 196, No. 1-2 (B), 479-519 (2022). MSC: 90C11 90C25 90C27 90C30 90C59 90C90 90B10 PDFBibTeX XMLCite \textit{S. Gupta} et al., Math. Program. 196, No. 1--2 (B), 479--519 (2022; Zbl 1506.90167) Full Text: DOI arXiv
Li, Songhua; Li, Minming; Duan, Lingjie; Lee, Victor C. S. Online algorithms for the maximum \(k\)-interval coverage problem. (English) Zbl 1505.90107 J. Comb. Optim. 44, No. 5, 3364-3404 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{S. Li} et al., J. Comb. Optim. 44, No. 5, 3364--3404 (2022; Zbl 1505.90107) Full Text: DOI arXiv
Sun, Xin; Li, Gaidi; Zhang, Yapu; Zhang, Zhenning Private non-monotone submodular maximization. (English) Zbl 1505.90112 J. Comb. Optim. 44, No. 5, 3212-3232 (2022). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{X. Sun} et al., J. Comb. Optim. 44, No. 5, 3212--3232 (2022; Zbl 1505.90112) Full Text: DOI
Ye, Deshi; Xie, Feng; Zhang, Guochuan Truthful mechanism design for bin packing with applications on cloud computing. (English) Zbl 1503.90123 J. Comb. Optim. 44, No. 4, 2224-2245 (2022). MSC: 90C27 91B26 PDFBibTeX XMLCite \textit{D. Ye} et al., J. Comb. Optim. 44, No. 4, 2224--2245 (2022; Zbl 1503.90123) Full Text: DOI
Ma, Ran; Guo, Sainan; Zhang, Xiaoyan An optimal online algorithm for single-processor scheduling problem with learning effect. (English) Zbl 07597572 Theor. Comput. Sci. 928, 1-12 (2022). MSC: 68W27 68M20 90B35 PDFBibTeX XMLCite \textit{R. Ma} et al., Theor. Comput. Sci. 928, 1--12 (2022; Zbl 07597572) Full Text: DOI
Bayen, Alexandre; Goodman, Jesse; Vinitsky, Eugene On the approximability of time disjoint walks. (English) Zbl 1502.90141 J. Comb. Optim. 44, No. 3, 1615-1636 (2022). MSC: 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{A. Bayen} et al., J. Comb. Optim. 44, No. 3, 1615--1636 (2022; Zbl 1502.90141) Full Text: DOI
Christman, Ananya; Chung, Christine; Jaczko, Nicholas; Westvold, Scott; Yuen, David S. Robustly assigning unstable items. (English) Zbl 1502.90144 J. Comb. Optim. 44, No. 3, 1556-1577 (2022). MSC: 90C27 90C17 90B80 PDFBibTeX XMLCite \textit{A. Christman} et al., J. Comb. Optim. 44, No. 3, 1556--1577 (2022; Zbl 1502.90144) Full Text: DOI
Moghanni, Ali; Pascoal, Marta; Godinho, Maria Teresa Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations. (English) Zbl 1520.90199 Comput. Oper. Res. 147, Article ID 105939, 13 p. (2022). MSC: 90C35 PDFBibTeX XMLCite \textit{A. Moghanni} et al., Comput. Oper. Res. 147, Article ID 105939, 13 p. (2022; Zbl 1520.90199) Full Text: DOI
Malashenko, Yu. E.; Nazarova, I. A. Heterogeneous flow distribution at the peak load in the multiuser network. (English. Russian original) Zbl 1498.90047 J. Comput. Syst. Sci. Int. 61, No. 3, 372-387 (2022); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upr. 2022, No. 3, 81-96 (2022). MSC: 90B18 PDFBibTeX XMLCite \textit{Yu. E. Malashenko} and \textit{I. A. Nazarova}, J. Comput. Syst. Sci. Int. 61, No. 3, 372--387 (2022; Zbl 1498.90047); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upr. 2022, No. 3, 81--96 (2022) Full Text: DOI
Feldman, Jacob; Segev, Danny Technical note – The multinomial logit model with sequential offerings: algorithmic frameworks for product recommendation displays. (English) Zbl 1502.90107 Oper. Res. 70, No. 4, 2162-2184 (2022). MSC: 90B80 68W25 90C27 90C39 91B38 90B35 90C59 PDFBibTeX XMLCite \textit{J. Feldman} and \textit{D. Segev}, Oper. Res. 70, No. 4, 2162--2184 (2022; Zbl 1502.90107) Full Text: DOI
Liu, Shengxin; Poon, Chung Keung Greedy algorithms for the profit-aware social team formation problem. (English) Zbl 1498.90195 J. Comb. Optim. 44, No. 1, 94-118 (2022). MSC: 90C27 91D30 PDFBibTeX XMLCite \textit{S. Liu} and \textit{C. K. Poon}, J. Comb. Optim. 44, No. 1, 94--118 (2022; Zbl 1498.90195) Full Text: DOI
Ghuge, Rohan; Gupta, Anupam; Nagarajan, Viswanath Non-adaptive stochastic score classification and explainable halfspace evaluation. (English) Zbl 1497.90138 Aardal, Karen (ed.) et al., Integer programming and combinatorial optimization. 23rd international conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13265, 277-290 (2022). MSC: 90C15 90C59 PDFBibTeX XMLCite \textit{R. Ghuge} et al., Lect. Notes Comput. Sci. 13265, 277--290 (2022; Zbl 1497.90138) Full Text: DOI arXiv
Cui, Min; Xu, Dachuan; Guo, Longkun; Wu, Dan Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint. (English) Zbl 1495.90150 J. Comb. Optim. 43, No. 5, 1671-1690 (2022). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. Cui} et al., J. Comb. Optim. 43, No. 5, 1671--1690 (2022; Zbl 1495.90150) Full Text: DOI
Cheng, Siu-Wing; Mao, Yuchen Restricted max-min allocation: integrality gap and approximation algorithm. (English) Zbl 1494.91067 Algorithmica 84, No. 7, 1835-1874 (2022). MSC: 91B32 68W25 90C59 PDFBibTeX XMLCite \textit{S.-W. Cheng} and \textit{Y. Mao}, Algorithmica 84, No. 7, 1835--1874 (2022; Zbl 1494.91067) Full Text: DOI
Monaci, Michele; Pike-Burke, Ciara; Santini, Alberto Exact algorithms for the 0-1 time-bomb knapsack problem. (English) Zbl 1520.90181 Comput. Oper. Res. 145, Article ID 105848, 10 p. (2022). MSC: 90C27 90C15 90C39 90C59 PDFBibTeX XMLCite \textit{M. Monaci} et al., Comput. Oper. Res. 145, Article ID 105848, 10 p. (2022; Zbl 1520.90181) Full Text: DOI
Cacchiani, Valentina; Iori, Manuel; Locatelli, Alberto; Martello, Silvano Knapsack problems – an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems. (English) Zbl 1512.90190 Comput. Oper. Res. 143, Article ID 105693, 14 p. (2022). MSC: 90C27 90-02 PDFBibTeX XMLCite \textit{V. Cacchiani} et al., Comput. Oper. Res. 143, Article ID 105693, 14 p. (2022; Zbl 1512.90190) Full Text: DOI
Segev, Danny; Shaposhnik, Yaron A polynomial-time approximation scheme for sequential batch testing of series systems. (English) Zbl 1493.90216 Oper. Res. 70, No. 2, 1153-1165 (2022). MSC: 90C39 90C90 PDFBibTeX XMLCite \textit{D. Segev} and \textit{Y. Shaposhnik}, Oper. Res. 70, No. 2, 1153--1165 (2022; Zbl 1493.90216) Full Text: DOI
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 PDFBibTeX XMLCite \textit{D. Adjiashvili} et al., Math. Program. 192, No. 1--2 (B), 409--441 (2022; Zbl 07495426) Full Text: DOI
Moseley, Benjamin; Vardi, Shai The efficiency-fairness balance of round robin scheduling. (English) Zbl 1525.90216 Oper. Res. Lett. 50, No. 1, 20-27 (2022). MSC: 90B35 PDFBibTeX XMLCite \textit{B. Moseley} and \textit{S. Vardi}, Oper. Res. Lett. 50, No. 1, 20--27 (2022; Zbl 1525.90216) Full Text: DOI
Gupta, Prashant; Guo, Yiran; Boddeti, Narasimha; Krishnamoorthy, Bala SFCDecomp: multicriteria optimized tool path planning in 3D printing using space-filling curve based domain decomposition. (English) Zbl 1496.68353 Int. J. Comput. Geom. Appl. 31, No. 4, 193-220 (2021). MSC: 68U05 90C90 PDFBibTeX XMLCite \textit{P. Gupta} et al., Int. J. Comput. Geom. Appl. 31, No. 4, 193--220 (2021; Zbl 1496.68353) Full Text: DOI arXiv
Chen, Jianer; Huang, Minjie; Guo, Yin Scheduling on multiple two-stage flowshops with a deadline. (English) Zbl 1498.68042 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 83-95 (2021). MSC: 68M20 68W25 90B35 PDFBibTeX XMLCite \textit{J. Chen} et al., Lect. Notes Comput. Sci. 13153, 83--95 (2021; Zbl 1498.68042) Full Text: DOI
Zhang, Zhen; Feng, Qilong An improved approximation algorithm for squared metric \(k\)-facility location. (English) Zbl 07550550 Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 538-552 (2021). MSC: 68T20 90C27 PDFBibTeX XMLCite \textit{Z. Zhang} and \textit{Q. Feng}, Lect. Notes Comput. Sci. 13135, 538--552 (2021; Zbl 07550550) Full Text: DOI
Brimkov, Boris; Mikesell, Derek; Hicks, Illya V. Improved computational approaches and heuristics for zero forcing. (English) Zbl 07549340 INFORMS J. Comput. 33, No. 4, 1384-1399 (2021). MSC: 90-XX PDFBibTeX XMLCite \textit{B. Brimkov} et al., INFORMS J. Comput. 33, No. 4, 1384--1399 (2021; Zbl 07549340) Full Text: DOI
de Meijer, Frank; Sotirov, Renata SDP-based bounds for the quadratic cycle cover problem via cutting-plane augmented Lagrangian methods and reinforcement learning. (English) Zbl 07549332 INFORMS J. Comput. 33, No. 4, 1262-1276 (2021). MSC: 90-XX PDFBibTeX XMLCite \textit{F. de Meijer} and \textit{R. Sotirov}, INFORMS J. Comput. 33, No. 4, 1262--1276 (2021; Zbl 07549332) Full Text: DOI arXiv
Stolyar, Alexander L.; Zhong, Yuan A service system with packing constraints: greedy randomized algorithm achieving sublinear in scale optimality gap. (English) Zbl 1492.90044 Stoch. Syst. 11, No. 2, 83-111 (2021). MSC: 90B22 90B15 60K25 60K30 PDFBibTeX XMLCite \textit{A. L. Stolyar} and \textit{Y. Zhong}, Stoch. Syst. 11, No. 2, 83--111 (2021; Zbl 1492.90044) Full Text: DOI arXiv
Detti, Paolo A new upper bound for the multiple knapsack problem. (English) Zbl 1510.90223 Comput. Oper. Res. 129, Article ID 105210, 12 p. (2021). MSC: 90C27 PDFBibTeX XMLCite \textit{P. Detti}, Comput. Oper. Res. 129, Article ID 105210, 12 p. (2021; Zbl 1510.90223) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{G. Naves} et al., Lect. Notes Comput. Sci. 12707, 326--339 (2021; Zbl 1482.90232) Full Text: DOI arXiv
Chakrabarty, Deeparnab; Negahbani, Maryam Robust \(k\)-center with two types of radii. (English) Zbl 1482.90178 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, 268-282 (2021). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{D. Chakrabarty} and \textit{M. Negahbani}, Lect. Notes Comput. Sci. 12707, 268--282 (2021; Zbl 1482.90178) Full Text: DOI arXiv
Chrobak, Marek; Golin, Mordecai; Lam, Tak-Wah; Nogneng, Dorian Scheduling with gaps: new models and algorithms. (English) Zbl 1479.90083 J. Sched. 24, No. 4, 381-403 (2021). MSC: 90B35 68M20 68Q25 90C39 PDFBibTeX XMLCite \textit{M. Chrobak} et al., J. Sched. 24, No. 4, 381--403 (2021; Zbl 1479.90083) Full Text: DOI
Zhong, Xianghui On the approximation ratio of the 3-opt algorithm for the \((1,2)\)-TSP. (English) Zbl 1525.90381 Oper. Res. Lett. 49, No. 4, 515-521 (2021). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{X. Zhong}, Oper. Res. Lett. 49, No. 4, 515--521 (2021; Zbl 1525.90381) Full Text: DOI arXiv
Borgwardt, Steffen; Brand, Cornelius; Feldmann, Andreas Emil; Koutecký, Martin A note on the approximability of deepest-descent circuit steps. (English) Zbl 1525.90261 Oper. Res. Lett. 49, No. 3, 310-315 (2021). MSC: 90C05 90C60 90C10 PDFBibTeX XMLCite \textit{S. Borgwardt} et al., Oper. Res. Lett. 49, No. 3, 310--315 (2021; Zbl 1525.90261) Full Text: DOI arXiv
Blado, Daniel; Toriello, Alejandro A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes. (English) Zbl 1473.90090 Math. Program. Comput. 13, No. 1, 185-223 (2021). MSC: 90C10 90C27 90C40 90-08 PDFBibTeX XMLCite \textit{D. Blado} and \textit{A. Toriello}, Math. Program. Comput. 13, No. 1, 185--223 (2021; Zbl 1473.90090) Full Text: DOI
Léger, Flavien A gradient descent perspective on Sinkhorn. (English) Zbl 1478.90057 Appl. Math. Optim. 84, No. 2, 1843-1855 (2021). MSC: 90C08 49N99 65D99 65Y20 65N12 PDFBibTeX XMLCite \textit{F. Léger}, Appl. Math. Optim. 84, No. 2, 1843--1855 (2021; Zbl 1478.90057) Full Text: DOI arXiv
Deng, Yunyun; Guo, Longkun; Liao, Kewen; Chen, Yi On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms. (English) Zbl 1514.68207 Theor. Comput. Sci. 886, 157-168 (2021). MSC: 68R10 05C38 05C85 68Q17 68W40 90C05 90C35 PDFBibTeX XMLCite \textit{Y. Deng} et al., Theor. Comput. Sci. 886, 157--168 (2021; Zbl 1514.68207) Full Text: DOI
Cormode, Graham; Veselý, Pavel Streaming algorithms for bin packing and vector scheduling. (English) Zbl 1528.68408 Theory Comput. Syst. 65, No. 6, 916-942 (2021). MSC: 68W27 90B35 90C27 PDFBibTeX XMLCite \textit{G. Cormode} and \textit{P. Veselý}, Theory Comput. Syst. 65, No. 6, 916--942 (2021; Zbl 1528.68408) Full Text: DOI
Szegedy, Mario; Yu, Jingjin On rearrangement of items stored in stacks. (English) Zbl 1469.68137 Lavalle, Steven M. (ed.) et al., Algorithmic foundations of robotics XIV. Proceedings of the fourteenth workshop on the algorithmic foundations of robotics. Cham: Springer. Springer Proc. Adv. Robot. 17, 518-533 (2021). MSC: 68T40 68T20 90C27 PDFBibTeX XMLCite \textit{M. Szegedy} and \textit{J. Yu}, Springer Proc. Adv. Robot. 17, 518--533 (2021; Zbl 1469.68137) Full Text: DOI arXiv
Epstein, Leah; Kleiman, Elena Selfish vector packing. (English) Zbl 1515.90115 Algorithmica 83, No. 9, 2952-2988 (2021). MSC: 90C27 91A06 91A68 91B32 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{E. Kleiman}, Algorithmica 83, No. 9, 2952--2988 (2021; Zbl 1515.90115) Full Text: DOI
Gimadi, E. Kh.; Tsidulko, O. Yu. On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines. (English. Russian original) Zbl 1470.90040 Proc. Steklov Inst. Math. 313, Suppl. 1, S58-S72 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108-124 (2020). MSC: 90B80 90B10 90C35 90-01 05C05 68W25 PDFBibTeX XMLCite \textit{E. Kh. Gimadi} and \textit{O. Yu. Tsidulko}, Proc. Steklov Inst. Math. 313, S58--S72 (2021; Zbl 1470.90040); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108--124 (2020) Full Text: DOI
Buchbinder, Niv; Schwartz, Roy; Weizman, Baruch Simplex transformations and the multiway cut problem. (English) Zbl 1522.05465 Math. Oper. Res. 46, No. 2, 757-771 (2021). MSC: 05C85 05C70 68W25 90C35 PDFBibTeX XMLCite \textit{N. Buchbinder} et al., Math. Oper. Res. 46, No. 2, 757--771 (2021; Zbl 1522.05465) Full Text: DOI
Séguin-Charbonneau, Loïc; Shepherd, F. Bruce Maximum edge-disjoint paths in planar graphs with congestion 2. (English) Zbl 1470.90107 Math. Program. 188, No. 1(A), 295-317 (2021). MSC: 90C27 90C05 PDFBibTeX XMLCite \textit{L. Séguin-Charbonneau} and \textit{F. B. Shepherd}, Math. Program. 188, No. 1 (A), 295--317 (2021; Zbl 1470.90107) Full Text: DOI
Bansal, Nikhil; Srinivasan, Aravind; Svensson, Ola Lift-and-round to improve weighted completion time on unrelated machines. (English) Zbl 1464.90025 SIAM J. Comput. 50, No. 3, STOC16-138-STOC16-159 (2021). MSC: 90B35 68Q17 68W25 90C22 PDFBibTeX XMLCite \textit{N. Bansal} et al., SIAM J. Comput. 50, No. 3, STOC16--138-STOC16--159 (2021; Zbl 1464.90025) Full Text: DOI arXiv
Assadi, Sepehr; Khanna, Sanjeev; Li, Yang Tight bounds for single-pass streaming complexity of the set cover problem. (English) Zbl 1464.68124 SIAM J. Comput. 50, No. 3, STOC16-341-STOC16-376 (2021). MSC: 68Q25 68Q11 68W25 68W27 90C27 PDFBibTeX XMLCite \textit{S. Assadi} et al., SIAM J. Comput. 50, No. 3, STOC16--341-STOC16--376 (2021; Zbl 1464.68124) Full Text: DOI
Fekete, Sándor P.; Kleist, Linda; Krupke, Dominik Minimum scan cover with angular transition costs. (English) Zbl 1467.05045 SIAM J. Discrete Math. 35, No. 2, 1337-1355 (2021). MSC: 05C10 05C15 51F99 52C45 90B35 90C27 05C90 PDFBibTeX XMLCite \textit{S. P. Fekete} et al., SIAM J. Discrete Math. 35, No. 2, 1337--1355 (2021; Zbl 1467.05045) Full Text: DOI arXiv
Albers, Susanne; Khan, Arindam; Ladewig, Leon Improved online algorithms for knapsack and GAP in the random order model. (English) Zbl 1516.68121 Algorithmica 83, No. 6, 1750-1785 (2021). MSC: 68W27 68W20 90C27 PDFBibTeX XMLCite \textit{S. Albers} et al., Algorithmica 83, No. 6, 1750--1785 (2021; Zbl 1516.68121) Full Text: DOI arXiv
Mancini, Simona; Ciavotta, Michele; Meloni, Carlo The multiple multidimensional knapsack with family-split penalties. (English) Zbl 1487.90562 Eur. J. Oper. Res. 289, No. 3, 987-998 (2021). MSC: 90C27 90C10 PDFBibTeX XMLCite \textit{S. Mancini} et al., Eur. J. Oper. Res. 289, No. 3, 987--998 (2021; Zbl 1487.90562) Full Text: DOI
Chai, Xing; Li, Wenhua; Zhu, Yuejuan Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine. (English) Zbl 1514.90135 Ann. Oper. Res. 298, No. 1-2, 79-93 (2021). MSC: 90B35 68W27 PDFBibTeX XMLCite \textit{X. Chai} et al., Ann. Oper. Res. 298, No. 1--2, 79--93 (2021; Zbl 1514.90135) Full Text: DOI
Kulik, Ariel; Shachnai, Hadas; Tamir, Gal On Lagrangian relaxation for constrained maximization and reoptimization problems. (English) Zbl 1464.90098 Discrete Appl. Math. 296, 164-178 (2021). MSC: 90C30 90C27 PDFBibTeX XMLCite \textit{A. Kulik} et al., Discrete Appl. Math. 296, 164--178 (2021; Zbl 1464.90098) Full Text: DOI
Nguyen, Trung Thanh; Rothe, Jörg Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints. (English) Zbl 1457.90073 Theor. Comput. Sci. 858, 35-48 (2021). MSC: 90B35 68W25 68M20 90C05 PDFBibTeX XMLCite \textit{T. T. Nguyen} and \textit{J. Rothe}, Theor. Comput. Sci. 858, 35--48 (2021; Zbl 1457.90073) Full Text: DOI
Cicalese, Ferdinando; Laber, Eduardo Sany On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem. (English) Zbl 1456.90176 Discrete Appl. Math. 289, 503-515 (2021). MSC: 90C47 90C35 PDFBibTeX XMLCite \textit{F. Cicalese} and \textit{E. S. Laber}, Discrete Appl. Math. 289, 503--515 (2021; Zbl 1456.90176) Full Text: DOI
Martín, Bernardo; Sánchez, Ángel; Beltran-Royo, Cesar; Duarte, Abraham Solving the edge-disjoint paths problem using a two-stage method. (English) Zbl 07766431 Int. Trans. Oper. Res. 27, No. 1, 435-457 (2020). MSC: 90-XX PDFBibTeX XMLCite \textit{B. Martín} et al., Int. Trans. Oper. Res. 27, No. 1, 435--457 (2020; Zbl 07766431) Full Text: DOI
Chan, Chun-Hsiang; Laekhanukit, Bundit; Wei, Hao-Ting; Zhang, Yuhao Polylogarithmic approximation algorithm for \(k\)-connected directed Steiner tree on quasi-bipartite graphs. (English) Zbl 07758365 Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 63, 20 p. (2020). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{C.-H. Chan} et al., LIPIcs -- Leibniz Int. Proc. Inform. 176, Article 63, 20 p. (2020; Zbl 07758365) Full Text: DOI arXiv
Bandyapadhyay, Sayan On perturbation resilience of non-uniform \(k\)-center. (English) Zbl 07758333 Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 31, 22 p. (2020). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{S. Bandyapadhyay}, LIPIcs -- Leibniz Int. Proc. Inform. 176, Article 31, 22 p. (2020; Zbl 07758333) Full Text: DOI
Chakrabarti, Amit; Ghosh, Prantar; Thaler, Justin Streaming verification for graph problems: optimal tradeoffs and nonlinear sketches. (English) Zbl 07758324 Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 22, 23 p. (2020). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{A. Chakrabarti} et al., LIPIcs -- Leibniz Int. Proc. Inform. 176, Article 22, 23 p. (2020; Zbl 07758324) Full Text: DOI arXiv
Czumaj, Artur; Fichtenberger, Hendrik; Peng, Pan; Sohler, Christian Testable properties in general graphs and random order streaming. (English) Zbl 07758318 Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 16, 20 p. (2020). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{A. Czumaj} et al., LIPIcs -- Leibniz Int. Proc. Inform. 176, Article 16, 20 p. (2020; Zbl 07758318) Full Text: DOI arXiv
Alon, Noga; Assadi, Sepehr Palette sparsification beyond \((\Delta +1)\) vertex coloring. (English) Zbl 07758308 Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 6, 22 p. (2020). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{N. Alon} and \textit{S. Assadi}, LIPIcs -- Leibniz Int. Proc. Inform. 176, Article 6, 22 p. (2020; Zbl 07758308) Full Text: DOI arXiv
Dai, Bingfei; Li, Weidong Vector scheduling with rejection on two machines. (English) Zbl 1483.90051 Int. J. Comput. Math. 97, No. 12, 2507-2515 (2020). MSC: 90B35 68W25 68W27 PDFBibTeX XMLCite \textit{B. Dai} and \textit{W. Li}, Int. J. Comput. Math. 97, No. 12, 2507--2515 (2020; Zbl 1483.90051) Full Text: DOI
Tsouros, Dimosthenis C.; Stergiou, Kostas Efficient multiple constraint acquisition. (English) Zbl 1483.90067 Constraints 25, No. 3-4, 180-225 (2020). MSC: 90B50 PDFBibTeX XMLCite \textit{D. C. Tsouros} and \textit{K. Stergiou}, Constraints 25, No. 3--4, 180--225 (2020; Zbl 1483.90067) Full Text: DOI arXiv
Vilas, Fernando E.; Olinick, Eli V.; Matula, David W. Bounds on maximum concurrent flow in random bipartite graphs. (English) Zbl 1459.90217 Optim. Lett. 14, No. 8, 2197-2209 (2020). MSC: 90C35 90C15 PDFBibTeX XMLCite \textit{F. E. Vilas} et al., Optim. Lett. 14, No. 8, 2197--2209 (2020; Zbl 1459.90217) Full Text: DOI
Chakaravarthy, Venkatesan T.; Choudhury, Anamitra R.; Roy, Sambuddha; Sabharwal, Yogish Scheduling split intervals with non-uniform demands. (English) Zbl 1506.90094 Discrete Optim. 38, Article ID 100611, 22 p. (2020). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{V. T. Chakaravarthy} et al., Discrete Optim. 38, Article ID 100611, 22 p. (2020; Zbl 1506.90094) Full Text: DOI
Chuzhoy, Julia; Kim, David H. K.; Nimavat, Rachit New hardness results for routing on disjoint paths. (English) Zbl 1497.68221 SIAM J. Comput. 51, No. 2, STOC17-189-STOC17-237 (2022). MSC: 68Q17 68W25 90C35 90C59 PDFBibTeX XMLCite \textit{J. Chuzhoy} et al., SIAM J. Comput. 51, No. 2, STOC17--189-STOC17--237 (2020; Zbl 1497.68221) Full Text: DOI arXiv
Mansour, Yishay; Slivkins, Aleksandrs; Syrgkanis, Vasilis Bayesian incentive-compatible bandit exploration. (English) Zbl 1451.90079 Oper. Res. 68, No. 4, 1132-1161 (2020). MSC: 90B50 PDFBibTeX XMLCite \textit{Y. Mansour} et al., Oper. Res. 68, No. 4, 1132--1161 (2020; Zbl 1451.90079) Full Text: DOI arXiv
Jansen, Klaus; Rohwedder, Lars A quasi-polynomial approximation for the restricted assignment problem. (English) Zbl 1495.90072 SIAM J. Comput. 49, No. 6, 1083-1108 (2020). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{K. Jansen} and \textit{L. Rohwedder}, SIAM J. Comput. 49, No. 6, 1083--1108 (2020; Zbl 1495.90072) Full Text: DOI
García-Soriano, David; Bonchi, Francesco Fair-by-design matching. (English) Zbl 1458.91144 Data Min. Knowl. Discov. 34, No. 5, 1291-1335 (2020). MSC: 91B68 90C27 PDFBibTeX XMLCite \textit{D. García-Soriano} and \textit{F. Bonchi}, Data Min. Knowl. Discov. 34, No. 5, 1291--1335 (2020; Zbl 1458.91144) Full Text: DOI arXiv
Bienkowski, Marcin; Böhm, Martin; Byrka, Jaroslaw; Chrobak, Marek; Dürr, Christoph; Folwarczný, Lukáš; Jeż, Łukasz; Sgall, Jiří; Thang, Nguyen Kim; Veselý, Pavel Online algorithms for multilevel aggregation. (English) Zbl 1445.90019 Oper. Res. 68, No. 1, 214-232 (2020). MSC: 90B22 68W27 PDFBibTeX XMLCite \textit{M. Bienkowski} et al., Oper. Res. 68, No. 1, 214--232 (2020; Zbl 1445.90019) Full Text: DOI Link
Batra, Jatin; Garg, Naveen; Kumar, Amit Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time. (English) Zbl 1479.90077 SIAM J. Comput. 49, No. 5, FOCS18-158-FOCS18-188 (2020). MSC: 90B35 90C39 PDFBibTeX XMLCite \textit{J. Batra} et al., SIAM J. Comput. 49, No. 5, FOCS18--158-FOCS18--188 (2020; Zbl 1479.90077) Full Text: DOI arXiv