Khartov, A. A.; Limar, I. A. Asymptotic analysis in multivariate worst case approximation with Gaussian kernels. (English) Zbl 07820046 J. Complexity 82, Article ID 101838, 16 p. (2024). MSC: 41A63 41A65 41A25 65J10 65Y20 PDFBibTeX XMLCite \textit{A. A. Khartov} and \textit{I. A. Limar}, J. Complexity 82, Article ID 101838, 16 p. (2024; Zbl 07820046) Full Text: DOI arXiv
Jaykrishnan, G.; Levin, Asaf EPTAS for parallel identical machine scheduling with time restrictions. (English) Zbl 07812589 J. Comb. Optim. 47, No. 2, Paper No. 10, 21 p. (2024). MSC: 90Cxx PDFBibTeX XMLCite \textit{G. Jaykrishnan} and \textit{A. Levin}, J. Comb. Optim. 47, No. 2, Paper No. 10, 21 p. (2024; Zbl 07812589) Full Text: DOI arXiv OA License
Allen-Zhao, Zhihua; Xu, Fengmin; Dai, Yu-Hong; Liu, Sanyang Robust enhanced indexation optimization with sparse industry Layout constraint. (English) Zbl 07765530 Comput. Oper. Res. 161, Article ID 106420, 12 p. (2024). MSC: 90Bxx PDFBibTeX XMLCite \textit{Z. Allen-Zhao} et al., Comput. Oper. Res. 161, Article ID 106420, 12 p. (2024; Zbl 07765530) Full Text: DOI
Colla, Sebastien; Hendrickx, Julien M. Automatic performance estimation for decentralized optimization. (English) Zbl 07810958 IEEE Trans. Autom. Control 68, No. 12, 7136-7150 (2023). MSC: 93-XX PDFBibTeX XMLCite \textit{S. Colla} and \textit{J. M. Hendrickx}, IEEE Trans. Autom. Control 68, No. 12, 7136--7150 (2023; Zbl 07810958) Full Text: DOI arXiv
Dinh, Nho Minh; Archetti, Claudia; Bertazzi, Luca The inventory routing problem with split deliveries. (English) Zbl 07791140 Networks 82, No. 4, 400-413 (2023). MSC: 90B05 90B06 90C57 PDFBibTeX XMLCite \textit{N. M. Dinh} et al., Networks 82, No. 4, 400--413 (2023; Zbl 07791140) Full Text: DOI OA License
Angelopoulos, Spyros; Dürr, Christoph; Jin, Shendan Best-of-both-worlds analysis of online search. (English) Zbl 07777571 Algorithmica 85, No. 12, 3766-3792 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S. Angelopoulos} et al., Algorithmica 85, No. 12, 3766--3792 (2023; Zbl 07777571) Full Text: DOI
Kuusisto, Antti; Rönnholm, Raine The optimal way to play the most difficult repeated two-player coordination games. (English) Zbl 07774877 Discrete Appl. Math. 339, 36-52 (2023). MSC: 91A20 91A05 PDFBibTeX XMLCite \textit{A. Kuusisto} and \textit{R. Rönnholm}, Discrete Appl. Math. 339, 36--52 (2023; Zbl 07774877) Full Text: DOI arXiv
Peng, Junqiang; Xiao, Mingyu Further improvements for SAT in terms of formula length. (English) Zbl 07742416 Inf. Comput. 294, Article ID 105085, 25 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Peng} and \textit{M. Xiao}, Inf. Comput. 294, Article ID 105085, 25 p. (2023; Zbl 07742416) Full Text: DOI
Hurkens, Cor Truly tight bounds for TSP heuristics. (English) Zbl 1525.90360 Oper. Res. Lett. 51, No. 4, 425-431 (2023). MSC: 90C27 05C45 90C35 90C59 PDFBibTeX XMLCite \textit{C. Hurkens}, Oper. Res. Lett. 51, No. 4, 425--431 (2023; Zbl 1525.90360) Full Text: DOI
Curtis, Frank E.; Wang, Qi Worst-case complexity of TRACE with inexact subproblem solutions for nonconvex smooth optimization. (English) Zbl 1522.90119 SIAM J. Optim. 33, No. 3, 2191-2221 (2023). MSC: 90C26 65K05 65K10 65Y20 68Q25 90C30 90C60 PDFBibTeX XMLCite \textit{F. E. Curtis} and \textit{Q. Wang}, SIAM J. Optim. 33, No. 3, 2191--2221 (2023; Zbl 1522.90119) Full Text: DOI arXiv
Moucer, Céline; Taylor, Adrien; Bach, Francis A systematic approach to Lyapunov analyses of continuous-time models in convex optimization. (English) Zbl 1522.90102 SIAM J. Optim. 33, No. 3, 1558-1586 (2023). MSC: 90C25 90C30 68Q25 90C22 PDFBibTeX XMLCite \textit{C. Moucer} et al., SIAM J. Optim. 33, No. 3, 1558--1586 (2023; Zbl 1522.90102) Full Text: DOI arXiv
Teboulle, Marc; Vaisbourd, Yakov An elementary approach to tight worst case complexity analysis of gradient based methods. (English) Zbl 1522.90105 Math. Program. 201, No. 1-2 (A), 63-96 (2023). MSC: 90C25 90C30 90C60 68Q25 PDFBibTeX XMLCite \textit{M. Teboulle} and \textit{Y. Vaisbourd}, Math. Program. 201, No. 1--2 (A), 63--96 (2023; Zbl 1522.90105) Full Text: DOI
Tang, Qihe; Yang, Yunshen Worst-case moments under partial ambiguity. (English) Zbl 1520.91351 ASTIN Bull. 53, No. 2, 443-465 (2023). MSC: 91G05 PDFBibTeX XMLCite \textit{Q. Tang} and \textit{Y. Yang}, ASTIN Bull. 53, No. 2, 443--465 (2023; Zbl 1520.91351) Full Text: DOI
Ou, Jinwen; Lu, Lingfa; Zhong, Xueling Parallel-batch scheduling with rejection: structural properties and approximation algorithms. (English) Zbl 07709899 Eur. J. Oper. Res. 310, No. 3, 1017-1032 (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{J. Ou} et al., Eur. J. Oper. Res. 310, No. 3, 1017--1032 (2023; Zbl 07709899) Full Text: DOI
Mana, Fatima Ezzahra; Guépié, Blaise Kévin; Nikiforov, Igor Sequential detection of an arbitrary transient change profile by the FMA test. (English) Zbl 07708159 Sequential Anal. 42, No. 2, 91-111 (2023). MSC: 62L10 62L15 60G40 62F05 62P30 PDFBibTeX XMLCite \textit{F. E. Mana} et al., Sequential Anal. 42, No. 2, 91--111 (2023; Zbl 07708159) Full Text: DOI
Berndt, Sebastian; Epstein, Leah; Jansen, Klaus; Levin, Asaf; Maack, Marten; Rohwedder, Lars Online bin covering with limited migration. (English) Zbl 07661815 J. Comput. Syst. Sci. 134, 42-72 (2023). MSC: 68W27 90C27 PDFBibTeX XMLCite \textit{S. Berndt} et al., J. Comput. Syst. Sci. 134, 42--72 (2023; Zbl 07661815) Full Text: DOI
Gerbner, Dániel; Lenger, Dániel; Vizer, Máté A plurality problem with three colors and query size three. (English) Zbl 1502.05012 Discrete Math. 346, No. 1, Article ID 113151, 18 p. (2023). MSC: 05A15 68Q25 PDFBibTeX XMLCite \textit{D. Gerbner} et al., Discrete Math. 346, No. 1, Article ID 113151, 18 p. (2023; Zbl 1502.05012) Full Text: DOI arXiv
Bertazzi, Luca; Wang, Xingyin Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem. (English) Zbl 07776619 Networks 80, No. 4, 482-501 (2022). MSC: 90Cxx PDFBibTeX XMLCite \textit{L. Bertazzi} and \textit{X. Wang}, Networks 80, No. 4, 482--501 (2022; Zbl 07776619) Full Text: DOI
Wu, Yuanxiao; Lu, Xiwen A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line. (English) Zbl 1502.90029 J. Syst. Sci. Complex. 35, No. 5, 1902-1909 (2022). MSC: 90B06 68W25 90B10 PDFBibTeX XMLCite \textit{Y. Wu} and \textit{X. Lu}, J. Syst. Sci. Complex. 35, No. 5, 1902--1909 (2022; Zbl 1502.90029) Full Text: DOI
Levin, Asaf Comparing the costs of any fit algorithms for bin packing. (English) Zbl 1525.90252 Oper. Res. Lett. 50, No. 6, 646-649 (2022). MSC: 90B80 68W27 90C59 90C60 PDFBibTeX XMLCite \textit{A. Levin}, Oper. Res. Lett. 50, No. 6, 646--649 (2022; Zbl 1525.90252) Full Text: DOI
Amaral, V. S.; Andreani, R.; Birgin, E. G.; Marcondes, D. S.; Martínez, J. M. On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization. (English) Zbl 1504.90147 J. Glob. Optim. 84, No. 3, 527-561 (2022). MSC: 90C30 65K05 49M37 90C60 68Q25 PDFBibTeX XMLCite \textit{V. S. Amaral} et al., J. Glob. Optim. 84, No. 3, 527--561 (2022; Zbl 1504.90147) Full Text: DOI arXiv
Wu, Yuanxiao; Lu, Xiwen Capacitated vehicle routing problem on line with unsplittable demands. (English) Zbl 1502.90160 J. Comb. Optim. 44, No. 3, 1953-1963 (2022). MSC: 90C27 90B06 90C59 PDFBibTeX XMLCite \textit{Y. Wu} and \textit{X. Lu}, J. Comb. Optim. 44, No. 3, 1953--1963 (2022; Zbl 1502.90160) Full Text: DOI
Ahookhosh, Masoud; Fleming, Ronan M. T.; Vuong, Phan T. Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg-Marquardt methods. (English) Zbl 1501.90069 Optim. Methods Softw. 37, No. 1, 113-149 (2022). MSC: 90C26 68Q25 65K05 PDFBibTeX XMLCite \textit{M. Ahookhosh} et al., Optim. Methods Softw. 37, No. 1, 113--149 (2022; Zbl 1501.90069) Full Text: DOI arXiv
Andreozzi, Matteo; Frangioni, Antonio; Galli, Laura; Stea, Giovanni; Zippo, Raffaele A MILP approach to DRAM access worst-case analysis. (English) Zbl 1511.68022 Comput. Oper. Res. 143, Article ID 105774, 15 p. (2022). MSC: 68M07 68M20 90C11 PDFBibTeX XMLCite \textit{M. Andreozzi} et al., Comput. Oper. Res. 143, Article ID 105774, 15 p. (2022; Zbl 1511.68022) Full Text: DOI
Zhong, Xueling; Fan, Jie; Ou, Jinwen Coordinated scheduling of the outsourcing, in-house production and distribution operations. (English) Zbl 1507.90074 Eur. J. Oper. Res. 302, No. 2, 427-437 (2022). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{X. Zhong} et al., Eur. J. Oper. Res. 302, No. 2, 427--437 (2022; Zbl 1507.90074) Full Text: DOI
Foucart, Simon; Liao, Chunyang; Shahrampour, Shahin; Wang, Yinsong Learning from non-random data in Hilbert spaces: an optimal recovery perspective. (English) Zbl 1498.46078 Sampl. Theory Signal Process. Data Anal. 20, No. 1, Paper No. 5, 19 p. (2022). MSC: 46N40 90C22 90C47 68T05 PDFBibTeX XMLCite \textit{S. Foucart} et al., Sampl. Theory Signal Process. Data Anal. 20, No. 1, Paper No. 5, 19 p. (2022; Zbl 1498.46078) Full Text: DOI arXiv
Curtis, Frank E.; Dai, Yutong; Robinson, Daniel P. A subspace acceleration method for minimization involving a group sparsity-inducing regularizer. (English) Zbl 1491.90157 SIAM J. Optim. 32, No. 2, 545-572 (2022). MSC: 90C30 90C25 65K05 65K10 65Y20 68Q25 90C60 PDFBibTeX XMLCite \textit{F. E. Curtis} et al., SIAM J. Optim. 32, No. 2, 545--572 (2022; Zbl 1491.90157) Full Text: DOI arXiv
Christofides, Nicos Worst-case analysis of a new heuristic for the travelling salesman problem. (English) Zbl 1489.90150 SN Oper. Res. Forum 3, No. 1, Paper No. 20, 4 p. (2022). MSC: 90C27 90C59 90C60 PDFBibTeX XMLCite \textit{N. Christofides}, SN Oper. Res. Forum 3, No. 1, Paper No. 20, 4 p. (2022; Zbl 1489.90150) Full Text: DOI
Bertazzi, Luca; Chua, Geoffrey A.; Laganà, Demetrio; Paradiso, Rosario Analysis of effective sets of routes for the split-delivery periodic inventory routing problem. (English) Zbl 1490.90011 Eur. J. Oper. Res. 298, No. 2, 463-477 (2022). MSC: 90B05 90B06 90C59 PDFBibTeX XMLCite \textit{L. Bertazzi} et al., Eur. J. Oper. Res. 298, No. 2, 463--477 (2022; Zbl 1490.90011) Full Text: DOI
Bellavia, Stefania; Gurioli, Gianmarco Stochastic analysis of an adaptive cubic regularization method under inexact gradient evaluations and dynamic Hessian accuracy. (English) Zbl 1483.65091 Optimization 71, No. 1, 227-261 (2022). MSC: 65K05 90C30 90C53 PDFBibTeX XMLCite \textit{S. Bellavia} and \textit{G. Gurioli}, Optimization 71, No. 1, 227--261 (2022; Zbl 1483.65091) Full Text: DOI arXiv
Gudapati, Naga V. C.; Malaguti, Enrico; Monaci, Michele In search of dense subgraphs: how good is greedy peeling? (English) Zbl 07775310 Networks 77, No. 4, 572-586 (2021). MSC: 90Cxx PDFBibTeX XMLCite \textit{N. V. C. Gudapati} et al., Networks 77, No. 4, 572--586 (2021; Zbl 07775310) Full Text: DOI arXiv OA License
Vieira, Hiparco Lins; Beck, André Teófilo; da Silva, Maíra Martins Combined interval analysis – Monte Carlo simulation approach for the analysis of uncertainties in parallel manipulators. (English) Zbl 1520.74082 Meccanica 56, No. 7, 1867-1881 (2021). MSC: 74S60 74R10 65G40 62N05 PDFBibTeX XMLCite \textit{H. L. Vieira} et al., Meccanica 56, No. 7, 1867--1881 (2021; Zbl 1520.74082) Full Text: DOI
Lykouris, Thodoris; Vassilvitskii, Sergei Competitive caching with machine learned advice. (English) Zbl 1499.68415 J. ACM 68, No. 4, Paper No. 24, 25 p. (2021). MSC: 68W27 68T05 PDFBibTeX XMLCite \textit{T. Lykouris} and \textit{S. Vassilvitskii}, J. ACM 68, No. 4, Paper No. 24, 25 p. (2021; Zbl 1499.68415) Full Text: DOI arXiv
Khanna, Yash; Louis, Anand; Paul, Rameesh Independent sets in semi-random hypergraphs. (English) Zbl 07498701 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 528-542 (2021). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{Y. Khanna} et al., Lect. Notes Comput. Sci. 12808, 528--542 (2021; Zbl 07498701) Full Text: DOI arXiv
Boczkowski, Lucas; Feige, Uriel; Korman, Amos; Rodeh, Yoav Navigating in trees with permanently noisy advice. (English) Zbl 07475094 ACM Trans. Algorithms 17, No. 2, Article No. 15, 27 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{L. Boczkowski} et al., ACM Trans. Algorithms 17, No. 2, Article No. 15, 27 p. (2021; Zbl 07475094) Full Text: DOI
Oliveira, I. F. D.; Takahashi, R. H. C. An enhancement of the bisection method average performance preserving minmax optimality. (English) Zbl 07467965 ACM Trans. Math. Softw. 47, No. 1, Article No. 5, 24 p. (2021). MSC: 65-XX PDFBibTeX XMLCite \textit{I. F. D. Oliveira} and \textit{R. H. C. Takahashi}, ACM Trans. Math. Softw. 47, No. 1, Article No. 5, 24 p. (2021; Zbl 07467965) Full Text: DOI
Li, Rongqi; Tan, Zhiyi; Zhu, Qianyu Batch scheduling of nonidentical job sizes with minsum criteria. (English) Zbl 1481.90178 J. Comb. Optim. 42, No. 3, 543-564 (2021). MSC: 90B35 90C27 68Q25 68M20 PDFBibTeX XMLCite \textit{R. Li} et al., J. Comb. Optim. 42, No. 3, 543--564 (2021; Zbl 1481.90178) Full Text: DOI
Xiao, Peijun; Xiao, Zhisheng; Sun, Ruoyu Two symmetrized coordinate descent methods can be \(O(n^2)\) times slower than the randomized version. (English) Zbl 1480.90196 SIAM J. Optim. 31, No. 4, 2726-2752 (2021). MSC: 90C25 65K05 68Q25 PDFBibTeX XMLCite \textit{P. Xiao} et al., SIAM J. Optim. 31, No. 4, 2726--2752 (2021; Zbl 1480.90196) Full Text: DOI
Zhang, Jie A note on EC-tractability of multivariate approximation in weighted Korobov spaces for the standard information class. (English) Zbl 1528.41087 J. Complexity 67, Article ID 101573, 16 p. (2021). MSC: 41A63 65Y20 68Q25 PDFBibTeX XMLCite \textit{J. Zhang}, J. Complexity 67, Article ID 101573, 16 p. (2021; Zbl 1528.41087) Full Text: DOI
Kim, Donghwan Accelerated proximal point method for maximally monotone operators. (English) Zbl 1478.90089 Math. Program. 190, No. 1-2 (A), 57-87 (2021). MSC: 90C25 90C30 90C60 68Q25 49M25 90C22 PDFBibTeX XMLCite \textit{D. Kim}, Math. Program. 190, No. 1--2 (A), 57--87 (2021; Zbl 1478.90089) Full Text: DOI arXiv
Boix-Adserà, Enric; Brennan, Matthew; Bresler, Guy The average-case complexity of counting cliques in Erdös-Rényi hypergraphs. (English) Zbl 1528.68276 SIAM J. Comput. 50, No. 5, FOCS19-39-FOCS19-80 (2021). MSC: 68R10 05C65 05C80 05C85 68Q25 PDFBibTeX XMLCite \textit{E. Boix-Adserà} et al., SIAM J. Comput. 50, No. 5, FOCS19--39-FOCS19--80 (2021; Zbl 1528.68276) Full Text: DOI arXiv
Bertazzi, Luca; Ohlmann, Jeffrey W. Direct \(k\)-routing versus cross-docking: worst-case results. (English) Zbl 1471.90022 Optim. Lett. 15, No. 5, 1579-1586 (2021). MSC: 90B06 PDFBibTeX XMLCite \textit{L. Bertazzi} and \textit{J. W. Ohlmann}, Optim. Lett. 15, No. 5, 1579--1586 (2021; Zbl 1471.90022) Full Text: DOI
Jiang, Xiaojuan; Zhang, An; Chen, Yong; Chen, Guangting; Lee, Kangbok An improved algorithm for a two-stage production scheduling problem with an outsourcing option. (English) Zbl 1504.90059 Theor. Comput. Sci. 876, 59-69 (2021). MSC: 90B35 68W25 68W40 PDFBibTeX XMLCite \textit{X. Jiang} et al., Theor. Comput. Sci. 876, 59--69 (2021; Zbl 1504.90059) Full Text: DOI
Mittermayr, Robert; Blieberger, Johann Deadlock and WCET analysis of barrier-synchronized concurrent programs. (English) Zbl 1473.68050 Computing 103, No. 5, 749-770 (2021). MSC: 68N30 68Q85 PDFBibTeX XMLCite \textit{R. Mittermayr} and \textit{J. Blieberger}, Computing 103, No. 5, 749--770 (2021; Zbl 1473.68050) Full Text: DOI
Kim, Donghwan; Fessler, Jeffrey A. Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions. (English) Zbl 1468.90085 J. Optim. Theory Appl. 188, No. 1, 192-219 (2021). MSC: 90C25 90C30 90C60 68Q25 49M25 90C22 PDFBibTeX XMLCite \textit{D. Kim} and \textit{J. A. Fessler}, J. Optim. Theory Appl. 188, No. 1, 192--219 (2021; Zbl 1468.90085) Full Text: DOI arXiv
Curtis, Frank E.; Robinson, Daniel P. Regional complexity analysis of algorithms for nonconvex smooth optimization. (English) Zbl 1465.90069 Math. Program. 187, No. 1-2 (A), 579-615 (2021). MSC: 90C26 90C60 65K05 65K10 65Y20 68Q25 PDFBibTeX XMLCite \textit{F. E. Curtis} and \textit{D. P. Robinson}, Math. Program. 187, No. 1--2 (A), 579--615 (2021; Zbl 1465.90069) Full Text: DOI arXiv
Bellavia, Stefania; Gurioli, Gianmarco; Morini, Benedetta Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization. (English) Zbl 1460.65076 IMA J. Numer. Anal. 41, No. 1, 764-799 (2021). MSC: 65K10 PDFBibTeX XMLCite \textit{S. Bellavia} et al., IMA J. Numer. Anal. 41, No. 1, 764--799 (2021; Zbl 1460.65076) Full Text: DOI arXiv
Wei, Alexander Better and simpler learning-augmented online caching. (English) Zbl 07758362 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 60, 17 p. (2020). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{A. Wei}, LIPIcs -- Leibniz Int. Proc. Inform. 176, Article 60, 17 p. (2020; Zbl 07758362) Full Text: DOI arXiv
Xu, Jin; Gautam, Natarajan On competitive analysis for polling systems. (English) Zbl 1523.90093 Nav. Res. Logist. 67, No. 6, 404-419 (2020). MSC: 90B22 90B35 PDFBibTeX XMLCite \textit{J. Xu} and \textit{N. Gautam}, Nav. Res. Logist. 67, No. 6, 404--419 (2020; Zbl 1523.90093) Full Text: DOI arXiv
Makarychev, Konstantin; Makarychev, Yury Certified algorithms: worst-case analysis and beyond. (English) Zbl 07650397 Vidick, Thomas (ed.), 11th innovations in theoretical computer science conference, ITCS 2020, Seattle, Washington, USA, January 12–14, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 151, Article 49, 14 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{K. Makarychev} and \textit{Y. Makarychev}, LIPIcs -- Leibniz Int. Proc. Inform. 151, Article 49, 14 p. (2020; Zbl 07650397) Full Text: DOI
Gonopolskiy, M. G.; Glonina, A. B. Research and development of an algorithm for the response time estimation in multiprocessor systems under the interval uncertainty of the tasks execution times. (Russian. English summary) Zbl 1513.68005 Model. Anal. Inf. Sist. 27, No. 2, 218-233 (2020). MSC: 68M20 68W50 PDFBibTeX XMLCite \textit{M. G. Gonopolskiy} and \textit{A. B. Glonina}, Model. Anal. Inf. Sist. 27, No. 2, 218--233 (2020; Zbl 1513.68005) Full Text: DOI MNR
Sripratak, Piyashat Worst case analysis of nearest neighbour algorithms for the minimum weighted directed \(k\)-cycle problem. (English) Zbl 1476.90290 Thai J. Math. 18, No. 4, 1881-1894 (2020). MSC: 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{P. Sripratak}, Thai J. Math. 18, No. 4, 1881--1894 (2020; Zbl 1476.90290) Full Text: Link
Xu, Dehua; Xu, Limin; Xu, Zhijun Single machine scheduling problem with a flexible maintenance revisited. (English) Zbl 07370002 Li, Minming (ed.), Frontiers in algorithmics. 14th international workshop, FAW 2020, Haikou, China, October 19–21, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12340, 74-82 (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{D. Xu} et al., Lect. Notes Comput. Sci. 12340, 74--82 (2020; Zbl 07370002) Full Text: DOI
Balcan, Maria-Florina; Haghtalab, Nika; White, Colin \(k\)-center clustering under perturbation resilience. (English) Zbl 1484.68066 ACM Trans. Algorithms 16, No. 2, Article No. 22, 39 p. (2020). MSC: 68Q25 68Q17 68W25 PDFBibTeX XMLCite \textit{M.-F. Balcan} et al., ACM Trans. Algorithms 16, No. 2, Article No. 22, 39 p. (2020; Zbl 1484.68066) Full Text: DOI
Ageev, Alexander; Ivanov, Mikhail An improved approximation algorithm for the coupled-task scheduling problem with equal exact delays. (English) Zbl 1460.90082 Kononov, Alexander (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12095, 265-273 (2020). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{A. Ageev} and \textit{M. Ivanov}, Lect. Notes Comput. Sci. 12095, 265--273 (2020; Zbl 1460.90082) Full Text: DOI
Epstein, Leah; Levin, Asaf A note on a variant of the online open end bin packing problem. (English) Zbl 1525.90352 Oper. Res. Lett. 48, No. 6, 844-849 (2020). MSC: 90C27 90B80 PDFBibTeX XMLCite \textit{L. Epstein} and \textit{A. Levin}, Oper. Res. Lett. 48, No. 6, 844--849 (2020; Zbl 1525.90352) Full Text: DOI
Ageev, Alexander; Kononov, Alexander A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem. (English) Zbl 1460.90147 Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1275, 3-15 (2020). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{A. Ageev} and \textit{A. Kononov}, Commun. Comput. Inf. Sci. 1275, 3--15 (2020; Zbl 1460.90147) Full Text: DOI
Bertazzi, Luca; Secomandi, Nicola Technical note: Worst-case benefit of restocking for the vehicle routing problem with stochastic demands. (English) Zbl 1445.90008 Oper. Res. 68, No. 3, 671-675 (2020). MSC: 90B06 PDFBibTeX XMLCite \textit{L. Bertazzi} and \textit{N. Secomandi}, Oper. Res. 68, No. 3, 671--675 (2020; Zbl 1445.90008) Full Text: DOI
Wang, Yizhan; Zhang, An; Chen, Yong; Chen, Guangting An approximation algorithm for reclaimer scheduling. (Chinese. English summary) Zbl 1463.90078 Oper. Res. Trans. 24, No. 1, 147-154 (2020). MSC: 90B35 90C59 68W25 PDFBibTeX XMLCite \textit{Y. Wang} et al., Oper. Res. Trans. 24, No. 1, 147--154 (2020; Zbl 1463.90078) Full Text: DOI
Chen, Qianzhu; Hu, Haiping Optimizing the efficiency of first-order methods for the distance to an optimal solution of smooth convex functions. (Chinese. English summary) Zbl 1463.90155 J. Shandong Univ., Nat. Sci. 55, No. 4, 102-107 (2020). MSC: 90C25 PDFBibTeX XMLCite \textit{Q. Chen} and \textit{H. Hu}, J. Shandong Univ., Nat. Sci. 55, No. 4, 102--107 (2020; Zbl 1463.90155)
Long, Yan Optimal budget-balanced ranking mechanisms to assign identical objects. (English) Zbl 1450.91018 Econ. Theory 70, No. 2, 467-502 (2020). MSC: 91B32 91B03 PDFBibTeX XMLCite \textit{Y. Long}, Econ. Theory 70, No. 2, 467--502 (2020; Zbl 1450.91018) Full Text: DOI
Cornelissen, Kamiel; Manthey, Bodo Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm. (English) Zbl 1477.90117 J. Graph Algorithms Appl. 24, No. 3, 397-421 (2020). Reviewer: Erwin Pesch (Siegen) MSC: 90C35 PDFBibTeX XMLCite \textit{K. Cornelissen} and \textit{B. Manthey}, J. Graph Algorithms Appl. 24, No. 3, 397--421 (2020; Zbl 1477.90117) Full Text: DOI
Burr, Michael; Gao, Shuhong; Tsigaridas, Elias The complexity of subdivision for diameter-distance tests. (English) Zbl 1444.68274 J. Symb. Comput. 101, 1-27 (2020). MSC: 68U05 14Q20 68W30 68W40 PDFBibTeX XMLCite \textit{M. Burr} et al., J. Symb. Comput. 101, 1--27 (2020; Zbl 1444.68274) Full Text: DOI arXiv
Li, Dawei; Lu, Xiwen Two-machine flow shop scheduling with an operator non-availability period to minimize makespan. (English) Zbl 1442.90077 J. Comb. Optim. 39, No. 4, 1060-1078 (2020). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{D. Li} and \textit{X. Lu}, J. Comb. Optim. 39, No. 4, 1060--1078 (2020; Zbl 1442.90077) Full Text: DOI
Karvonen, Toni; Särkkä, Simo Worst-case optimal approximation with increasingly flat Gaussian kernels. (English) Zbl 07189703 Adv. Comput. Math. 46, No. 2, Paper No. 21, 17 p. (2020). MSC: 65-XX 41A05 41A30 46E22 65D05 65D32 PDFBibTeX XMLCite \textit{T. Karvonen} and \textit{S. Särkkä}, Adv. Comput. Math. 46, No. 2, Paper No. 21, 17 p. (2020; Zbl 07189703) Full Text: DOI arXiv
Xu, Guiqiao EC-tractability of \(\mathbb{L}_p\)-approximation in Korobov spaces with exponential weights. (English) Zbl 1429.41032 J. Approx. Theory 249, Article ID 105309, 20 p. (2020). Reviewer: Martin D. Buhmann (Gießen) MSC: 41A63 65Y20 68Q25 PDFBibTeX XMLCite \textit{G. Xu}, J. Approx. Theory 249, Article ID 105309, 20 p. (2020; Zbl 1429.41032) Full Text: DOI
Louis, Anand; Venkat, Rakesh Planted models for \(k\)-way edge and vertex expansion. (English) Zbl 07650320 Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 23, 15 p. (2019). MSC: 68N30 68Qxx PDFBibTeX XMLCite \textit{A. Louis} and \textit{R. Venkat}, LIPIcs -- Leibniz Int. Proc. Inform. 150, Article 23, 15 p. (2019; Zbl 07650320) Full Text: DOI arXiv
Xie, Shaojun; Pan, Baisong; Du, Xiaoping An inverse reliability analysis method for reliability-based design optimization with random and dependent interval variables constrained within ellipsoids. (English) Zbl 1523.90113 Eng. Optim. 51, No. 12, 2109-2126 (2019). MSC: 90B25 90C15 PDFBibTeX XMLCite \textit{S. Xie} et al., Eng. Optim. 51, No. 12, 2109--2126 (2019; Zbl 1523.90113) Full Text: DOI
Nasri, Mitra; Nelissen, Geoffrey; Brandenburg, Björn B. Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling. (English) Zbl 07559355 Quinton, Sophie (ed.), 31st Euromicro conference on real-time systems, ECRTS 2019, Stuttgart, Germany, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 133, Article 21, 23 p. (2019). MSC: 68M20 PDFBibTeX XMLCite \textit{M. Nasri} et al., LIPIcs -- Leibniz Int. Proc. Inform. 133, Article 21, 23 p. (2019; Zbl 07559355) Full Text: DOI
Angelidakis, Haris; Awasthi, Pranjal; Blum, Avrim; Chatziafratis, Vaggos; Dan, Chen Bilu-Linial stability, certified algorithms and the independent set problem. (English) Zbl 07525444 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 7, 16 p. (2019). MSC: 68Wxx PDFBibTeX XMLCite \textit{H. Angelidakis} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 7, 16 p. (2019; Zbl 07525444) Full Text: DOI arXiv
Tang, Lixin; Li, Feng; Chen, Zhi-Long Integrated scheduling of production and two-stage delivery of make-to-order products: offline and online algorithms. (English) Zbl 1451.90071 INFORMS J. Comput. 31, No. 3, 493-514 (2019). MSC: 90B35 90C39 90C59 68W27 PDFBibTeX XMLCite \textit{L. Tang} et al., INFORMS J. Comput. 31, No. 3, 493--514 (2019; Zbl 1451.90071) Full Text: DOI
Levi, Retsef; Perakis, Georgia; Romero, Gonzalo Near-optimality of uniform copayments for subsidies and taxes allocation problems. (English) Zbl 1444.90065 Oper. Res. 67, No. 2, 548-561 (2019). MSC: 90B50 91B54 PDFBibTeX XMLCite \textit{R. Levi} et al., Oper. Res. 67, No. 2, 548--561 (2019; Zbl 1444.90065) Full Text: DOI Link
Zhang, Jie; Liu, Yongping Quasi-Monte Carlo tractability of integration problem in function spaces defined over products of balls. (English) Zbl 07140040 Int. J. Wavelets Multiresolut. Inf. Process. 17, No. 6, Article ID 1950043, 20 p. (2019). MSC: 65-XX 41A63 65Y20 68Q25 PDFBibTeX XMLCite \textit{J. Zhang} and \textit{Y. Liu}, Int. J. Wavelets Multiresolut. Inf. Process. 17, No. 6, Article ID 1950043, 20 p. (2019; Zbl 07140040) Full Text: DOI
Maggioni, Francesca; Cagnolari, Matteo; Bertazzi, Luca The value of the right distribution in stochastic programming with application to a Newsvendor problem. (English) Zbl 07137452 Comput. Manag. Sci. 16, No. 4, 739-758 (2019). MSC: 90Bxx PDFBibTeX XMLCite \textit{F. Maggioni} et al., Comput. Manag. Sci. 16, No. 4, 739--758 (2019; Zbl 07137452) Full Text: DOI
Liu, Yongping; Zhang, Jie EC-tractability of approximation problems in function spaces defined over products of simplices. (English) Zbl 07134889 J. Complexity 55, Article ID 101411, 25 p. (2019). MSC: 65-XX 41-XX PDFBibTeX XMLCite \textit{Y. Liu} and \textit{J. Zhang}, J. Complexity 55, Article ID 101411, 25 p. (2019; Zbl 07134889) Full Text: DOI
Kulikov, Alexander S.; Podolskii, Vladimir V. Computing majority by constant depth majority circuits with low fan-in gates. (English) Zbl 1429.68082 Theory Comput. Syst. 63, No. 5, 956-986 (2019). MSC: 68Q25 68Q06 68Q17 68W20 94C11 PDFBibTeX XMLCite \textit{A. S. Kulikov} and \textit{V. V. Podolskii}, Theory Comput. Syst. 63, No. 5, 956--986 (2019; Zbl 1429.68082) Full Text: DOI Link
Li, Feng; Zhang, Yanyan; Wei, Han; Lai, Xiaofan Integrated problem of soaking pit heating and hot rolling scheduling in steel plants. (English) Zbl 1458.90319 Comput. Oper. Res. 108, 238-246 (2019). MSC: 90B35 90C39 90C57 PDFBibTeX XMLCite \textit{F. Li} et al., Comput. Oper. Res. 108, 238--246 (2019; Zbl 1458.90319) Full Text: DOI
Absi, Nabil; van den Heuvel, Wilco Worst case analysis of relax and fix heuristics for lot-sizing problems. (English) Zbl 1430.90005 Eur. J. Oper. Res. 279, No. 2, 449-458 (2019). MSC: 90B05 90B30 90C11 90C59 PDFBibTeX XMLCite \textit{N. Absi} and \textit{W. van den Heuvel}, Eur. J. Oper. Res. 279, No. 2, 449--458 (2019; Zbl 1430.90005) Full Text: DOI
Ho, Johnny C.; Massabò, Ivar; Paletta, Giuseppe; Ruiz-Torres, Alex J. A note on posterior tight worst-case bounds for longest processing time schedules. (English) Zbl 1410.68068 4OR 17, No. 1, 97-107 (2019). MSC: 68M20 90B35 PDFBibTeX XMLCite \textit{J. C. Ho} et al., 4OR 17, No. 1, 97--107 (2019; Zbl 1410.68068) Full Text: DOI
Bertazzi, Luca; Golden, Bruce; Wang, Xingyin The bin packing problem with item fragmentation: a worst-case analysis. (English) Zbl 1420.90057 Discrete Appl. Math. 261, 63-77 (2019). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{L. Bertazzi} et al., Discrete Appl. Math. 261, 63--77 (2019; Zbl 1420.90057) Full Text: DOI
Cartis, Coralia; Gould, Nick I.; Toint, Philippe L. Universal regularization methods: varying the power, the smoothness and the accuracy. (English) Zbl 1436.90136 SIAM J. Optim. 29, No. 1, 595-615 (2019). Reviewer: Nada Djuranović-Miličić (Belgrade) MSC: 90C30 65K05 PDFBibTeX XMLCite \textit{C. Cartis} et al., SIAM J. Optim. 29, No. 1, 595--615 (2019; Zbl 1436.90136) Full Text: DOI arXiv
Fekete, Sándor P.; Morr, Sebastian; Scheffer, Christian Split packing: algorithms for packing circles with optimal worst-case density. (English) Zbl 1411.90046 Discrete Comput. Geom. 61, No. 3, 562-594 (2019). MSC: 68U05 68W25 90C59 PDFBibTeX XMLCite \textit{S. P. Fekete} et al., Discrete Comput. Geom. 61, No. 3, 562--594 (2019; Zbl 1411.90046) Full Text: DOI arXiv
Chekuri, Chandra; Gupta, Shalmoli Perturbation resilient clustering for k-center and related problems via LP relaxations. (English) Zbl 1521.68269 Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 9, 16 p. (2018). MSC: 68W40 62H30 PDFBibTeX XMLCite \textit{C. Chekuri} and \textit{S. Gupta}, LIPIcs -- Leibniz Int. Proc. Inform. 116, Article 9, 16 p. (2018; Zbl 1521.68269) Full Text: DOI arXiv
Louis, Anand; Venkat, Rakesh Semi-random graphs with planted sparse vertex cuts: algorithms for exact and approximate recovery. (English) Zbl 1499.68285 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 101, 15 p. (2018). MSC: 68R10 68W25 68W40 PDFBibTeX XMLCite \textit{A. Louis} and \textit{R. Venkat}, LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 101, 15 p. (2018; Zbl 1499.68285) Full Text: DOI arXiv
Charikar, Moses; Solomon, Shay Fully dynamic almost-maximal matching: breaking the polynomial worst-case time barrier. (English) Zbl 1499.68261 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 33, 14 p. (2018). MSC: 68R10 05C70 05C85 68W20 68W25 68W40 PDFBibTeX XMLCite \textit{M. Charikar} and \textit{S. Solomon}, LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 33, 14 p. (2018; Zbl 1499.68261) Full Text: DOI
Nasri, Mitra; Nelissen, Geoffrey; Brandenburg, Björn B. A response-time analysis for non-preemptive job sets under global scheduling. (English) Zbl 1497.68067 Altmeyer, Sebastian (ed.), 30th Euromicro conference on real-time systems, ECRTS 2018, July 3rd–6th, 2018, Barcelona, Spain. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 106, Article 9, 23 p. (2018). MSC: 68M20 PDFBibTeX XMLCite \textit{M. Nasri} et al., LIPIcs -- Leibniz Int. Proc. Inform. 106, Article 9, 23 p. (2018; Zbl 1497.68067) Full Text: DOI
Preda, Valentin; Cieslak, Jérôme; Henry, David; Bennani, Samir; Falcoz, Alexandre Robust microvibration mitigation and pointing performance analysis for high stability spacecraft. (English) Zbl 1405.93177 Int. J. Robust Nonlinear Control 28, No. 18, 5688-5716 (2018). MSC: 93D09 93B35 93C95 93C15 70P05 PDFBibTeX XMLCite \textit{V. Preda} et al., Int. J. Robust Nonlinear Control 28, No. 18, 5688--5716 (2018; Zbl 1405.93177) Full Text: DOI
Choi, Junchul; Oh, Hyunok; Ha, Soonhoi A hybrid performance analysis technique for distributed real-time embedded systems. (English) Zbl 1398.68067 Real-Time Syst. 54, No. 3, 562-604 (2018). MSC: 68M20 PDFBibTeX XMLCite \textit{J. Choi} et al., Real-Time Syst. 54, No. 3, 562--604 (2018; Zbl 1398.68067) Full Text: DOI arXiv
Taylor, Adrien B.; Hendrickx, Julien M.; Glineur, François Exact worst-case convergence rates of the proximal gradient method for composite convex minimization. (English) Zbl 1394.90464 J. Optim. Theory Appl. 178, No. 2, 455-476 (2018). MSC: 90C25 90C22 90C20 PDFBibTeX XMLCite \textit{A. B. Taylor} et al., J. Optim. Theory Appl. 178, No. 2, 455--476 (2018; Zbl 1394.90464) Full Text: DOI arXiv
Liu, Yongping; Xu, Guiqiao; Zhang, Jie Exponential convergence of an approximation problem for infinitely differentiable multivariate functions. (English) Zbl 1396.41026 Math. Notes 103, No. 5, 769-779 (2018). MSC: 41A63 68Q25 PDFBibTeX XMLCite \textit{Y. Liu} et al., Math. Notes 103, No. 5, 769--779 (2018; Zbl 1396.41026) Full Text: DOI
Breger, Anna; Ehler, Martin; Gräf, Manuel Points on manifolds with asymptotically optimal covering radius. (English) Zbl 06911383 J. Complexity 48, 1-14 (2018). MSC: 65-XX 58-XX PDFBibTeX XMLCite \textit{A. Breger} et al., J. Complexity 48, 1--14 (2018; Zbl 06911383) Full Text: DOI arXiv
Bertazzi, Luca; Maggioni, Francesca A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach. (English) Zbl 1403.90082 Eur. J. Oper. Res. 267, No. 2, 555-569 (2018). MSC: 90B06 90C11 90C15 PDFBibTeX XMLCite \textit{L. Bertazzi} and \textit{F. Maggioni}, Eur. J. Oper. Res. 267, No. 2, 555--569 (2018; Zbl 1403.90082) Full Text: DOI
Liu, Changchun; Wang, Chenjie; Zhang, Zhi-hai; Zheng, Li Scheduling with job-splitting considering learning and the vital-few law. (English) Zbl 1391.90285 Comput. Oper. Res. 90, 264-274 (2018). MSC: 90B35 90C59 90C57 PDFBibTeX XMLCite \textit{C. Liu} et al., Comput. Oper. Res. 90, 264--274 (2018; Zbl 1391.90285) Full Text: DOI
Kim, Donghwan; Fessler, Jeffrey A. Generalizing the optimized gradient method for smooth convex minimization. (English) Zbl 1400.90245 SIAM J. Optim. 28, No. 2, 1920-1950 (2018). MSC: 90C25 90C30 90C60 68Q25 49M25 90C22 PDFBibTeX XMLCite \textit{D. Kim} and \textit{J. A. Fessler}, SIAM J. Optim. 28, No. 2, 1920--1950 (2018; Zbl 1400.90245) Full Text: DOI arXiv
Bertazzi, Luca; Mogre, Riccardo Dynamic expediting of an urgent order with uncertain progress. (English) Zbl 1403.90083 Eur. J. Oper. Res. 267, No. 1, 78-85 (2018). MSC: 90B06 90C15 90C39 PDFBibTeX XMLCite \textit{L. Bertazzi} and \textit{R. Mogre}, Eur. J. Oper. Res. 267, No. 1, 78--85 (2018; Zbl 1403.90083) Full Text: DOI Link
Curtis, Frank E.; Robinson, Daniel P.; Samadi, Mohammadreza Complexity analysis of a trust funnel algorithm for equality constrained optimization. (English) Zbl 1391.49056 SIAM J. Optim. 28, No. 2, 1533-1563 (2018). MSC: 49M15 49M37 65K05 65K10 65Y20 68Q25 90C30 90C60 PDFBibTeX XMLCite \textit{F. E. Curtis} et al., SIAM J. Optim. 28, No. 2, 1533--1563 (2018; Zbl 1391.49056) Full Text: DOI arXiv
Mokhtari, Aryan; Gürbüzbalaban, Mert; Ribeiro, Alejandro Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate. (English) Zbl 1390.90390 SIAM J. Optim. 28, No. 2, 1420-1447 (2018). MSC: 90C06 90C25 90C30 90C52 PDFBibTeX XMLCite \textit{A. Mokhtari} et al., SIAM J. Optim. 28, No. 2, 1420--1447 (2018; Zbl 1390.90390) Full Text: DOI arXiv
Jiang, Dakui; Tan, Jiayin Scheduling with job delivery coordination on single machine. (English) Zbl 1400.90168 Optim. Lett. 12, No. 2, 265-272 (2018). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{D. Jiang} and \textit{J. Tan}, Optim. Lett. 12, No. 2, 265--272 (2018; Zbl 1400.90168) Full Text: DOI
Nicosia, Gaia; Pacifici, Andrea; Pferschy, Ulrich Competitive multi-agent scheduling with an iterative selection rule. (English) Zbl 1390.90321 4OR 16, No. 1, 15-29 (2018). MSC: 90B35 68M20 68Q25 91A06 PDFBibTeX XMLCite \textit{G. Nicosia} et al., 4OR 16, No. 1, 15--29 (2018; Zbl 1390.90321) Full Text: DOI
Vakhania, Nodari Probabilistic quality estimations for combinatorial optimization problems. (English) Zbl 1390.11133 Georgian Math. J. 25, No. 1, 123-134 (2018). MSC: 11Y16 68Q25 90B35 90B36 PDFBibTeX XMLCite \textit{N. Vakhania}, Georgian Math. J. 25, No. 1, 123--134 (2018; Zbl 1390.11133) Full Text: DOI