Karels, Vincent C. G.; Rei, Walter; Veelenturf, Lucas P.; Van Woensel, Tom A vehicle routing problem with multiple service agreements. (English) Zbl 07765855 Eur. J. Oper. Res. 313, No. 1, 129-145 (2024). MSC: 90Bxx PDFBibTeX XMLCite \textit{V. C. G. Karels} et al., Eur. J. Oper. Res. 313, No. 1, 129--145 (2024; Zbl 07765855) Full Text: DOI
Schulze, Philipp; Scholl, Armin; Walter, Rico R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines. (English) Zbl 07764608 Eur. J. Oper. Res. 312, No. 1, 38-55 (2024). MSC: 90Bxx PDFBibTeX XMLCite \textit{P. Schulze} et al., Eur. J. Oper. Res. 312, No. 1, 38--55 (2024; Zbl 07764608) Full Text: DOI
Pereira, Jordi; Ritt, Marcus Exact and heuristic methods for a workload allocation problem with chain precedence constraints. (English) Zbl 07709314 Eur. J. Oper. Res. 309, No. 1, 387-398 (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{J. Pereira} and \textit{M. Ritt}, Eur. J. Oper. Res. 309, No. 1, 387--398 (2023; Zbl 07709314) Full Text: DOI
San Segundo, Pablo; Furini, Fabio; Álvarez, David; Pardalos, Panos M. CliSAT: a new exact algorithm for hard maximum clique problems. (English) Zbl 07709061 Eur. J. Oper. Res. 307, No. 3, 1008-1025 (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{P. San Segundo} et al., Eur. J. Oper. Res. 307, No. 3, 1008--1025 (2023; Zbl 07709061) Full Text: DOI
Hansknecht, Christoph; Joormann, Imke; Korn, Bernd; Morscheck, Fabian; Stiller, Sebastian Feeder routing for air-to-air refueling operations. (English) Zbl 1524.90049 Eur. J. Oper. Res. 304, No. 2, 779-796 (2023). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{C. Hansknecht} et al., Eur. J. Oper. Res. 304, No. 2, 779--796 (2023; Zbl 1524.90049) Full Text: DOI
Jin, Bo; Tanaka, Shunji An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules. (English) Zbl 1524.90054 Eur. J. Oper. Res. 304, No. 2, 494-514 (2023). MSC: 90B06 90B80 90C27 90C59 PDFBibTeX XMLCite \textit{B. Jin} and \textit{S. Tanaka}, Eur. J. Oper. Res. 304, No. 2, 494--514 (2023; Zbl 1524.90054) Full Text: DOI
Wang, Mengtong; Zhang, Canrong; Bell, Michael G. H.; Miao, Lixin A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system. (English) Zbl 1524.90087 Eur. J. Oper. Res. 303, No. 3, 1258-1276 (2022). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{M. Wang} et al., Eur. J. Oper. Res. 303, No. 3, 1258--1276 (2022; Zbl 1524.90087) Full Text: DOI
Li, Yifu; Qi, Xiangtong A geometric branch-and-bound algorithm for the service bundle design problem. (English) Zbl 1524.90309 Eur. J. Oper. Res. 303, No. 3, 1044-1056 (2022). MSC: 90C32 90C57 PDFBibTeX XMLCite \textit{Y. Li} and \textit{X. Qi}, Eur. J. Oper. Res. 303, No. 3, 1044--1056 (2022; Zbl 1524.90309) Full Text: DOI
Archetti, Claudia; Ljubić, Ivana Comparison of formulations for the inventory routing problem. (English) Zbl 1524.90004 Eur. J. Oper. Res. 303, No. 3, 997-1008 (2022). MSC: 90B05 90B06 90C10 90C57 PDFBibTeX XMLCite \textit{C. Archetti} and \textit{I. Ljubić}, Eur. J. Oper. Res. 303, No. 3, 997--1008 (2022; Zbl 1524.90004) Full Text: DOI
Rigo, Cezar Antônio; Seman, Laio Oriel; Camponogara, Eduardo; Morsch Filho, Edemar; Bezerra, Eduardo Augusto; Munari, Pedro A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service. (English) Zbl 1507.90068 Eur. J. Oper. Res. 303, No. 1, 168-183 (2022). MSC: 90B35 90C57 PDFBibTeX XMLCite \textit{C. A. Rigo} et al., Eur. J. Oper. Res. 303, No. 1, 168--183 (2022; Zbl 1507.90068) Full Text: DOI
Gaar, Elisabeth; Sinnl, Markus A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem. (English) Zbl 1507.90087 Eur. J. Oper. Res. 303, No. 1, 78-98 (2022). MSC: 90B80 90C57 PDFBibTeX XMLCite \textit{E. Gaar} and \textit{M. Sinnl}, Eur. J. Oper. Res. 303, No. 1, 78--98 (2022; Zbl 1507.90087) Full Text: DOI arXiv
Campêlo, Manoel; Freire, Alexandre S.; Moura, Phablo F. S.; Soares, Joel C. Strong inequalities and a branch-and-price algorithm for the convex recoloring problem. (English) Zbl 1507.05031 Eur. J. Oper. Res. 303, No. 1, 54-65 (2022). MSC: 05C15 05C85 90C57 PDFBibTeX XMLCite \textit{M. Campêlo} et al., Eur. J. Oper. Res. 303, No. 1, 54--65 (2022; Zbl 1507.05031) Full Text: DOI
Skålnes, Jørgen; Andersson, Henrik; Desaulniers, Guy; Stålhane, Magnus An improved formulation for the inventory routing problem with time-varying demands. (English) Zbl 1507.90014 Eur. J. Oper. Res. 302, No. 3, 1189-1201 (2022). MSC: 90B05 90B06 90C57 PDFBibTeX XMLCite \textit{J. Skålnes} et al., Eur. J. Oper. Res. 302, No. 3, 1189--1201 (2022; Zbl 1507.90014) Full Text: DOI
Forget, Nicolas; Gadegaard, Sune Lauth; Nielsen, Lars Relund Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs. (English) Zbl 1507.90163 Eur. J. Oper. Res. 302, No. 3, 909-924 (2022). MSC: 90C29 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{N. Forget} et al., Eur. J. Oper. Res. 302, No. 3, 909--924 (2022; Zbl 1507.90163) Full Text: DOI
Diefenbach, Johannes; Stolletz, Raik Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm. (English) Zbl 1507.90056 Eur. J. Oper. Res. 302, No. 2, 589-605 (2022). MSC: 90B30 90C15 90C57 PDFBibTeX XMLCite \textit{J. Diefenbach} and \textit{R. Stolletz}, Eur. J. Oper. Res. 302, No. 2, 589--605 (2022; Zbl 1507.90056) Full Text: DOI
Wei, Ningji; Walteros, Jose L. Integer programming methods for solving binary interdiction games. (English) Zbl 1507.91040 Eur. J. Oper. Res. 302, No. 2, 456-469 (2022). MSC: 91A65 90C10 90C35 90C57 PDFBibTeX XMLCite \textit{N. Wei} and \textit{J. L. Walteros}, Eur. J. Oper. Res. 302, No. 2, 456--469 (2022; Zbl 1507.91040) Full Text: DOI
Zhang, Xiangyi; Chen, Lu; Gendreau, Michel; Langevin, André A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints. (English) Zbl 1507.90043 Eur. J. Oper. Res. 302, No. 1, 259-269 (2022). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{X. Zhang} et al., Eur. J. Oper. Res. 302, No. 1, 259--269 (2022; Zbl 1507.90043) Full Text: DOI
Yang, Yu; Boland, Natashia; Dilkina, Bistra; Savelsbergh, Martin Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems. (English) Zbl 1506.90175 Eur. J. Oper. Res. 301, No. 3, 828-840 (2022). MSC: 90C11 90C27 90C57 68T05 PDFBibTeX XMLCite \textit{Y. Yang} et al., Eur. J. Oper. Res. 301, No. 3, 828--840 (2022; Zbl 1506.90175) Full Text: DOI
Cherkesly, Marilène; Gschwind, Timo The pickup and delivery problem with time windows, multiple stacks, and handling operations. (English) Zbl 1506.90032 Eur. J. Oper. Res. 301, No. 2, 647-666 (2022). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{M. Cherkesly} and \textit{T. Gschwind}, Eur. J. Oper. Res. 301, No. 2, 647--666 (2022; Zbl 1506.90032) Full Text: DOI
Bianchessi, Nicola; Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchis, José M. The min-max close-enough arc routing problem. (English) Zbl 1506.90216 Eur. J. Oper. Res. 300, No. 3, 837-851 (2022). MSC: 90C27 90C57 90C59 PDFBibTeX XMLCite \textit{N. Bianchessi} et al., Eur. J. Oper. Res. 300, No. 3, 837--851 (2022; Zbl 1506.90216) Full Text: DOI
Moon, Kyungduk; Lee, Kangbok; Chopra, Sunil; Kwon, Steve Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy. (English) Zbl 1495.92032 Eur. J. Oper. Res. 300, No. 2, 743-754 (2022). MSC: 92C50 92C40 90C10 90C11 90C57 PDFBibTeX XMLCite \textit{K. Moon} et al., Eur. J. Oper. Res. 300, No. 2, 743--754 (2022; Zbl 1495.92032) Full Text: DOI
Pereira, Armando Honorio; Mateus, Geraldo Robson; Urrutia, Sebastián Alberto Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. (English) Zbl 1495.90161 Eur. J. Oper. Res. 300, No. 1, 207-220 (2022). MSC: 90C27 90B06 90C57 PDFBibTeX XMLCite \textit{A. H. Pereira} et al., Eur. J. Oper. Res. 300, No. 1, 207--220 (2022; Zbl 1495.90161) Full Text: DOI
Wang, Ting; Hu, Qian; Lim, Andrew An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs. (English) Zbl 1495.90165 Eur. J. Oper. Res. 300, No. 1, 20-34 (2022). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{T. Wang} et al., Eur. J. Oper. Res. 300, No. 1, 20--34 (2022; Zbl 1495.90165) Full Text: DOI
Lee, In Gyu; Yoon, Sang Won; Won, Daehan A mixed integer linear programming support vector machine for cost-effective group feature selection: branch-cut-and-price approach. (English) Zbl 1495.60063 Eur. J. Oper. Res. 299, No. 3, 1055-1068 (2022). MSC: 60H30 68T05 90C11 90C57 PDFBibTeX XMLCite \textit{I. G. Lee} et al., Eur. J. Oper. Res. 299, No. 3, 1055--1068 (2022; Zbl 1495.60063) Full Text: DOI
Pohl, Maximilian; Artigues, Christian; Kolisch, Rainer Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach. (English) Zbl 1490.90132 Eur. J. Oper. Res. 299, No. 2, 674-689 (2022). MSC: 90B35 90C57 90C59 PDFBibTeX XMLCite \textit{M. Pohl} et al., Eur. J. Oper. Res. 299, No. 2, 674--689 (2022; Zbl 1490.90132) Full Text: DOI HAL
Fleszar, Krzysztof A branch-and-bound algorithm for the quadratic multiple knapsack problem. (English) Zbl 1490.90242 Eur. J. Oper. Res. 298, No. 1, 89-98 (2022). MSC: 90C27 90C20 90C57 PDFBibTeX XMLCite \textit{K. Fleszar}, Eur. J. Oper. Res. 298, No. 1, 89--98 (2022; Zbl 1490.90242) Full Text: DOI
Sinnl, Markus Exact and heuristic algorithms for the maximum weighted submatrix coverage problem. (English) Zbl 1490.90257 Eur. J. Oper. Res. 298, No. 3, 821-833 (2022). MSC: 90C27 90C10 90C57 90C59 PDFBibTeX XMLCite \textit{M. Sinnl}, Eur. J. Oper. Res. 298, No. 3, 821--833 (2022; Zbl 1490.90257) Full Text: DOI
Reihaneh, Mohammad; Abouei Ardakan, Mostafa; Eskandarpour, Majid An exact algorithm for the redundancy allocation problem with heterogeneous components under the mixed redundancy strategy. (English) Zbl 1490.90107 Eur. J. Oper. Res. 297, No. 3, 1112-1125 (2022). MSC: 90B25 90C57 PDFBibTeX XMLCite \textit{M. Reihaneh} et al., Eur. J. Oper. Res. 297, No. 3, 1112--1125 (2022; Zbl 1490.90107) Full Text: DOI
Schepler, Xavier; Rossi, André; Gurevsky, Evgeny; Dolgui, Alexandre Solving robust bin-packing problems with a branch-and-price approach. (English) Zbl 1490.90256 Eur. J. Oper. Res. 297, No. 3, 831-843 (2022). MSC: 90C27 90C10 90C57 PDFBibTeX XMLCite \textit{X. Schepler} et al., Eur. J. Oper. Res. 297, No. 3, 831--843 (2022; Zbl 1490.90256) Full Text: DOI Link
Benati, Stefano; Ponce, Diego; Puerto, Justo; Rodríguez-Chía, Antonio M. A branch-and-price procedure for clustering data that are graph connected. (English) Zbl 1490.90290 Eur. J. Oper. Res. 297, No. 3, 817-830 (2022). MSC: 90C35 90C10 90C05 90C11 90C57 PDFBibTeX XMLCite \textit{S. Benati} et al., Eur. J. Oper. Res. 297, No. 3, 817--830 (2022; Zbl 1490.90290) Full Text: DOI arXiv
Borgonjon, Tessa; Maenhout, Broos An exact approach for the personnel task rescheduling problem with task retiming. (English) Zbl 1490.90119 Eur. J. Oper. Res. 296, No. 2, 465-484 (2022). MSC: 90B35 90B70 90C57 PDFBibTeX XMLCite \textit{T. Borgonjon} and \textit{B. Maenhout}, Eur. J. Oper. Res. 296, No. 2, 465--484 (2022; Zbl 1490.90119) Full Text: DOI
Hernández-Pérez, Hipólito; Salazar-González, Juan-José A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem. (English) Zbl 1487.90110 Eur. J. Oper. Res. 297, No. 2, 467-483 (2022). MSC: 90B06 90C11 90C57 PDFBibTeX XMLCite \textit{H. Hernández-Pérez} and \textit{J.-J. Salazar-González}, Eur. J. Oper. Res. 297, No. 2, 467--483 (2022; Zbl 1487.90110) Full Text: DOI
Novak, Antonin; Sucha, Premysl; Novotny, Matej; Stec, Richard; Hanzalek, Zdenek Scheduling jobs with normally distributed processing times on parallel machines. (English) Zbl 1487.90337 Eur. J. Oper. Res. 297, No. 2, 422-441 (2022). MSC: 90B36 90C57 PDFBibTeX XMLCite \textit{A. Novak} et al., Eur. J. Oper. Res. 297, No. 2, 422--441 (2022; Zbl 1487.90337) Full Text: DOI
Bachtenkirch, David; Bock, Stefan Finding efficient make-to-order production and batch delivery schedules. (English) Zbl 1487.90267 Eur. J. Oper. Res. 297, No. 1, 133-152 (2022). MSC: 90B35 90C57 90C59 PDFBibTeX XMLCite \textit{D. Bachtenkirch} and \textit{S. Bock}, Eur. J. Oper. Res. 297, No. 1, 133--152 (2022; Zbl 1487.90267) Full Text: DOI
Zhou, Yi; Lin, Weibo; Hao, Jin-Kao; Xiao, Mingyu; Jin, Yan An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem. (English) Zbl 1487.90632 Eur. J. Oper. Res. 297, No. 1, 27-39 (2022). MSC: 90C35 05C85 05C69 90C27 90C57 91D30 PDFBibTeX XMLCite \textit{Y. Zhou} et al., Eur. J. Oper. Res. 297, No. 1, 27--39 (2022; Zbl 1487.90632) Full Text: DOI
Bulhões, Teobaldo; Correia, Rubens; Subramanian, Anand Conference scheduling: a clustering-based approach. (English) Zbl 1487.90275 Eur. J. Oper. Res. 297, No. 1, 15-26 (2022). MSC: 90B35 90C10 90C57 PDFBibTeX XMLCite \textit{T. Bulhões} et al., Eur. J. Oper. Res. 297, No. 1, 15--26 (2022; Zbl 1487.90275) Full Text: DOI
Walter, Rico; Schulze, Philipp; Scholl, Armin SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing. (English) Zbl 1490.90113 Eur. J. Oper. Res. 295, No. 3, 857-873 (2021). MSC: 90B30 90B35 90C27 90C39 90C57 PDFBibTeX XMLCite \textit{R. Walter} et al., Eur. J. Oper. Res. 295, No. 3, 857--873 (2021; Zbl 1490.90113) Full Text: DOI
Canca, David; Andrade-Pineda, José Luis; De-Los-Santos, Alicia; González-R, Pedro Luis A quantitative approach for the long-term assessment of railway rapid transit network construction or expansion projects. (English) Zbl 1487.90277 Eur. J. Oper. Res. 294, No. 2, 604-621 (2021). MSC: 90B35 90B06 90B10 90C11 90C57 PDFBibTeX XMLCite \textit{D. Canca} et al., Eur. J. Oper. Res. 294, No. 2, 604--621 (2021; Zbl 1487.90277) Full Text: DOI
Heßler, Katrin Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes. (English) Zbl 1487.90111 Eur. J. Oper. Res. 294, No. 1, 188-205 (2021). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{K. Heßler}, Eur. J. Oper. Res. 294, No. 1, 188--205 (2021; Zbl 1487.90111) Full Text: DOI Link
Visentin, Andrea; Prestwich, Steven; Rossi, Roberto; Tarim, S. Armagan Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming. (English) Zbl 1487.90053 Eur. J. Oper. Res. 294, No. 1, 91-99 (2021). MSC: 90B05 90C15 90C39 90C57 PDFBibTeX XMLCite \textit{A. Visentin} et al., Eur. J. Oper. Res. 294, No. 1, 91--99 (2021; Zbl 1487.90053) Full Text: DOI arXiv
Furini, Fabio; Ljubić, Ivana; San Segundo, Pablo; Zhao, Yanlu A branch-and-cut algorithm for the edge interdiction clique problem. (English) Zbl 1487.90618 Eur. J. Oper. Res. 294, No. 1, 54-69 (2021). MSC: 90C35 05C85 90C27 90C57 PDFBibTeX XMLCite \textit{F. Furini} et al., Eur. J. Oper. Res. 294, No. 1, 54--69 (2021; Zbl 1487.90618) Full Text: DOI Link
Liu, Shaonan; Wang, Mingzheng; Kong, Nan; Hu, Xiangpei An enhanced branch-and-bound algorithm for bilevel integer linear programming. (English) Zbl 1487.90482 Eur. J. Oper. Res. 291, No. 2, 661-679 (2021). MSC: 90C10 90C05 90C57 PDFBibTeX XMLCite \textit{S. Liu} et al., Eur. J. Oper. Res. 291, No. 2, 661--679 (2021; Zbl 1487.90482) Full Text: DOI
Hottenrott, Andreas; Waidner, Leon; Grunow, Martin Robust car sequencing for automotive assembly. (English) Zbl 1487.90250 Eur. J. Oper. Res. 291, No. 3, 983-994 (2021). MSC: 90B30 90B35 90C57 90C59 PDFBibTeX XMLCite \textit{A. Hottenrott} et al., Eur. J. Oper. Res. 291, No. 3, 983--994 (2021; Zbl 1487.90250) Full Text: DOI
Zhang, Jie; Xie, Weijun; Sarin, Subhash C. Robust multi-product newsvendor model with uncertain demand and substitution. (English) Zbl 1487.90062 Eur. J. Oper. Res. 293, No. 1, 190-202 (2021). MSC: 90B05 90B30 90C11 90C15 90C57 PDFBibTeX XMLCite \textit{J. Zhang} et al., Eur. J. Oper. Res. 293, No. 1, 190--202 (2021; Zbl 1487.90062) Full Text: DOI Link
Roshanaei, Vahid; Naderi, Bahman Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut. (English) Zbl 1487.90317 Eur. J. Oper. Res. 293, No. 1, 65-78 (2021). MSC: 90B35 90C11 90C57 PDFBibTeX XMLCite \textit{V. Roshanaei} and \textit{B. Naderi}, Eur. J. Oper. Res. 293, No. 1, 65--78 (2021; Zbl 1487.90317) Full Text: DOI
Christensen, Tue Rauff Lind; Klose, Andreas A fast exact method for the capacitated facility location problem with differentiable convex production costs. (English) Zbl 1487.90433 Eur. J. Oper. Res. 292, No. 3, 855-868 (2021). MSC: 90B80 90C10 90C30 90C57 PDFBibTeX XMLCite \textit{T. R. L. Christensen} and \textit{A. Klose}, Eur. J. Oper. Res. 292, No. 3, 855--868 (2021; Zbl 1487.90433) Full Text: DOI
Jin, Bo; Yu, Mingzhu Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka & Tierney (2018). (English) Zbl 1487.90118 Eur. J. Oper. Res. 293, No. 2, 802-807 (2021). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{B. Jin} and \textit{M. Yu}, Eur. J. Oper. Res. 293, No. 2, 802--807 (2021; Zbl 1487.90118) Full Text: DOI
Soares, Inês; Alves, Maria João; Henggeler Antunes, Carlos A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem. (English) Zbl 1487.90492 Eur. J. Oper. Res. 291, No. 1, 52-66 (2021). MSC: 90C11 90C26 90C57 91B74 PDFBibTeX XMLCite \textit{I. Soares} et al., Eur. J. Oper. Res. 291, No. 1, 52--66 (2021; Zbl 1487.90492) Full Text: DOI
Corberán, Ángel; Plana, Isaac; Reula, Miguel; Sanchis, José M. On the distance-constrained close enough arc routing problem. (English) Zbl 1487.90547 Eur. J. Oper. Res. 291, No. 1, 32-51 (2021). MSC: 90C27 90B06 90C35 90C57 PDFBibTeX XMLCite \textit{Á. Corberán} et al., Eur. J. Oper. Res. 291, No. 1, 32--51 (2021; Zbl 1487.90547) Full Text: DOI
Manousakis, Eleftherios; Repoussis, Panagiotis; Zachariadis, Emmanouil; Tarantilis, Christos Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation. (English) Zbl 1487.90036 Eur. J. Oper. Res. 290, No. 3, 870-885 (2021). MSC: 90B05 90B06 90C57 PDFBibTeX XMLCite \textit{E. Manousakis} et al., Eur. J. Oper. Res. 290, No. 3, 870--885 (2021; Zbl 1487.90036) Full Text: DOI
Maher, Stephen J. Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework. (English) Zbl 1487.90487 Eur. J. Oper. Res. 290, No. 2, 479-498 (2021). MSC: 90C11 90C57 90-04 PDFBibTeX XMLCite \textit{S. J. Maher}, Eur. J. Oper. Res. 290, No. 2, 479--498 (2021; Zbl 1487.90487) Full Text: DOI
Letsios, Dimitrios; Mistry, Miten; Misener, Ruth Exact lexicographic scheduling and approximate rescheduling. (English) Zbl 1487.90303 Eur. J. Oper. Res. 290, No. 2, 469-478 (2021). MSC: 90B35 90C17 90C27 90C57 91B32 PDFBibTeX XMLCite \textit{D. Letsios} et al., Eur. J. Oper. Res. 290, No. 2, 469--478 (2021; Zbl 1487.90303) Full Text: DOI arXiv
Yue, Qing; Zhou, Shenghai Due-window assignment scheduling problem with stochastic processing times. (English) Zbl 1487.90342 Eur. J. Oper. Res. 290, No. 2, 453-468 (2021). MSC: 90B36 90C57 PDFBibTeX XMLCite \textit{Q. Yue} and \textit{S. Zhou}, Eur. J. Oper. Res. 290, No. 2, 453--468 (2021; Zbl 1487.90342) Full Text: DOI
Bengio, Yoshua; Lodi, Andrea; Prouvost, Antoine Machine learning for combinatorial optimization: a methodological tour d’horizon. (English) Zbl 1487.90541 Eur. J. Oper. Res. 290, No. 2, 405-421 (2021). MSC: 90C27 68T05 68T20 90-02 90C11 90C57 90C59 PDFBibTeX XMLCite \textit{Y. Bengio} et al., Eur. J. Oper. Res. 290, No. 2, 405--421 (2021; Zbl 1487.90541) Full Text: DOI arXiv
Di Francesco, Massimo; Gaudioso, Manlio; Gorgone, Enrico; Murthy, Ishwar A new extended formulation with valid inequalities for the capacitated concentrator location problem. (English) Zbl 1487.90435 Eur. J. Oper. Res. 289, No. 3, 975-986 (2021). MSC: 90B80 90C10 90C57 PDFBibTeX XMLCite \textit{M. Di Francesco} et al., Eur. J. Oper. Res. 289, No. 3, 975--986 (2021; Zbl 1487.90435) Full Text: DOI
Casazza, Marco; Ceselli, Alberto; Wolfler Calvo, Roberto A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem. (English) Zbl 1487.90083 Eur. J. Oper. Res. 289, No. 3, 897-911 (2021). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{M. Casazza} et al., Eur. J. Oper. Res. 289, No. 3, 897--911 (2021; Zbl 1487.90083) Full Text: DOI
Lera-Romero, Gonzalo; Miranda-Bront, Juan José A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints. (English) Zbl 1487.90623 Eur. J. Oper. Res. 289, No. 3, 879-896 (2021). MSC: 90C35 90B06 90C27 90C57 PDFBibTeX XMLCite \textit{G. Lera-Romero} and \textit{J. J. Miranda-Bront}, Eur. J. Oper. Res. 289, No. 3, 879--896 (2021; Zbl 1487.90623) Full Text: DOI
Wolfinger, David; Salazar-González, Juan-José The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach. (English) Zbl 1487.90182 Eur. J. Oper. Res. 289, No. 2, 470-484 (2021). MSC: 90B06 90C35 90C57 PDFBibTeX XMLCite \textit{D. Wolfinger} and \textit{J.-J. Salazar-González}, Eur. J. Oper. Res. 289, No. 2, 470--484 (2021; Zbl 1487.90182) Full Text: DOI
Coniglio, Stefano; Furini, Fabio; San Segundo, Pablo A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts. (English) Zbl 1487.90546 Eur. J. Oper. Res. 289, No. 2, 435-455 (2021). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{S. Coniglio} et al., Eur. J. Oper. Res. 289, No. 2, 435--455 (2021; Zbl 1487.90546) Full Text: DOI Link
Schenekemberg, Cleder M.; Scarpin, Cassius T.; Pécora, José E.; Guimarães, Thiago A.; Coelho, Leandro C. The two-echelon production-routing problem. (English) Zbl 1487.90166 Eur. J. Oper. Res. 288, No. 2, 436-449 (2021). MSC: 90B06 90B05 90B30 90C57 PDFBibTeX XMLCite \textit{C. M. Schenekemberg} et al., Eur. J. Oper. Res. 288, No. 2, 436--449 (2021; Zbl 1487.90166) Full Text: DOI
Gliesch, Alex; Ritt, Marcus A hybrid heuristic for the maximum dispersion problem. (English) Zbl 1487.90619 Eur. J. Oper. Res. 288, No. 3, 721-735 (2021). MSC: 90C35 05C15 90C59 PDFBibTeX XMLCite \textit{A. Gliesch} and \textit{M. Ritt}, Eur. J. Oper. Res. 288, No. 3, 721--735 (2021; Zbl 1487.90619) Full Text: DOI
Bacci, Tiziano; Mattia, Sara; Ventura, Paolo A branch-and-cut algorithm for the restricted block relocation problem. (English) Zbl 1487.90428 Eur. J. Oper. Res. 287, No. 2, 452-459 (2020). MSC: 90B80 90B06 90C10 90C57 PDFBibTeX XMLCite \textit{T. Bacci} et al., Eur. J. Oper. Res. 287, No. 2, 452--459 (2020; Zbl 1487.90428) Full Text: DOI
Şuvak, Zeynep; Altınel, İ. Kuban; Aras, Necati Exact solution algorithms for the maximum flow problem with additional conflict constraints. (English) Zbl 1487.90629 Eur. J. Oper. Res. 287, No. 2, 410-437 (2020). MSC: 90C35 90C27 90C57 PDFBibTeX XMLCite \textit{Z. Şuvak} et al., Eur. J. Oper. Res. 287, No. 2, 410--437 (2020; Zbl 1487.90629) Full Text: DOI
Queiroga, Eduardo; Frota, Yuri; Sadykov, Ruslan; Subramanian, Anand; Uchoa, Eduardo; Vidal, Thibaut On the exact solution of vehicle routing problems with backhauls. (English) Zbl 1443.90128 Eur. J. Oper. Res. 287, No. 1, 76-89 (2020). MSC: 90B06 90C57 90C10 PDFBibTeX XMLCite \textit{E. Queiroga} et al., Eur. J. Oper. Res. 287, No. 1, 76--89 (2020; Zbl 1443.90128) Full Text: DOI HAL
Ritt, Marcus; Pereira, Jordi Heuristic and exact algorithms for minimum-weight non-spanning arborescences. (English) Zbl 1443.90325 Eur. J. Oper. Res. 287, No. 1, 61-75 (2020). MSC: 90C35 90C10 90C57 90C59 PDFBibTeX XMLCite \textit{M. Ritt} and \textit{J. Pereira}, Eur. J. Oper. Res. 287, No. 1, 61--75 (2020; Zbl 1443.90325) Full Text: DOI
Yuan, Yuan; Cattaruzza, Diego; Ogier, Maxime; Semet, Frédéric A branch-and-cut algorithm for the generalized traveling salesman problem with time windows. (English) Zbl 1443.90327 Eur. J. Oper. Res. 286, No. 3, 849-866 (2020). MSC: 90C35 90C27 90C57 PDFBibTeX XMLCite \textit{Y. Yuan} et al., Eur. J. Oper. Res. 286, No. 3, 849--866 (2020; Zbl 1443.90327) Full Text: DOI HAL
Davari, Morteza; Ranjbar, Mohammad; De Causmaecker, Patrick; Leus, Roel Minimizing makespan on a single machine with release dates and inventory constraints. (English) Zbl 1443.90177 Eur. J. Oper. Res. 286, No. 1, 115-128 (2020). MSC: 90B35 90C39 90C57 PDFBibTeX XMLCite \textit{M. Davari} et al., Eur. J. Oper. Res. 286, No. 1, 115--128 (2020; Zbl 1443.90177) Full Text: DOI Link
Gouveia, Luis; Leitner, Markus; Ruthmair, Mario; Sadykov, Ruslan Corrigendum to: “Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem”. (English) Zbl 1434.90098 Eur. J. Oper. Res. 285, No. 3, 1199-1203 (2020). MSC: 90C10 90C35 90C27 90C57 PDFBibTeX XMLCite \textit{L. Gouveia} et al., Eur. J. Oper. Res. 285, No. 3, 1199--1203 (2020; Zbl 1434.90098) Full Text: DOI
Yoo, Yeawon; Escobedo, Adolfo R.; Skolfield, J. Kyle A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings. (English) Zbl 1443.91120 Eur. J. Oper. Res. 285, No. 3, 1025-1041 (2020). MSC: 91B06 62H20 90C57 PDFBibTeX XMLCite \textit{Y. Yoo} et al., Eur. J. Oper. Res. 285, No. 3, 1025--1041 (2020; Zbl 1443.91120) Full Text: DOI arXiv
Aziez, Imadeddine; Côté, Jean-François; Coelho, Leandro C. Exact algorithms for the multi-pickup and delivery problem with time windows. (English) Zbl 1441.90016 Eur. J. Oper. Res. 284, No. 3, 906-919 (2020). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{I. Aziez} et al., Eur. J. Oper. Res. 284, No. 3, 906--919 (2020; Zbl 1441.90016) Full Text: DOI
Li, Zixiang; Kucukkoc, Ibrahim; Zhang, Zikai Branch, bound and remember algorithm for two-sided assembly line balancing problem. (English) Zbl 1441.90055 Eur. J. Oper. Res. 284, No. 3, 896-905 (2020). MSC: 90B30 90C27 90C57 PDFBibTeX XMLCite \textit{Z. Li} et al., Eur. J. Oper. Res. 284, No. 3, 896--905 (2020; Zbl 1441.90055) Full Text: DOI
Gmys, Jan; Mezmaz, Mohand; Melab, Nouredine; Tuyttens, Daniel A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem. (English) Zbl 1441.90061 Eur. J. Oper. Res. 284, No. 3, 814-833 (2020). MSC: 90B35 90C57 65K05 65Y05 PDFBibTeX XMLCite \textit{J. Gmys} et al., Eur. J. Oper. Res. 284, No. 3, 814--833 (2020; Zbl 1441.90061) Full Text: DOI HAL
Homsi, Gabriel; Martinelli, Rafael; Vidal, Thibaut; Fagerholt, Kjetil Industrial and tramp ship routing problems: closing the gap for real-scale instances. (English) Zbl 1441.90032 Eur. J. Oper. Res. 283, No. 3, 972-990 (2020). MSC: 90B06 90B35 90C57 90C59 90C35 PDFBibTeX XMLCite \textit{G. Homsi} et al., Eur. J. Oper. Res. 283, No. 3, 972--990 (2020; Zbl 1441.90032) Full Text: DOI arXiv
Zweers, Bernard G.; Bhulai, Sandjai; van der Mei, Rob D. Optimizing pre-processing and relocation moves in the stochastic container relocation problem. (English) Zbl 1441.90044 Eur. J. Oper. Res. 283, No. 3, 954-971 (2020). MSC: 90B06 90B80 90C57 PDFBibTeX XMLCite \textit{B. G. Zweers} et al., Eur. J. Oper. Res. 283, No. 3, 954--971 (2020; Zbl 1441.90044) Full Text: DOI Link
Bertazzi, Luca; Laganà, Demetrio; Ohlmann, Jeffrey W.; Paradiso, Rosario An exact approach for cyclic inbound inventory routing in a level production system. (English) Zbl 1441.90003 Eur. J. Oper. Res. 283, No. 3, 915-928 (2020). MSC: 90B05 90C57 PDFBibTeX XMLCite \textit{L. Bertazzi} et al., Eur. J. Oper. Res. 283, No. 3, 915--928 (2020; Zbl 1441.90003) Full Text: DOI
Bock, Stefan Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios. (English) Zbl 1441.90018 Eur. J. Oper. Res. 283, No. 3, 863-882 (2020). MSC: 90B06 90B35 90C60 PDFBibTeX XMLCite \textit{S. Bock}, Eur. J. Oper. Res. 283, No. 3, 863--882 (2020; Zbl 1441.90018) Full Text: DOI
Alvarez, Aldair; Cordeau, Jean-François; Jans, Raf; Munari, Pedro; Morabito, Reinaldo Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products. (English) Zbl 1431.90013 Eur. J. Oper. Res. 283, No. 2, 511-529 (2020). MSC: 90B06 90B05 90C57 90C59 PDFBibTeX XMLCite \textit{A. Alvarez} et al., Eur. J. Oper. Res. 283, No. 2, 511--529 (2020; Zbl 1431.90013) Full Text: DOI
Nasirian, Farzaneh; Mahdavi Pajouh, Foad; Balasundaram, Balabhaskar Detecting a most closeness-central clique in complex networks. (English) Zbl 1431.90165 Eur. J. Oper. Res. 283, No. 2, 461-475 (2020). MSC: 90C35 90C11 90C57 PDFBibTeX XMLCite \textit{F. Nasirian} et al., Eur. J. Oper. Res. 283, No. 2, 461--475 (2020; Zbl 1431.90165) Full Text: DOI
Tilk, Christian; Goel, Asvin Bidirectional labeling for solving vehicle routing and truck driver scheduling problems. (English) Zbl 1431.90071 Eur. J. Oper. Res. 283, No. 1, 108-124 (2020). MSC: 90B35 90B06 90C57 PDFBibTeX XMLCite \textit{C. Tilk} and \textit{A. Goel}, Eur. J. Oper. Res. 283, No. 1, 108--124 (2020; Zbl 1431.90071) Full Text: DOI
Silva, Marco; Poss, Michael; Maculan, Nelson Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty. (English) Zbl 1431.90070 Eur. J. Oper. Res. 283, No. 1, 70-82 (2020). MSC: 90B35 90C57 PDFBibTeX XMLCite \textit{M. Silva} et al., Eur. J. Oper. Res. 283, No. 1, 70--82 (2020; Zbl 1431.90070) Full Text: DOI HAL
Chitsaz, Masoud; Cordeau, Jean-François; Jans, Raf A branch-and-cut algorithm for an assembly routing problem. (English) Zbl 1431.90003 Eur. J. Oper. Res. 282, No. 3, 896-910 (2020). MSC: 90B05 90B06 90C35 90C57 PDFBibTeX XMLCite \textit{M. Chitsaz} et al., Eur. J. Oper. Res. 282, No. 3, 896--910 (2020; Zbl 1431.90003) Full Text: DOI
Archetti, Claudia; Speranza, M. Grazia; Boccia, Maurizio; Sforza, Antonio; Sterle, Claudio A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries. (English) Zbl 1431.90002 Eur. J. Oper. Res. 282, No. 3, 886-895 (2020). MSC: 90B05 90B06 90C57 PDFBibTeX XMLCite \textit{C. Archetti} et al., Eur. J. Oper. Res. 282, No. 3, 886--895 (2020; Zbl 1431.90002) Full Text: DOI
Hanafi, Saïd; Mansini, Renata; Zanotti, Roberto The multi-visit team orienteering problem with precedence constraints. (English) Zbl 1430.90086 Eur. J. Oper. Res. 282, No. 2, 515-529 (2020). MSC: 90B06 90C11 90C35 90C57 PDFBibTeX XMLCite \textit{S. Hanafi} et al., Eur. J. Oper. Res. 282, No. 2, 515--529 (2020; Zbl 1430.90086) Full Text: DOI
Fischetti, Matteo; Monaci, Michele A branch-and-cut algorithm for mixed-integer bilinear programming. (English) Zbl 1430.90431 Eur. J. Oper. Res. 282, No. 2, 506-514 (2020). MSC: 90C11 90C20 90C57 PDFBibTeX XMLCite \textit{M. Fischetti} and \textit{M. Monaci}, Eur. J. Oper. Res. 282, No. 2, 506--514 (2020; Zbl 1430.90431) Full Text: DOI Link
Marendet, Antoine; Goldsztejn, Alexandre; Chabert, Gilles; Jermann, Christophe A standard branch-and-bound approach for nonlinear semi-infinite problems. (English) Zbl 1430.90536 Eur. J. Oper. Res. 282, No. 2, 438-452 (2020). MSC: 90C34 90C30 65K05 PDFBibTeX XMLCite \textit{A. Marendet} et al., Eur. J. Oper. Res. 282, No. 2, 438--452 (2020; Zbl 1430.90536) Full Text: DOI HAL
Bettinelli, Andrea; Cacchiani, Valentina; Crainic, Teodor Gabriel; Vigo, Daniele A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities. (English) Zbl 1430.90058 Eur. J. Oper. Res. 279, No. 3, 824-839 (2019). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{A. Bettinelli} et al., Eur. J. Oper. Res. 279, No. 3, 824--839 (2019; Zbl 1430.90058) Full Text: DOI
Göpfert, Paul; Bock, Stefan A branch&cut approach to recharging and refueling infrastructure planning. (English) Zbl 1430.90376 Eur. J. Oper. Res. 279, No. 3, 808-823 (2019). MSC: 90B80 90B06 90C57 PDFBibTeX XMLCite \textit{P. Göpfert} and \textit{S. Bock}, Eur. J. Oper. Res. 279, No. 3, 808--823 (2019; Zbl 1430.90376) Full Text: DOI
Tanaka, Shunji; Voß, Stefan An exact algorithm for the block relocation problem with a stowage plan. (English) Zbl 1430.90139 Eur. J. Oper. Res. 279, No. 3, 767-781 (2019). MSC: 90B06 90C27 90B80 PDFBibTeX XMLCite \textit{S. Tanaka} and \textit{S. Voß}, Eur. J. Oper. Res. 279, No. 3, 767--781 (2019; Zbl 1430.90139) Full Text: DOI
Chassein, André; Goerigk, Marc; Kurtz, Jannis; Poss, Michael Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty. (English) Zbl 1430.90478 Eur. J. Oper. Res. 279, No. 2, 308-319 (2019). MSC: 90C27 90C31 90C17 PDFBibTeX XMLCite \textit{A. Chassein} et al., Eur. J. Oper. Res. 279, No. 2, 308--319 (2019; Zbl 1430.90478) Full Text: DOI arXiv
Tanaka, Shunji; Tierney, Kevin; Parreño-Torres, Consuelo; Alvarez-Valdes, Ramon; Ruiz, Rubén A branch and bound approach for large pre-marshalling problems. (English) Zbl 1430.90138 Eur. J. Oper. Res. 278, No. 1, 211-225 (2019). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{S. Tanaka} et al., Eur. J. Oper. Res. 278, No. 1, 211--225 (2019; Zbl 1430.90138) Full Text: DOI Link
San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; Ljubić, Ivana A new branch-and-bound algorithm for the maximum edge-weighted clique problem. (English) Zbl 1430.90552 Eur. J. Oper. Res. 278, No. 1, 76-90 (2019). MSC: 90C35 05C85 90C27 PDFBibTeX XMLCite \textit{P. San Segundo} et al., Eur. J. Oper. Res. 278, No. 1, 76--90 (2019; Zbl 1430.90552) Full Text: DOI Link
Becker, Henrique; Buriol, Luciana S. An empirical analysis of exact algorithms for the unbounded knapsack problem. (English) Zbl 1430.90475 Eur. J. Oper. Res. 277, No. 1, 84-99 (2019). MSC: 90C27 90C10 90C39 PDFBibTeX XMLCite \textit{H. Becker} and \textit{L. S. Buriol}, Eur. J. Oper. Res. 277, No. 1, 84--99 (2019; Zbl 1430.90475) Full Text: DOI arXiv
Demiröz, Barış Evrim; Altınel, İ. Kuban; Akarun, Lale Rectangle blanket problem: binary integer linear programming formulation and solution algorithms. (English) Zbl 1430.90422 Eur. J. Oper. Res. 277, No. 1, 62-83 (2019). MSC: 90C10 90C27 65D19 90C57 90C59 PDFBibTeX XMLCite \textit{B. E. Demiröz} et al., Eur. J. Oper. Res. 277, No. 1, 62--83 (2019; Zbl 1430.90422) Full Text: DOI arXiv
Tilk, Christian; Drexl, Michael; Irnich, Stefan Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies. (English) Zbl 1430.90141 Eur. J. Oper. Res. 276, No. 2, 549-565 (2019). MSC: 90B06 90C57 PDFBibTeX XMLCite \textit{C. Tilk} et al., Eur. J. Oper. Res. 276, No. 2, 549--565 (2019; Zbl 1430.90141) Full Text: DOI Link
Bektaş, Tolga; Gouveia, Luís; Santos, Daniel Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm. (English) Zbl 1430.90371 Eur. J. Oper. Res. 276, No. 1, 40-64 (2019). MSC: 90B80 05C45 90C27 90C57 90B10 90C35 PDFBibTeX XMLCite \textit{T. Bektaş} et al., Eur. J. Oper. Res. 276, No. 1, 40--64 (2019; Zbl 1430.90371) Full Text: DOI
Wang, Guanglei; Ben-Ameur, Walid; Ouorou, Adam A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines. (English) Zbl 1430.90424 Eur. J. Oper. Res. 276, No. 1, 28-39 (2019). MSC: 90C10 90C90 PDFBibTeX XMLCite \textit{G. Wang} et al., Eur. J. Oper. Res. 276, No. 1, 28--39 (2019; Zbl 1430.90424) Full Text: DOI arXiv
Bourque, François-Alex Solving the moving target search problem using indistinguishable searchers. (English) Zbl 1430.90307 Eur. J. Oper. Res. 275, No. 1, 45-52 (2019). MSC: 90B40 90C10 PDFBibTeX XMLCite \textit{F.-A. Bourque}, Eur. J. Oper. Res. 275, No. 1, 45--52 (2019; Zbl 1430.90307) Full Text: DOI
Braune, Roland Lower bounds for a bin packing problem with linear usage cost. (English) Zbl 1430.90477 Eur. J. Oper. Res. 274, No. 1, 49-64 (2019). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{R. Braune}, Eur. J. Oper. Res. 274, No. 1, 49--64 (2019; Zbl 1430.90477) Full Text: DOI
Rodríguez-Martín, Inmaculada; Salazar-González, Juan-José; Yaman, Hande The periodic vehicle routing problem with driver consistency. (English) Zbl 1403.90165 Eur. J. Oper. Res. 273, No. 2, 575-584 (2019). MSC: 90B06 90C57 90C35 PDFBibTeX XMLCite \textit{I. Rodríguez-Martín} et al., Eur. J. Oper. Res. 273, No. 2, 575--584 (2019; Zbl 1403.90165) Full Text: DOI Link
Zetina, Carlos Armando; Contreras, Ivan; Fernández, Elena; Luna-Mota, Carlos Solving the optimum communication spanning tree problem. (English) Zbl 1403.90214 Eur. J. Oper. Res. 273, No. 1, 108-117 (2019). MSC: 90B10 90C35 90B18 90C57 PDFBibTeX XMLCite \textit{C. A. Zetina} et al., Eur. J. Oper. Res. 273, No. 1, 108--117 (2019; Zbl 1403.90214) Full Text: DOI Link