Benmansour, Rachid; Todosijević, Raca; Hanafi, Saïd Variable neighborhood search for the single machine scheduling problem to minimize the total early work. (English) Zbl 07762295 Optim. Lett. 17, No. 9, 2169-2184 (2023). MSC: 90B35 90C59 90C27 90C39 PDFBibTeX XMLCite \textit{R. Benmansour} et al., Optim. Lett. 17, No. 9, 2169--2184 (2023; Zbl 07762295) Full Text: DOI
Matijević, Luka; Jelić, Slobodan; Davidović, Tatjana General variable neighborhood search approach to group Steiner tree problem. (English) Zbl 07762291 Optim. Lett. 17, No. 9, 2087-2111 (2023). MSC: 90C35 90C27 90C59 PDFBibTeX XMLCite \textit{L. Matijević} et al., Optim. Lett. 17, No. 9, 2087--2111 (2023; Zbl 07762291) Full Text: DOI
Herrán, Alberto; Colmenar, J. Manuel; Mladenović, Nenad; Duarte, Abraham A general variable neighborhood search approach for the minimum load coloring problem. (English) Zbl 07762290 Optim. Lett. 17, No. 9, 2065-2086 (2023). MSC: 90C27 05C15 90C59 PDFBibTeX XMLCite \textit{A. Herrán} et al., Optim. Lett. 17, No. 9, 2065--2086 (2023; Zbl 07762290) Full Text: DOI
Bezerra, Sinaide Nunes; de Souza, Sérgio Ricardo; Souza, Marcone Jamilson Freitas A general VNS for the multi-depot open vehicle routing problem with time windows. (English) Zbl 07762289 Optim. Lett. 17, No. 9, 2033-2063 (2023). MSC: 90C35 90C27 90B06 PDFBibTeX XMLCite \textit{S. N. Bezerra} et al., Optim. Lett. 17, No. 9, 2033--2063 (2023; Zbl 07762289) Full Text: DOI
Li, Jianping; Cai, Lijian; Lichen, Junran; Pan, Pengxiang Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties. (English) Zbl 07755348 Optim. Lett. 17, No. 8, 1939-1956 (2023). MSC: 90C27 PDFBibTeX XMLCite \textit{J. Li} et al., Optim. Lett. 17, No. 8, 1939--1956 (2023; Zbl 07755348) Full Text: DOI
Angelelli, Enrico; Mansini, Renata; Rizzi, Romeo Solving the probabilistic profitable tour problem on a line. (English) Zbl 07755345 Optim. Lett. 17, No. 8, 1873-1888 (2023). MSC: 90C27 PDFBibTeX XMLCite \textit{E. Angelelli} et al., Optim. Lett. 17, No. 8, 1873--1888 (2023; Zbl 07755345) Full Text: DOI arXiv
Araújo, Tacildo de S.; Gonçalves, Douglas S.; Torezzan, Cristiano A two-phase rank-based algorithm for low-rank matrix completion. (English) Zbl 07720221 Optim. Lett. 17, No. 7, 1679-1695 (2023). MSC: 90C27 PDFBibTeX XMLCite \textit{T. de S. Araújo} et al., Optim. Lett. 17, No. 7, 1679--1695 (2023; Zbl 07720221) Full Text: DOI arXiv
Lu, Cheng; Yang, Wenguo; Gao, Suixiang Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions. (English) Zbl 07720219 Optim. Lett. 17, No. 7, 1643-1667 (2023). MSC: 90C27 PDFBibTeX XMLCite \textit{C. Lu} et al., Optim. Lett. 17, No. 7, 1643--1667 (2023; Zbl 07720219) Full Text: DOI
Emelin, Maxim D.; Khlystov, Ilya A.; Malyshev, Dmitry S.; Razvenskaya, Olga O. On linear algebraic algorithms for the subgraph matching problem and its variants. (English) Zbl 07720213 Optim. Lett. 17, No. 7, 1533-1549 (2023). MSC: 90C27 PDFBibTeX XMLCite \textit{M. D. Emelin} et al., Optim. Lett. 17, No. 7, 1533--1549 (2023; Zbl 07720213) Full Text: DOI
Nobel, Parth; Agrawal, Akshay; Boyd, Stephen Computing tighter bounds on the \(n\)-queens constant via Newton’s method. (English) Zbl 1519.90208 Optim. Lett. 17, No. 5, 1229-1240 (2023). MSC: 90C27 90C25 PDFBibTeX XMLCite \textit{P. Nobel} et al., Optim. Lett. 17, No. 5, 1229--1240 (2023; Zbl 1519.90208) Full Text: DOI arXiv
Onn, Shmuel Degree sequence optimization in bounded treewidth. (English) Zbl 1519.90210 Optim. Lett. 17, No. 5, 1127-1132 (2023). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{S. Onn}, Optim. Lett. 17, No. 5, 1127--1132 (2023; Zbl 1519.90210) Full Text: DOI arXiv
Karami, Farzaneh; Fathi, Mahdi; Pardalos, Panos M. Conveyor operations in distribution centers: modeling and optimization. (English) Zbl 1518.90120 Optim. Lett. 17, No. 4, 1049-1068 (2023). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{F. Karami} et al., Optim. Lett. 17, No. 4, 1049--1068 (2023; Zbl 1518.90120) Full Text: DOI
Lu, Yajun; Miao, Zhuqi; Sahraeian, Parisa; Balasundaram, Balabhaskar On atomic cliques in temporal graphs. (English) Zbl 1518.90093 Optim. Lett. 17, No. 4, 813-828 (2023). MSC: 90C27 PDFBibTeX XMLCite \textit{Y. Lu} et al., Optim. Lett. 17, No. 4, 813--828 (2023; Zbl 1518.90093) Full Text: DOI
Alasmari, Abdullah; Aliev, Iskander On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes. (English) Zbl 1516.90034 Optim. Lett. 17, No. 3, 739-751 (2023). MSC: 90C10 90C27 90C90 PDFBibTeX XMLCite \textit{A. Alasmari} and \textit{I. Aliev}, Optim. Lett. 17, No. 3, 739--751 (2023; Zbl 1516.90034) Full Text: DOI
Dietz, Audrey; Adams, Warren; Yang, Boshi A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions. (English) Zbl 1514.90201 Optim. Lett. 17, No. 2, 245-264 (2023). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Dietz} et al., Optim. Lett. 17, No. 2, 245--264 (2023; Zbl 1514.90201) Full Text: DOI
Sinha Roy, Debdatta; Golden, Bruce; Masone, Adriano; Wasil, Edward Using regression models to understand the impact of route-length variability in practical vehicle routing. (English) Zbl 1511.90364 Optim. Lett. 17, No. 1, 163-175 (2023). MSC: 90C27 90B06 PDFBibTeX XMLCite \textit{D. Sinha Roy} et al., Optim. Lett. 17, No. 1, 163--175 (2023; Zbl 1511.90364) Full Text: DOI
Kou, Shuhan; Golden, Bruce; Poikonen, Stefan Optimal TSP tour length estimation using Sammon maps. (English) Zbl 1511.90352 Optim. Lett. 17, No. 1, 89-105 (2023). MSC: 90C27 PDFBibTeX XMLCite \textit{S. Kou} et al., Optim. Lett. 17, No. 1, 89--105 (2023; Zbl 1511.90352) Full Text: DOI
Ajayi, Temitayo; Lee, Taewoo; Schaefer, Andrew J. A note on the implications of approximate submodularity in discrete optimization. (English) Zbl 1510.90182 Optim. Lett. 17, No. 1, 1-26 (2023). MSC: 90C10 90C27 PDFBibTeX XMLCite \textit{T. Ajayi} et al., Optim. Lett. 17, No. 1, 1--26 (2023; Zbl 1510.90182) Full Text: DOI
Bruni, Maria Elena; Khodaparasti, Sara; Martínez-Salazar, Iris; Nucamendi-Guillén, Samuel The multi-depot \(k\)-traveling repairman problem. (English) Zbl 1505.90098 Optim. Lett. 16, No. 9, 2681-2709 (2022). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{M. E. Bruni} et al., Optim. Lett. 16, No. 9, 2681--2709 (2022; Zbl 1505.90098) Full Text: DOI
Liu, Xiaofei; Li, Weidong; Xie, Runtao A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem. (English) Zbl 1503.90116 Optim. Lett. 16, No. 8, 2373-2385 (2022). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{X. Liu} et al., Optim. Lett. 16, No. 8, 2373--2385 (2022; Zbl 1503.90116) Full Text: DOI
Martinovic, John; Strasdat, Nico; Valério de Carvalho, José; Furini, Fabio Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. (English) Zbl 1503.90118 Optim. Lett. 16, No. 8, 2333-2358 (2022). MSC: 90C27 90C10 PDFBibTeX XMLCite \textit{J. Martinovic} et al., Optim. Lett. 16, No. 8, 2333--2358 (2022; Zbl 1503.90118) Full Text: DOI
Chagas, Jonatas B. C.; Wagner, Markus Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach. (English) Zbl 1503.90106 Optim. Lett. 16, No. 8, 2313-2331 (2022). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{J. B. C. Chagas} and \textit{M. Wagner}, Optim. Lett. 16, No. 8, 2313--2331 (2022; Zbl 1503.90106) Full Text: DOI arXiv
Shenmaier, Vladimir Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension. (English) Zbl 1497.90184 Optim. Lett. 16, No. 7, 2115-2122 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{V. Shenmaier}, Optim. Lett. 16, No. 7, 2115--2122 (2022; Zbl 1497.90184) Full Text: DOI arXiv
Gribanov, D. V.; Zolotykh, N. Yu. On lattice point counting in \(\varDelta\)-modular polyhedra. (English) Zbl 1496.90039 Optim. Lett. 16, No. 7, 1991-2018 (2022). MSC: 90C10 90C05 90C27 PDFBibTeX XMLCite \textit{D. V. Gribanov} and \textit{N. Yu. Zolotykh}, Optim. Lett. 16, No. 7, 1991--2018 (2022; Zbl 1496.90039) Full Text: DOI arXiv
Ageron, Romain Trigonometric approximation of the max-cut polytope is star-like. (English) Zbl 1489.90145 Optim. Lett. 16, No. 6, 1963-1967 (2022). MSC: 90C27 90C20 90C57 PDFBibTeX XMLCite \textit{R. Ageron}, Optim. Lett. 16, No. 6, 1963--1967 (2022; Zbl 1489.90145) Full Text: DOI arXiv
Li, Jianping; Pan, Pengxiang; Cai, Lijian; Lichen, Junran; Wang, Wencheng Bin packing with divisible item sizes and rejection penalties. (English) Zbl 1492.90151 Optim. Lett. 16, No. 5, 1587-1597 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{J. Li} et al., Optim. Lett. 16, No. 5, 1587--1597 (2022; Zbl 1492.90151) Full Text: DOI
Alfaro, Carlos A.; Perez, Sergio L.; Valencia, Carlos E.; Vargas, Marcos C. The assignment problem revisited. (English) Zbl 1492.90073 Optim. Lett. 16, No. 5, 1531-1548 (2022). MSC: 90B80 90C27 PDFBibTeX XMLCite \textit{C. A. Alfaro} et al., Optim. Lett. 16, No. 5, 1531--1548 (2022; Zbl 1492.90073) Full Text: DOI
Shanks, Meghan; Jacobson, Sheldon H. Online total bipartite matching problem. (English) Zbl 1492.90155 Optim. Lett. 16, No. 5, 1411-1426 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Shanks} and \textit{S. H. Jacobson}, Optim. Lett. 16, No. 5, 1411--1426 (2022; Zbl 1492.90155) Full Text: DOI
Onn, Shmuel Matching orderable and separable hypergraphs. (English) Zbl 1492.90152 Optim. Lett. 16, No. 5, 1393-1401 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{S. Onn}, Optim. Lett. 16, No. 5, 1393--1401 (2022; Zbl 1492.90152) Full Text: DOI arXiv
Singh, Bismark; Rehberg, Oliver; Groß, Theresa; Hoffmann, Maximilian; Kotzur, Leander; Stolten, Detlef Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models. (English) Zbl 1492.90096 Optim. Lett. 16, No. 5, 1373-1391 (2022). MSC: 90C11 90C27 90C90 PDFBibTeX XMLCite \textit{B. Singh} et al., Optim. Lett. 16, No. 5, 1373--1391 (2022; Zbl 1492.90096) Full Text: DOI
Yang, Yichen; Liu, Zhaohui; Yu, Wei Approximation algorithms for the \(k\)-depots Hamiltonian path problem. (English) Zbl 1491.90143 Optim. Lett. 16, No. 4, 1215-1234 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{Y. Yang} et al., Optim. Lett. 16, No. 4, 1215--1234 (2022; Zbl 1491.90143) Full Text: DOI
Berger, Mathias; Radu, David; Dubois, Antoine; Pandžić, Hrvoje; Dvorkin, Yury; Louveaux, Quentin; Ernst, Damien Siting renewable power generation assets with combinatorial optimisation. (English) Zbl 1489.90148 Optim. Lett. 16, No. 3, 877-907 (2022). MSC: 90C27 90C90 PDFBibTeX XMLCite \textit{M. Berger} et al., Optim. Lett. 16, No. 3, 877--907 (2022; Zbl 1489.90148) Full Text: DOI Link
Ran, Yingli; Huang, Xiaohui; Zhang, Zhao; Du, Ding-Zhu Approximation algorithm for minimum partial multi-cover under a geometric setting. (English) Zbl 1487.90566 Optim. Lett. 16, No. 2, 667-680 (2022). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{Y. Ran} et al., Optim. Lett. 16, No. 2, 667--680 (2022; Zbl 1487.90566) Full Text: DOI
Mokeev, Dmitry B.; Malyshev, Dmitry S. On partial descriptions of König graphs for odd paths and all their spanning supergraphs. (English) Zbl 1487.90563 Optim. Lett. 16, No. 2, 481-496 (2022). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Optim. Lett. 16, No. 2, 481--496 (2022; Zbl 1487.90563) Full Text: DOI
Iori, Manuel; de Lima, Vinícius Loti; Martello, Silvano; Monaci, Michele 2DPackLib: a two-dimensional cutting and packing library. (English) Zbl 1487.90557 Optim. Lett. 16, No. 2, 471-480 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Iori} et al., Optim. Lett. 16, No. 2, 471--480 (2022; Zbl 1487.90557) Full Text: DOI
Catanzaro, Daniele; Coniglio, Stefano; Furini, Fabio On the exact separation of cover inequalities of maximum-depth. (English) Zbl 1487.90544 Optim. Lett. 16, No. 2, 449-469 (2022). MSC: 90C27 90C39 90C11 PDFBibTeX XMLCite \textit{D. Catanzaro} et al., Optim. Lett. 16, No. 2, 449--469 (2022; Zbl 1487.90544) Full Text: DOI
Jiang, Li; Zang, Xiaoning; Dong, Junfeng; Liang, Changyong A covering traveling salesman problem with profit in the last mile delivery. (English) Zbl 1484.90094 Optim. Lett. 16, No. 1, 375-393 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Jiang} et al., Optim. Lett. 16, No. 1, 375--393 (2022; Zbl 1484.90094) Full Text: DOI
Jiang, Li; Zang, Xiaoning; Dong, Junfeng; Liang, Changyong; Mladenovic, Nenad A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak. (English) Zbl 1483.90137 Optim. Lett. 16, No. 1, 333-353 (2022). MSC: 90C27 90C59 90C90 PDFBibTeX XMLCite \textit{L. Jiang} et al., Optim. Lett. 16, No. 1, 333--353 (2022; Zbl 1483.90137) Full Text: DOI
Sánchez-Oro, Jesús; López-Sánchez, Ana D.; Colmenar, J. Manuel A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem. (English) Zbl 1483.90157 Optim. Lett. 16, No. 1, 301-331 (2022). MSC: 90C29 90C27 90C59 PDFBibTeX XMLCite \textit{J. Sánchez-Oro} et al., Optim. Lett. 16, No. 1, 301--331 (2022; Zbl 1483.90157) Full Text: DOI
Karakostas, Panagiotis; Sifaleras, Angelo; Georgiadis, Michael C. Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem. (English) Zbl 1483.90138 Optim. Lett. 16, No. 1, 211-235 (2022). MSC: 90C27 90C59 90B06 PDFBibTeX XMLCite \textit{P. Karakostas} et al., Optim. Lett. 16, No. 1, 211--235 (2022; Zbl 1483.90138) Full Text: DOI
Zang, Xiaoning; Jiang, Li; Ratli, Mustapha; Ding, Bin A parallel variable neighborhood search for solving covering salesman problem. (English) Zbl 1483.90147 Optim. Lett. 16, No. 1, 175-190 (2022). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{X. Zang} et al., Optim. Lett. 16, No. 1, 175--190 (2022; Zbl 1483.90147) Full Text: DOI
Ibrahim, Saber; Jarboui, Bassem A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems. (English) Zbl 1483.90136 Optim. Lett. 16, No. 1, 137-151 (2022). MSC: 90C27 90C90 PDFBibTeX XMLCite \textit{S. Ibrahim} and \textit{B. Jarboui}, Optim. Lett. 16, No. 1, 137--151 (2022; Zbl 1483.90136) Full Text: DOI
Nascimento Silva, Janio Carlos; Coelho, Igor M.; Souza, Ueverton S.; Ochi, Luiz Satoru; Coelho, Vitor N. Finding the maximum multi improvement on neighborhood exploration. (English) Zbl 1483.90182 Optim. Lett. 16, No. 1, 97-115 (2022). MSC: 90C59 90C39 90C27 PDFBibTeX XMLCite \textit{J. C. Nascimento Silva} et al., Optim. Lett. 16, No. 1, 97--115 (2022; Zbl 1483.90182) Full Text: DOI
Bogue, Eduardo Theodoro; Silva Ferreira, Huggo; Noronha, Thiago F.; Prins, Christian A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows. (English) Zbl 1483.90131 Optim. Lett. 16, No. 1, 79-95 (2022). MSC: 90C27 90B06 PDFBibTeX XMLCite \textit{E. T. Bogue} et al., Optim. Lett. 16, No. 1, 79--95 (2022; Zbl 1483.90131) Full Text: DOI
Adouani, Yassine; Jarboui, Bassem; Masmoudi, Malek A matheuristic for the 0–1 generalized quadratic multiple knapsack problem. (English) Zbl 1483.90127 Optim. Lett. 16, No. 1, 37-58 (2022). MSC: 90C27 90C10 90C59 PDFBibTeX XMLCite \textit{Y. Adouani} et al., Optim. Lett. 16, No. 1, 37--58 (2022; Zbl 1483.90127) Full Text: DOI
Soares, Pablo; Campêlo, Manoel \(t\)-linearization for the maximum diversity problem. (English) Zbl 1477.90092 Optim. Lett. 15, No. 8, 2879-2895 (2021). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{P. Soares} and \textit{M. Campêlo}, Optim. Lett. 15, No. 8, 2879--2895 (2021; Zbl 1477.90092) Full Text: DOI
Bruglieri, Maurizio; Mancini, Simona; Pisacane, Ornella A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations. (English) Zbl 1477.90079 Optim. Lett. 15, No. 8, 2813-2829 (2021). MSC: 90C27 90B06 PDFBibTeX XMLCite \textit{M. Bruglieri} et al., Optim. Lett. 15, No. 8, 2813--2829 (2021; Zbl 1477.90079) Full Text: DOI
Candogan, Utkan; Soh, Yong Sheng; Chandrasekeran, Venkat A note on convex relaxations for the inverse eigenvalue problem. (English) Zbl 1477.90080 Optim. Lett. 15, No. 8, 2757-2772 (2021). MSC: 90C27 90C22 PDFBibTeX XMLCite \textit{U. Candogan} et al., Optim. Lett. 15, No. 8, 2757--2772 (2021; Zbl 1477.90080) Full Text: DOI arXiv Link
Pferschy, Ulrich; Schauer, Joachim; Thielen, Clemens Approximating the product knapsack problem. (English) Zbl 1477.90089 Optim. Lett. 15, No. 8, 2529-2540 (2021). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{U. Pferschy} et al., Optim. Lett. 15, No. 8, 2529--2540 (2021; Zbl 1477.90089) Full Text: DOI
Frohn, Martin On the approximability of the fixed-tree balanced minimum evolution problem. (English) Zbl 1475.90081 Optim. Lett. 15, No. 6, 2321-2329 (2021). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{M. Frohn}, Optim. Lett. 15, No. 6, 2321--2329 (2021; Zbl 1475.90081) Full Text: DOI
Liu, Xiaofei; Li, Weidong Approximation algorithms for the multiprocessor scheduling with submodular penalties. (English) Zbl 1475.90021 Optim. Lett. 15, No. 6, 2165-2180 (2021). MSC: 90B35 90C59 90C27 68W25 PDFBibTeX XMLCite \textit{X. Liu} and \textit{W. Li}, Optim. Lett. 15, No. 6, 2165--2180 (2021; Zbl 1475.90021) Full Text: DOI
Erzin, Adil; Melidi, Gregory; Nazarenko, Stepan; Plotnikov, Roman Two-bar charts packing problem. (English) Zbl 1475.90080 Optim. Lett. 15, No. 6, 1955-1971 (2021). MSC: 90C27 90B35 PDFBibTeX XMLCite \textit{A. Erzin} et al., Optim. Lett. 15, No. 6, 1955--1971 (2021; Zbl 1475.90080) Full Text: DOI arXiv
Lacroix, Mathieu; Ríos-Solís, Yasmín A.; Calvo, Roberto Wolfler Efficient formulations for the traveling car renter problem and its quota variant. (English) Zbl 1475.90083 Optim. Lett. 15, No. 6, 1905-1930 (2021). MSC: 90C27 90C10 90B06 PDFBibTeX XMLCite \textit{M. Lacroix} et al., Optim. Lett. 15, No. 6, 1905--1930 (2021; Zbl 1475.90083) Full Text: DOI
Dell’Amico, Mauro; Montemanni, Roberto; Novellani, Stefano Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem. (English) Zbl 1471.90121 Optim. Lett. 15, No. 5, 1617-1648 (2021). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{M. Dell'Amico} et al., Optim. Lett. 15, No. 5, 1617--1648 (2021; Zbl 1471.90121) Full Text: DOI arXiv
Khodayifar, Salman Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle. (English) Zbl 1466.90115 Optim. Lett. 15, No. 3, 1009-1026 (2021). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{S. Khodayifar}, Optim. Lett. 15, No. 3, 1009--1026 (2021; Zbl 1466.90115) Full Text: DOI
Luo, Taibo; Li, Hongmei; Ru, Shaofeng; Tong, Weitian; Xu, Yinfeng Multiple sink location problem in path networks with a combinational objective. (English) Zbl 1466.90089 Optim. Lett. 15, No. 2, 733-755 (2021). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{T. Luo} et al., Optim. Lett. 15, No. 2, 733--755 (2021; Zbl 1466.90089) Full Text: DOI
Yang, Zishen; Shi, Majun; Wang, Wei Greedy approximation for the minimum connected dominating set with labeling. (English) Zbl 1466.90092 Optim. Lett. 15, No. 2, 685-700 (2021). MSC: 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{Z. Yang} et al., Optim. Lett. 15, No. 2, 685--700 (2021; Zbl 1466.90092) Full Text: DOI
Li, Jianping; Zheng, Yujie; Lichen, Junran; Wang, Wencheng On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\). (English) Zbl 1466.90116 Optim. Lett. 15, No. 2, 669-683 (2021). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{J. Li} et al., Optim. Lett. 15, No. 2, 669--683 (2021; Zbl 1466.90116) Full Text: DOI
Drwal, Maciej Robust approach to restricted items selection problem. (English) Zbl 1466.90063 Optim. Lett. 15, No. 2, 649-667 (2021). MSC: 90C17 90C27 PDFBibTeX XMLCite \textit{M. Drwal}, Optim. Lett. 15, No. 2, 649--667 (2021; Zbl 1466.90063) Full Text: DOI arXiv
Barketau, Maksim Evaluation of solution of discrete optimization problem with incomplete input. (English) Zbl 1466.90082 Optim. Lett. 15, No. 2, 431-440 (2021). MSC: 90C27 90B80 PDFBibTeX XMLCite \textit{M. Barketau}, Optim. Lett. 15, No. 2, 431--440 (2021; Zbl 1466.90082) Full Text: DOI
Martins, Jean P.; Ribas, Bruno C. A randomized heuristic repair for the multidimensional knapsack problem. (English) Zbl 1466.90090 Optim. Lett. 15, No. 2, 337-355 (2021). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{J. P. Martins} and \textit{B. C. Ribas}, Optim. Lett. 15, No. 2, 337--355 (2021; Zbl 1466.90090) Full Text: DOI
Lalla-Ruiz, Eduardo; Mes, Martijn Mathematical formulations and improvements for the multi-depot open vehicle routing problem. (English) Zbl 1461.90121 Optim. Lett. 15, No. 1, 271-286 (2021). MSC: 90C27 90B06 PDFBibTeX XMLCite \textit{E. Lalla-Ruiz} and \textit{M. Mes}, Optim. Lett. 15, No. 1, 271--286 (2021; Zbl 1461.90121) Full Text: DOI
Dauer, Armando Teles; Prata, Bruno de Athayde Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows. (English) Zbl 1461.90117 Optim. Lett. 15, No. 1, 153-170 (2021). MSC: 90C27 90C11 90B06 PDFBibTeX XMLCite \textit{A. T. Dauer} and \textit{B. de A. Prata}, Optim. Lett. 15, No. 1, 153--170 (2021; Zbl 1461.90117) Full Text: DOI
Liu, Yanchao A note on solving DiDi’s driver-order matching problem. (English) Zbl 1460.90154 Optim. Lett. 15, No. 1, 109-125 (2021). MSC: 90C27 90C11 90B06 PDFBibTeX XMLCite \textit{Y. Liu}, Optim. Lett. 15, No. 1, 109--125 (2021; Zbl 1460.90154) Full Text: DOI
Sabry, Gustavo de Araujo; Goldbarg, Marco Cesar; Goldbarg, Elizabeth Ferreira Gouvêa; Menezes, Matheus da Silva; Calheiros, Zailton Sachas Amorim Models and linearizations for the Traveling Car Renter with passengers. (English) Zbl 1460.90158 Optim. Lett. 15, No. 1, 59-81 (2021). MSC: 90C27 90C11 90B06 PDFBibTeX XMLCite \textit{G. de A. Sabry} et al., Optim. Lett. 15, No. 1, 59--81 (2021; Zbl 1460.90158) Full Text: DOI
Frifita, Sana; Mathlouthi, Ines; Masmoudi, Malek; Dammak, Abdelaziz Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem. (English) Zbl 1459.90178 Optim. Lett. 14, No. 8, 2285-2299 (2020). MSC: 90C27 PDFBibTeX XMLCite \textit{S. Frifita} et al., Optim. Lett. 14, No. 8, 2285--2299 (2020; Zbl 1459.90178) Full Text: DOI
Hosteins, Pierre A compact mixed integer linear formulation for safe set problems. (English) Zbl 1459.90180 Optim. Lett. 14, No. 8, 2127-2148 (2020). MSC: 90C27 90C11 PDFBibTeX XMLCite \textit{P. Hosteins}, Optim. Lett. 14, No. 8, 2127--2148 (2020; Zbl 1459.90180) Full Text: DOI HAL
Kampel, Ludwig; Leithner, Manuel; Simos, Dimitris E. Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm. (English) Zbl 1448.90083 Optim. Lett. 14, No. 6, 1543-1556 (2020). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Kampel} et al., Optim. Lett. 14, No. 6, 1543--1556 (2020; Zbl 1448.90083) Full Text: DOI
Dokka, Trivikram; Goerigk, Marc; Roy, Rahul Mixed uncertainty sets for robust combinatorial optimization. (English) Zbl 1448.90067 Optim. Lett. 14, No. 6, 1323-1337 (2020). MSC: 90C17 90C27 PDFBibTeX XMLCite \textit{T. Dokka} et al., Optim. Lett. 14, No. 6, 1323--1337 (2020; Zbl 1448.90067) Full Text: DOI arXiv Link
Mokeev, D. B.; Malyshev, D. S. A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs. (English) Zbl 1448.90084 Optim. Lett. 14, No. 6, 1317-1322 (2020). MSC: 90C27 90C35 90C60 PDFBibTeX XMLCite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Optim. Lett. 14, No. 6, 1317--1322 (2020; Zbl 1448.90084) Full Text: DOI
Jiang, Yanjun; Wang, Yishui; Xu, Dachuan; Yang, Ruiqi; Zhang, Yong Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint. (English) Zbl 1445.90094 Optim. Lett. 14, No. 5, 1235-1248 (2020). MSC: 90C27 PDFBibTeX XMLCite \textit{Y. Jiang} et al., Optim. Lett. 14, No. 5, 1235--1248 (2020; Zbl 1445.90094) Full Text: DOI
Osicka, Ondrej; Guajardo, Mario; Jörnsten, Kurt Cooperation of customers in traveling salesman problems with profits. (English) Zbl 1445.90096 Optim. Lett. 14, No. 5, 1219-1233 (2020). MSC: 90C27 91A12 PDFBibTeX XMLCite \textit{O. Osicka} et al., Optim. Lett. 14, No. 5, 1219--1233 (2020; Zbl 1445.90096) Full Text: DOI Link
Gounaris, Chrysanthos E.; Schmidt, Daniel R. Generalized hose uncertainty in single-commodity robust network design. (English) Zbl 1444.90089 Optim. Lett. 14, No. 4, 925-944 (2020). MSC: 90C17 90C27 90B15 PDFBibTeX XMLCite \textit{C. E. Gounaris} and \textit{D. R. Schmidt}, Optim. Lett. 14, No. 4, 925--944 (2020; Zbl 1444.90089) Full Text: DOI
Fachini, Ramon Faganello; Armentano, Vinícius Amaral Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows. (English) Zbl 1442.90164 Optim. Lett. 14, No. 3, 579-609 (2020). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{R. F. Fachini} and \textit{V. A. Armentano}, Optim. Lett. 14, No. 3, 579--609 (2020; Zbl 1442.90164) Full Text: DOI
Sangamuang, Sumalee; Boonma, Pruet; Natwichai, Juggapong; Chaovalitwongse, Wanpracha Art Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking. (English) Zbl 1442.90171 Optim. Lett. 14, No. 3, 521-533 (2020). MSC: 90C27 90C11 PDFBibTeX XMLCite \textit{S. Sangamuang} et al., Optim. Lett. 14, No. 3, 521--533 (2020; Zbl 1442.90171) Full Text: DOI
Mucherino, Antonio; Omer, Jeremy; Hoyet, Ludovic; Robuffo Giordano, Paolo; Multon, Franck An application-based characterization of dynamical distance geometry problems. (English) Zbl 1442.90168 Optim. Lett. 14, No. 2, 493-507 (2020). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{A. Mucherino} et al., Optim. Lett. 14, No. 2, 493--507 (2020; Zbl 1442.90168) Full Text: DOI HAL
de Salles Neto, Luiz Leduino; Lavor, Carlile; Lodwick, Weldon A constrained interval approach to the generalized distance geometry problem. (English) Zbl 1442.90162 Optim. Lett. 14, No. 2, 483-492 (2020). MSC: 90C27 PDFBibTeX XMLCite \textit{L. L. de Salles Neto} et al., Optim. Lett. 14, No. 2, 483--492 (2020; Zbl 1442.90162) Full Text: DOI
Abud, Germano; Alencar, Jorge; Lavor, Carlile; Liberti, Leo; Mucherino, Antonio The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry. (English) Zbl 1442.90158 Optim. Lett. 14, No. 2, 469-482 (2020). MSC: 90C27 PDFBibTeX XMLCite \textit{G. Abud} et al., Optim. Lett. 14, No. 2, 469--482 (2020; Zbl 1442.90158) Full Text: DOI
Gonçalves, Douglas S. A least-squares approach for discretizable distance geometry problems with inexact distances. (English) Zbl 1446.90157 Optim. Lett. 14, No. 2, 423-437 (2020). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{D. S. Gonçalves}, Optim. Lett. 14, No. 2, 423--437 (2020; Zbl 1446.90157) Full Text: DOI
Deza, Michel; Dutour Sikirić, Mathieu Generalized cut and metric polytopes of graphs and simplicial complexes. (English) Zbl 1442.05253 Optim. Lett. 14, No. 2, 273-289 (2020). MSC: 05E45 52B12 90C27 90C57 PDFBibTeX XMLCite \textit{M. Deza} and \textit{M. Dutour Sikirić}, Optim. Lett. 14, No. 2, 273--289 (2020; Zbl 1442.05253) Full Text: DOI arXiv
Murota, Kazuo; Tamura, Akihisa Integrality of subgradients and biconjugates of integrally convex functions. (English) Zbl 1433.90055 Optim. Lett. 14, No. 1, 195-208 (2020). MSC: 90B25 49J52 90C27 PDFBibTeX XMLCite \textit{K. Murota} and \textit{A. Tamura}, Optim. Lett. 14, No. 1, 195--208 (2020; Zbl 1433.90055) Full Text: DOI arXiv
Joung, Seulgi; Lee, Kyungsik Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity. (English) Zbl 1433.90137 Optim. Lett. 14, No. 1, 101-113 (2020). MSC: 90C27 90C15 90C17 90C59 PDFBibTeX XMLCite \textit{S. Joung} and \textit{K. Lee}, Optim. Lett. 14, No. 1, 101--113 (2020; Zbl 1433.90137) Full Text: DOI arXiv
Gaudioso, Manlio; Gorgone, E.; Hiriart-Urruty, J.-B. Feature selection in SVM via polyhedral \(k\)-norm. (English) Zbl 1433.90133 Optim. Lett. 14, No. 1, 19-36 (2020). MSC: 90C27 90C26 62H30 PDFBibTeX XMLCite \textit{M. Gaudioso} et al., Optim. Lett. 14, No. 1, 19--36 (2020; Zbl 1433.90133) Full Text: DOI
Pyatkin, Artem; Lykhovyd, Eugene; Butenko, Sergiy The maximum number of induced open triangles in graphs of a given order. (English) Zbl 1432.90134 Optim. Lett. 13, No. 8, 1927-1935 (2019). MSC: 90C27 90C35 PDFBibTeX XMLCite \textit{A. Pyatkin} et al., Optim. Lett. 13, No. 8, 1927--1935 (2019; Zbl 1432.90134) Full Text: DOI
Álvarez-Miranda, Eduardo; Sinnl, Markus Mixed-integer programming approaches for the tree \(t^*\)-spanner problem. (English) Zbl 1430.90474 Optim. Lett. 13, No. 7, 1693-1709 (2019). MSC: 90C27 90C11 90C57 PDFBibTeX XMLCite \textit{E. Álvarez-Miranda} and \textit{M. Sinnl}, Optim. Lett. 13, No. 7, 1693--1709 (2019; Zbl 1430.90474) Full Text: DOI
Kampas, Frank J.; Castillo, Ignacio; Pintér, János D. Optimized ellipse packings in regular polygons. (English) Zbl 1430.90489 Optim. Lett. 13, No. 7, 1583-1613 (2019). MSC: 90C27 90C30 PDFBibTeX XMLCite \textit{F. J. Kampas} et al., Optim. Lett. 13, No. 7, 1583--1613 (2019; Zbl 1430.90489) Full Text: DOI
Eichfelder, Gabriele; Hotz, Thomas; Wieditz, Johannes An algorithm for computing Fréchet means on the sphere. (English) Zbl 1430.90469 Optim. Lett. 13, No. 7, 1523-1533 (2019). MSC: 90C26 90C27 PDFBibTeX XMLCite \textit{G. Eichfelder} et al., Optim. Lett. 13, No. 7, 1523--1533 (2019; Zbl 1430.90469) Full Text: DOI arXiv
Damaschke, Peter Optimal partial clique edge covering guided by potential energy minimization. (English) Zbl 1431.90127 Optim. Lett. 13, No. 7, 1469-1481 (2019). MSC: 90C27 PDFBibTeX XMLCite \textit{P. Damaschke}, Optim. Lett. 13, No. 7, 1469--1481 (2019; Zbl 1431.90127) Full Text: DOI
López, C. O.; Beasley, J. E. Packing a fixed number of identical circles in a circular container with circular prohibited areas. (English) Zbl 1430.90496 Optim. Lett. 13, No. 7, 1449-1468 (2019). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{C. O. López} and \textit{J. E. Beasley}, Optim. Lett. 13, No. 7, 1449--1468 (2019; Zbl 1430.90496) Full Text: DOI arXiv
Goerigk, Marc; Hughes, Martin Representative scenario construction and preprocessing for robust combinatorial optimization problems. (English) Zbl 1430.90482 Optim. Lett. 13, No. 6, 1417-1431 (2019). MSC: 90C27 90C15 90C59 PDFBibTeX XMLCite \textit{M. Goerigk} and \textit{M. Hughes}, Optim. Lett. 13, No. 6, 1417--1431 (2019; Zbl 1430.90482) Full Text: DOI Link
Lalou, Mohammed; Kheddouci, Hamamache A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs. (English) Zbl 1429.90062 Optim. Lett. 13, No. 6, 1345-1364 (2019). MSC: 90C27 90C39 PDFBibTeX XMLCite \textit{M. Lalou} and \textit{H. Kheddouci}, Optim. Lett. 13, No. 6, 1345--1364 (2019; Zbl 1429.90062) Full Text: DOI
Marín, Alfredo; Pelegrín, Mercedes A new lifting theorem for vertex packing. (English) Zbl 1429.90063 Optim. Lett. 13, No. 6, 1299-1312 (2019). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Marín} and \textit{M. Pelegrín}, Optim. Lett. 13, No. 6, 1299--1312 (2019; Zbl 1429.90063) Full Text: DOI
Hosseinian, Seyedmohammadhossein; Butenko, Sergiy Algorithms for the generalized independent set problem based on a quadratic optimization approach. (English) Zbl 1434.90210 Optim. Lett. 13, No. 6, 1211-1222 (2019). MSC: 90C35 90C20 90C27 PDFBibTeX XMLCite \textit{S. Hosseinian} and \textit{S. Butenko}, Optim. Lett. 13, No. 6, 1211--1222 (2019; Zbl 1434.90210) Full Text: DOI
Wang, Huijuan; Wu, Lidong; Pardalos, Miltiades P.; Du, Hongwei; Liu, Bin An efficient case for computing minimum linear arboricity with small maximum degree. (English) Zbl 1420.90062 Optim. Lett. 13, No. 2, 419-428 (2019). MSC: 90C27 05C15 PDFBibTeX XMLCite \textit{H. Wang} et al., Optim. Lett. 13, No. 2, 419--428 (2019; Zbl 1420.90062) Full Text: DOI
Casazza, Marco New formulations for variable cost and size bin packing problems with item fragmentation. (English) Zbl 1420.90058 Optim. Lett. 13, No. 2, 379-398 (2019). MSC: 90C27 PDFBibTeX XMLCite \textit{M. Casazza}, Optim. Lett. 13, No. 2, 379--398 (2019; Zbl 1420.90058) Full Text: DOI
Matsuda, Yusa; Takahashi, Satoshi A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems. (English) Zbl 1420.90078 Optim. Lett. 13, No. 2, 341-348 (2019). MSC: 90C35 90C59 90C27 PDFBibTeX XMLCite \textit{Y. Matsuda} and \textit{S. Takahashi}, Optim. Lett. 13, No. 2, 341--348 (2019; Zbl 1420.90078) Full Text: DOI arXiv
Secchin, L. D.; Amaral, A. R. S. An improved mixed-integer programming model for the double row layout of facilities. (English) Zbl 1417.90105 Optim. Lett. 13, No. 1, 193-199 (2019). MSC: 90C11 90C27 90C90 PDFBibTeX XMLCite \textit{L. D. Secchin} and \textit{A. R. S. Amaral}, Optim. Lett. 13, No. 1, 193--199 (2019; Zbl 1417.90105) Full Text: DOI
Weerasena, Lakmali; Wiecek, Margaret M. A tolerance function for the multiobjective set covering problem. (English) Zbl 1417.90131 Optim. Lett. 13, No. 1, 3-21 (2019). MSC: 90C27 90C29 90C59 PDFBibTeX XMLCite \textit{L. Weerasena} and \textit{M. M. Wiecek}, Optim. Lett. 13, No. 1, 3--21 (2019; Zbl 1417.90131) Full Text: DOI
Chassein, André; Goerigk, Marc On scenario aggregation to approximate robust combinatorial optimization problems. (English) Zbl 1407.90340 Optim. Lett. 12, No. 7, 1523-1533 (2018). MSC: 90C47 90C27 90C15 PDFBibTeX XMLCite \textit{A. Chassein} and \textit{M. Goerigk}, Optim. Lett. 12, No. 7, 1523--1533 (2018; Zbl 1407.90340) Full Text: DOI arXiv Link
Goldbarg, Marco C.; Goldbarg, Elizabeth F. G.; Luna, Henrique P. L.; Menezes, Matheus S.; Corrales, Lucas Integer programming models and linearizations for the traveling car renter problem. (English) Zbl 1403.90569 Optim. Lett. 12, No. 4, 743-761 (2018). MSC: 90C27 90C10 PDFBibTeX XMLCite \textit{M. C. Goldbarg} et al., Optim. Lett. 12, No. 4, 743--761 (2018; Zbl 1403.90569) Full Text: DOI