Lü, Zhipeng; Fang, Yuan; Su, Zhouxing; Wang, Yang; Wu, Xinyun; Glover, Fred Dual-neighborhood iterated local search for routing and wavelength assignment. (English) Zbl 07764432 Comput. Oper. Res. 160, Article ID 106396, 13 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{Z. Lü} et al., Comput. Oper. Res. 160, Article ID 106396, 13 p. (2023; Zbl 07764432) Full Text: DOI
Zhang, Qingyun; Lü, Zhipeng; Su, Zhouxing; Li, Chumin A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem. (English) Zbl 07764418 Comput. Oper. Res. 160, Article ID 106373, 15 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{Q. Zhang} et al., Comput. Oper. Res. 160, Article ID 106373, 15 p. (2023; Zbl 07764418) Full Text: DOI
Granata, Donatella; Sgalambro, Antonino A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem. (English) Zbl 07764410 Comput. Oper. Res. 160, Article ID 106363, 14 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{D. Granata} and \textit{A. Sgalambro}, Comput. Oper. Res. 160, Article ID 106363, 14 p. (2023; Zbl 07764410) Full Text: DOI
Espejo, Inmaculada; Marín, Alfredo The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation. (English) Zbl 07737033 Comput. Oper. Res. 159, Article ID 106354, 13 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{I. Espejo} and \textit{A. Marín}, Comput. Oper. Res. 159, Article ID 106354, 13 p. (2023; Zbl 07737033) Full Text: DOI
Ghatkar, Shraddha; Arulselvan, Ashwin; Morton, Alec Solution techniques for bi-level knapsack problems. (English) Zbl 07737022 Comput. Oper. Res. 159, Article ID 106343, 10 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{S. Ghatkar} et al., Comput. Oper. Res. 159, Article ID 106343, 10 p. (2023; Zbl 07737022) Full Text: DOI
Landete, Mercedes; Plana, Isaac; Sainz-Pardo, José Luis; Sanchis, José María Upgrading edges in the graphical TSP. (English) Zbl 07737009 Comput. Oper. Res. 159, Article ID 106321, 15 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{M. Landete} et al., Comput. Oper. Res. 159, Article ID 106321, 15 p. (2023; Zbl 07737009) Full Text: DOI
Ghosh, Mayukh; Kuiper, Alex; Mahes, Roshan; Maragno, Donato Learn global and optimize local: a data-driven methodology for last-mile routing. (English) Zbl 07737000 Comput. Oper. Res. 159, Article ID 106312, 12 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{M. Ghosh} et al., Comput. Oper. Res. 159, Article ID 106312, 12 p. (2023; Zbl 07737000) Full Text: DOI arXiv
Tellache, Nour ElHouda; Kerbache, Laoucine A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan. (English) Zbl 07706750 Comput. Oper. Res. 156, Article ID 106247, 22 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{N. E. Tellache} and \textit{L. Kerbache}, Comput. Oper. Res. 156, Article ID 106247, 22 p. (2023; Zbl 07706750) Full Text: DOI
Lozano, Manuel; Rodriguez-Tello, Eduardo Population-based iterated greedy algorithm for the S-labeling problem. (English) Zbl 07706736 Comput. Oper. Res. 155, Article ID 106224, 17 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{M. Lozano} and \textit{E. Rodriguez-Tello}, Comput. Oper. Res. 155, Article ID 106224, 17 p. (2023; Zbl 07706736) Full Text: DOI
Cerdeira, Jorge Orestes; Martins, Maria João; Raydan, Marcos The max-out min-in problem: a tool for data analysis. (English) Zbl 07706726 Comput. Oper. Res. 154, Article ID 106218, 11 p. (2023). MSC: 90Bxx 90C27 05C22 90C20 68Q25 62H30 PDFBibTeX XMLCite \textit{J. O. Cerdeira} et al., Comput. Oper. Res. 154, Article ID 106218, 11 p. (2023; Zbl 07706726) Full Text: DOI
Sun, Rui; Wu, Jieyu; Jin, Chenghou; Wang, Yiyuan; Zhou, Wenbo; Yin, Minghao An efficient local search algorithm for minimum positive influence dominating set problem. (English) Zbl 07706715 Comput. Oper. Res. 154, Article ID 106197, 14 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{R. Sun} et al., Comput. Oper. Res. 154, Article ID 106197, 14 p. (2023; Zbl 07706715) Full Text: DOI
Zheng, Shuang; He, Zhengwen; Yang, Zhen; Chu, Chengbin; Wang, Nengmin Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem. (English) Zbl 07706583 Comput. Oper. Res. 153, Article ID 106183, 19 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{S. Zheng} et al., Comput. Oper. Res. 153, Article ID 106183, 19 p. (2023; Zbl 07706583) Full Text: DOI
Bargetto, Roberto; Garaix, Thierry; Xie, Xiaolan A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints. (English) Zbl 07706556 Comput. Oper. Res. 152, Article ID 106136, 20 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{R. Bargetto} et al., Comput. Oper. Res. 152, Article ID 106136, 20 p. (2023; Zbl 07706556) Full Text: DOI
de Meijer, Frank; Sotirov, Renata; Wiegele, Angelika; Zhao, Shudian Partitioning through projections: strong SDP bounds for large graph partition problems. (English) Zbl 07706523 Comput. Oper. Res. 151, Article ID 106088, 20 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{F. de Meijer} et al., Comput. Oper. Res. 151, Article ID 106088, 20 p. (2023; Zbl 07706523) Full Text: DOI arXiv
Catanzaro, Daniele; Frohn, Martin; Gascuel, Olivier; Pesenti, Raffaele A massively parallel branch-&-bound algorithm for the balanced minimum evolution problem. (English) Zbl 07705502 Comput. Oper. Res. 158, Article ID 106308, 17 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{D. Catanzaro} et al., Comput. Oper. Res. 158, Article ID 106308, 17 p. (2023; Zbl 07705502) Full Text: DOI
Gao, Mujin; Chen, Yanru; Li, Junheng; Wahab, M. I. M. Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows. (English) Zbl 07705480 Comput. Oper. Res. 157, Article ID 106267, 14 p. (2023). MSC: 90Bxx PDFBibTeX XMLCite \textit{M. Gao} et al., Comput. Oper. Res. 157, Article ID 106267, 14 p. (2023; Zbl 07705480) Full Text: DOI
Buchholz, Peter; Dohndorf, Iryna Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights. (English) Zbl 1520.90193 Comput. Oper. Res. 150, Article ID 106085, 19 p. (2023). MSC: 90C35 90B15 90C15 90C40 PDFBibTeX XMLCite \textit{P. Buchholz} and \textit{I. Dohndorf}, Comput. Oper. Res. 150, Article ID 106085, 19 p. (2023; Zbl 1520.90193) Full Text: DOI
Liu, Haodong; Zhang, Huili; Luo, Kelin; Xu, Yao; Xu, Yinfeng; Tong, Weitian Online generalized assignment problem with historical information. (English) Zbl 1520.68227 Comput. Oper. Res. 149, Article ID 106047, 19 p. (2023). MSC: 68W27 90C27 PDFBibTeX XMLCite \textit{H. Liu} et al., Comput. Oper. Res. 149, Article ID 106047, 19 p. (2023; Zbl 1520.68227) Full Text: DOI
Mousavi, Seyed R. Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants. (English) Zbl 1520.90159 Comput. Oper. Res. 149, Article ID 106023, 22 p. (2023). MSC: 90B80 90C59 PDFBibTeX XMLCite \textit{S. R. Mousavi}, Comput. Oper. Res. 149, Article ID 106023, 22 p. (2023; Zbl 1520.90159) Full Text: DOI
Maecker, Söhnke; Shen, Liji; Mönch, Lars Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness. (English) Zbl 1520.90116 Comput. Oper. Res. 149, Article ID 105999, 14 p. (2023). MSC: 90B35 68M20 90C11 90C59 PDFBibTeX XMLCite \textit{S. Maecker} et al., Comput. Oper. Res. 149, Article ID 105999, 14 p. (2023; Zbl 1520.90116) Full Text: DOI
Zhang, Chuang; Li, Yantong; Cao, Junhai; Yang, Zhen; Coelho, Leandro C. Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date. (English) Zbl 1520.90136 Comput. Oper. Res. 147, Article ID 105936, 19 p. (2022). MSC: 90B35 90B80 90C11 90C59 PDFBibTeX XMLCite \textit{C. Zhang} et al., Comput. Oper. Res. 147, Article ID 105936, 19 p. (2022; Zbl 1520.90136) Full Text: DOI
Latifi, Seyyed Ebrahim; Tavakkoli-Moghaddam, Reza; Fazeli, Esmaeel; Arefkhani, Hessam Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution. (English) Zbl 1520.90158 Comput. Oper. Res. 146, Article ID 105900, 16 p. (2022). MSC: 90B80 90C11 90C30 91A65 PDFBibTeX XMLCite \textit{S. E. Latifi} et al., Comput. Oper. Res. 146, Article ID 105900, 16 p. (2022; Zbl 1520.90158) Full Text: DOI
Almeida, Tiago; Manquinho, Vasco Constraint-based electoral districting using a new compactness measure: an application to Portugal. (English) Zbl 1520.91303 Comput. Oper. Res. 146, Article ID 105892, 15 p. (2022). MSC: 91F10 91B12 90C27 90C29 PDFBibTeX XMLCite \textit{T. Almeida} and \textit{V. Manquinho}, Comput. Oper. Res. 146, Article ID 105892, 15 p. (2022; Zbl 1520.91303) Full Text: DOI
Prata, Bruno de Athayde; Fernandez-Viagas, Victor; Framinan, Jose M.; Rodrigues, Carlos Diego Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. (English) Zbl 1520.90123 Comput. Oper. Res. 145, Article ID 105880, 10 p. (2022). MSC: 90B35 90C11 90C59 PDFBibTeX XMLCite \textit{B. de A. Prata} et al., Comput. Oper. Res. 145, Article ID 105880, 10 p. (2022; Zbl 1520.90123) Full Text: DOI
Kardam, Yogita Singh; Srivastava, Kamal; Jain, Pallavi; Martí, Rafael Scatter search for the minimum leaf spanning tree problem. (English) Zbl 1520.90197 Comput. Oper. Res. 145, Article ID 105858, 13 p. (2022). MSC: 90C35 05C05 05C85 68R10 90C59 PDFBibTeX XMLCite \textit{Y. S. Kardam} et al., Comput. Oper. Res. 145, Article ID 105858, 13 p. (2022; Zbl 1520.90197) Full Text: DOI
Atsmony, Matan; Mosheiov, Gur A greedy heuristic for solving scheduling problems with bounded rejection cost. (English) Zbl 1520.90091 Comput. Oper. Res. 144, Article ID 105827, 12 p. (2022). MSC: 90B35 90C39 90C59 PDFBibTeX XMLCite \textit{M. Atsmony} and \textit{G. Mosheiov}, Comput. Oper. Res. 144, Article ID 105827, 12 p. (2022; Zbl 1520.90091) Full Text: DOI
Segal, Michael; Tzfaty, Oren Finding bounded diameter minimum spanning tree in general graphs. (English) Zbl 1520.90203 Comput. Oper. Res. 144, Article ID 105822, 9 p. (2022). MSC: 90C35 05C05 68R10 PDFBibTeX XMLCite \textit{M. Segal} and \textit{O. Tzfaty}, Comput. Oper. Res. 144, Article ID 105822, 9 p. (2022; Zbl 1520.90203) Full Text: DOI
Strusevich, Vitaly A. Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches. (English) Zbl 1520.90126 Comput. Oper. Res. 144, Article ID 105732, 33 p. (2022). MSC: 90B35 90-02 PDFBibTeX XMLCite \textit{V. A. Strusevich}, Comput. Oper. Res. 144, Article ID 105732, 33 p. (2022; Zbl 1520.90126) Full Text: DOI
Sun, Yuan; Wang, Sheng; Shen, Yunzhuang; Li, Xiaodong; Ernst, Andreas T.; Kirley, Michael Boosting ant colony optimization via solution prediction and machine learning. (English) Zbl 1511.90365 Comput. Oper. Res. 143, Article ID 105769, 16 p. (2022). MSC: 90C27 90C59 68T05 PDFBibTeX XMLCite \textit{Y. Sun} et al., Comput. Oper. Res. 143, Article ID 105769, 16 p. (2022; Zbl 1511.90365) Full Text: DOI arXiv
Saffari, Saeed; Fathi, Yahya Set covering problem with conflict constraints. (English) Zbl 1511.90303 Comput. Oper. Res. 143, Article ID 105763, 11 p. (2022). MSC: 90C10 90C57 PDFBibTeX XMLCite \textit{S. Saffari} and \textit{Y. Fathi}, Comput. Oper. Res. 143, Article ID 105763, 11 p. (2022; Zbl 1511.90303) Full Text: DOI Link
Cacchiani, Valentina; Iori, Manuel; Locatelli, Alberto; Martello, Silvano Knapsack problems – an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems. (English) Zbl 1512.90190 Comput. Oper. Res. 143, Article ID 105693, 14 p. (2022). MSC: 90C27 90-02 PDFBibTeX XMLCite \textit{V. Cacchiani} et al., Comput. Oper. Res. 143, Article ID 105693, 14 p. (2022; Zbl 1512.90190) Full Text: DOI
Cacchiani, Valentina; Iori, Manuel; Locatelli, Alberto; Martello, Silvano Knapsack problems – an overview of recent advances. I: Single knapsack problems. (English) Zbl 1512.90189 Comput. Oper. Res. 143, Article ID 105692, 13 p. (2022). MSC: 90C27 90-02 PDFBibTeX XMLCite \textit{V. Cacchiani} et al., Comput. Oper. Res. 143, Article ID 105692, 13 p. (2022; Zbl 1512.90189) Full Text: DOI
Xiong, Hegen; Shi, Shuangyuan; Ren, Danni; Hu, Jinjin A survey of job shop scheduling problem: the types and models. (English) Zbl 1511.90227 Comput. Oper. Res. 142, Article ID 105731, 23 p. (2022). MSC: 90B35 90-02 PDFBibTeX XMLCite \textit{H. Xiong} et al., Comput. Oper. Res. 142, Article ID 105731, 23 p. (2022; Zbl 1511.90227) Full Text: DOI
Dwibedy, Debasis; Mohanty, Rakesh Semi-online scheduling: a survey. (English) Zbl 1512.90091 Comput. Oper. Res. 139, Article ID 105646, 23 p. (2022). MSC: 90B35 90-02 PDFBibTeX XMLCite \textit{D. Dwibedy} and \textit{R. Mohanty}, Comput. Oper. Res. 139, Article ID 105646, 23 p. (2022; Zbl 1512.90091) Full Text: DOI arXiv
Firouzeh, Fereshteh Fakhar; Chinneck, John W.; Rajan, Sreeraman Faster maximum feasible subsystem solutions for dense constraint matrices. (English) Zbl 1511.90299 Comput. Oper. Res. 139, Article ID 105633, 11 p. (2022). MSC: 90C05 90C59 PDFBibTeX XMLCite \textit{F. F. Firouzeh} et al., Comput. Oper. Res. 139, Article ID 105633, 11 p. (2022; Zbl 1511.90299) Full Text: DOI arXiv
Marzo, Ruslán G.; Melo, Rafael A.; Ribeiro, Celso C.; Santos, Marcio C. New formulations and branch-and-cut procedures for the longest induced path problem. (English) Zbl 1511.90408 Comput. Oper. Res. 139, Article ID 105627, 11 p. (2022). MSC: 90C35 05C85 90C10 90C27 90C57 PDFBibTeX XMLCite \textit{R. G. Marzo} et al., Comput. Oper. Res. 139, Article ID 105627, 11 p. (2022; Zbl 1511.90408) Full Text: DOI arXiv
Ferone, Daniele; Festa, Paola; Guerriero, Francesca The rainbow Steiner tree problem. (English) Zbl 1511.90401 Comput. Oper. Res. 139, Article ID 105621, 11 p. (2022). MSC: 90C35 05C85 90C27 90C59 PDFBibTeX XMLCite \textit{D. Ferone} et al., Comput. Oper. Res. 139, Article ID 105621, 11 p. (2022; Zbl 1511.90401) Full Text: DOI
Domínguez, Concepción; Labbé, Martine; Marín, Alfredo Mixed-integer formulations for the capacitated rank pricing problem with envy. (English) Zbl 1511.91063 Comput. Oper. Res. 140, Article ID 105664, 12 p. (2022). MSC: 91B24 90C10 90C27 PDFBibTeX XMLCite \textit{C. Domínguez} et al., Comput. Oper. Res. 140, Article ID 105664, 12 p. (2022; Zbl 1511.91063) Full Text: DOI HAL
Zhang, Chuang; Li, Yantong; Cao, Junhai; Wen, Xin On the mass COVID-19 vaccination scheduling problem. (English) Zbl 1511.90231 Comput. Oper. Res. 141, Article ID 105704, 16 p. (2022). MSC: 90B35 90C11 90C59 PDFBibTeX XMLCite \textit{C. Zhang} et al., Comput. Oper. Res. 141, Article ID 105704, 16 p. (2022; Zbl 1511.90231) Full Text: DOI
Beasley, J. E. A discrete optimisation approach for target path planning whilst evading sensors. (English) Zbl 1511.90400 Comput. Oper. Res. 138, Article ID 105587, 21 p. (2022). MSC: 90C35 90B10 90C10 PDFBibTeX XMLCite \textit{J. E. Beasley}, Comput. Oper. Res. 138, Article ID 105587, 21 p. (2022; Zbl 1511.90400) Full Text: DOI arXiv
Nourbakhsh, Vahid; Turner, John Dynamized routing policies for minimizing expected waiting time in a multi-class multi-server system. (English) Zbl 1511.90125 Comput. Oper. Res. 137, Article ID 105545, 12 p. (2022). MSC: 90B22 60K25 90C25 PDFBibTeX XMLCite \textit{V. Nourbakhsh} and \textit{J. Turner}, Comput. Oper. Res. 137, Article ID 105545, 12 p. (2022; Zbl 1511.90125) Full Text: DOI
Akbari, Vahid; Shiri, Davood An online optimization approach for post-disaster relief distribution with online blocked edges. (English) Zbl 1511.90022 Comput. Oper. Res. 137, Article ID 105533, 18 p. (2022). MSC: 90B06 90C27 90C35 90C59 PDFBibTeX XMLCite \textit{V. Akbari} and \textit{D. Shiri}, Comput. Oper. Res. 137, Article ID 105533, 18 p. (2022; Zbl 1511.90022) Full Text: DOI
Ozturk, Onur When serial batch scheduling involves parallel batching decisions: a branch and price scheme. (English) Zbl 1511.90205 Comput. Oper. Res. 137, Article ID 105514, 19 p. (2022). MSC: 90B35 90C57 PDFBibTeX XMLCite \textit{O. Ozturk}, Comput. Oper. Res. 137, Article ID 105514, 19 p. (2022; Zbl 1511.90205) Full Text: DOI
Paquete, Luís; Schulze, Britta; Stiglmayr, Michael; Lourenço, Ana C. Computing representations using hypervolume scalarizations. (English) Zbl 1511.90381 Comput. Oper. Res. 137, Article ID 105349, 11 p. (2022). MSC: 90C29 90C27 PDFBibTeX XMLCite \textit{L. Paquete} et al., Comput. Oper. Res. 137, Article ID 105349, 11 p. (2022; Zbl 1511.90381) Full Text: DOI
Bianchessi, Nicola; Tresoldi, Emanuele A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts. (English) Zbl 1511.90162 Comput. Oper. Res. 136, Article ID 105464, 13 p. (2021). MSC: 90B35 68M20 90C10 90C57 PDFBibTeX XMLCite \textit{N. Bianchessi} and \textit{E. Tresoldi}, Comput. Oper. Res. 136, Article ID 105464, 13 p. (2021; Zbl 1511.90162) Full Text: DOI
Schoot Uiterkamp, Martijn H. H.; Hurink, Johann L.; Gerards, Marco E. T. A fast algorithm for quadratic resource allocation problems with nested constraints. (English) Zbl 1511.90325 Comput. Oper. Res. 135, Article ID 105451, 19 p. (2021). MSC: 90C25 68Q25 PDFBibTeX XMLCite \textit{M. H. H. Schoot Uiterkamp} et al., Comput. Oper. Res. 135, Article ID 105451, 19 p. (2021; Zbl 1511.90325) Full Text: DOI arXiv
Ravelo, Santiago V.; Meneses, Cláudio N. Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems. (English) Zbl 1511.90411 Comput. Oper. Res. 135, Article ID 105441, 21 p. (2021). MSC: 90C35 90C10 90C39 90C59 91D30 PDFBibTeX XMLCite \textit{S. V. Ravelo} and \textit{C. N. Meneses}, Comput. Oper. Res. 135, Article ID 105441, 21 p. (2021; Zbl 1511.90411) Full Text: DOI
Martinovic, J.; Selch, M. Mathematical models and approximate solution approaches for the stochastic bin packing problem. (English) Zbl 1511.90355 Comput. Oper. Res. 135, Article ID 105439, 19 p. (2021). MSC: 90C27 90C15 90C59 PDFBibTeX XMLCite \textit{J. Martinovic} and \textit{M. Selch}, Comput. Oper. Res. 135, Article ID 105439, 19 p. (2021; Zbl 1511.90355) Full Text: DOI
Goerigk, Marc; Hartisch, Michael Multistage robust discrete optimization via quantified integer programming. (English) Zbl 1511.90315 Comput. Oper. Res. 135, Article ID 105434, 13 p. (2021). MSC: 90C17 90C05 90C10 PDFBibTeX XMLCite \textit{M. Goerigk} and \textit{M. Hartisch}, Comput. Oper. Res. 135, Article ID 105434, 13 p. (2021; Zbl 1511.90315) Full Text: DOI arXiv
Mostafayi Darmian, Sobhan; Fattahi, Mohammad; Keyvanshokooh, Esmaeil An optimization-based approach for the healthcare districting under uncertainty. (English) Zbl 1511.90430 Comput. Oper. Res. 135, Article ID 105425, 23 p. (2021). MSC: 90C59 90B06 90B80 90C11 PDFBibTeX XMLCite \textit{S. Mostafayi Darmian} et al., Comput. Oper. Res. 135, Article ID 105425, 23 p. (2021; Zbl 1511.90430) Full Text: DOI
Rendl, Franz; Sotirov, Renata; Truden, Christian Lower bounds for the bandwidth problem. (English) Zbl 1511.90321 Comput. Oper. Res. 135, Article ID 105422, 9 p. (2021). MSC: 90C22 05C50 05C78 90C35 68Q25 PDFBibTeX XMLCite \textit{F. Rendl} et al., Comput. Oper. Res. 135, Article ID 105422, 9 p. (2021; Zbl 1511.90321) Full Text: DOI arXiv
Wu, Xinyun; Xiong, Caiquan; Deng, Na; Xia, Dahai A variable depth neighborhood search algorithm for the min-max arc crossing problem. (English) Zbl 1511.90414 Comput. Oper. Res. 134, Article ID 105403, 17 p. (2021). MSC: 90C35 05C85 68R10 90C59 PDFBibTeX XMLCite \textit{X. Wu} et al., Comput. Oper. Res. 134, Article ID 105403, 17 p. (2021; Zbl 1511.90414) Full Text: DOI
Mazyavkina, Nina; Sviridov, Sergey; Ivanov, Sergei; Burnaev, Evgeny Reinforcement learning for combinatorial optimization: a survey. (English) Zbl 1511.90356 Comput. Oper. Res. 134, Article ID 105400, 15 p. (2021). MSC: 90C27 90C59 68T05 90-02 PDFBibTeX XMLCite \textit{N. Mazyavkina} et al., Comput. Oper. Res. 134, Article ID 105400, 15 p. (2021; Zbl 1511.90356) Full Text: DOI arXiv
Corcoran, Padraig; Gagarin, Andrei Heuristics for \(k\)-domination models of facility location problems in street networks. (English) Zbl 1511.90275 Comput. Oper. Res. 133, Article ID 105368, 11 p. (2021). MSC: 90B80 90C59 PDFBibTeX XMLCite \textit{P. Corcoran} and \textit{A. Gagarin}, Comput. Oper. Res. 133, Article ID 105368, 11 p. (2021; Zbl 1511.90275) Full Text: DOI arXiv
Tunc, Huseyin A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times. (English) Zbl 1510.90020 Comput. Oper. Res. 132, Article ID 105302, 8 p. (2021). MSC: 90B05 90B30 90C11 90C15 PDFBibTeX XMLCite \textit{H. Tunc}, Comput. Oper. Res. 132, Article ID 105302, 8 p. (2021; Zbl 1510.90020) Full Text: DOI
Anacleto, Eduardo A. J.; Meneses, Cláudio N.; Liang, Ricardo N. Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints. (English) Zbl 1510.90180 Comput. Oper. Res. 132, Article ID 105297, 24 p. (2021). MSC: 90C09 90C20 PDFBibTeX XMLCite \textit{E. A. J. Anacleto} et al., Comput. Oper. Res. 132, Article ID 105297, 24 p. (2021; Zbl 1510.90180) Full Text: DOI
Martinovic, J.; Strasdat, N.; Selch, M. Compact integer linear programming formulations for the temporal bin packing problem with fire-ups. (English) Zbl 1510.90242 Comput. Oper. Res. 132, Article ID 105288, 26 p. (2021). MSC: 90C27 90C10 PDFBibTeX XMLCite \textit{J. Martinovic} et al., Comput. Oper. Res. 132, Article ID 105288, 26 p. (2021; Zbl 1510.90242) Full Text: DOI
Chen, Gary Yu-Hsin New variable-length data compression scheme for solution representation of meta-heuristics. (English) Zbl 1510.90294 Comput. Oper. Res. 131, Article ID 105256, 14 p. (2021). MSC: 90C59 90B80 90C27 PDFBibTeX XMLCite \textit{G. Y. H. Chen}, Comput. Oper. Res. 131, Article ID 105256, 14 p. (2021; Zbl 1510.90294) Full Text: DOI
Ketkov, Sergey S.; Prokopyev, Oleg A.; Burashnikov, Evgenii P. An approach to the distributionally robust shortest path problem. (English) Zbl 1510.90279 Comput. Oper. Res. 130, Article ID 105212, 15 p. (2021). MSC: 90C35 90C17 90C27 PDFBibTeX XMLCite \textit{S. S. Ketkov} et al., Comput. Oper. Res. 130, Article ID 105212, 15 p. (2021; Zbl 1510.90279) Full Text: DOI arXiv
Molaee, Ehsan; Sadeghian, Ramin; Fattahi, Parviz Minimizing maximum tardiness on a single machine with family setup times and machine disruption. (English) Zbl 1510.90115 Comput. Oper. Res. 129, Article ID 105231, 23 p. (2021). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{E. Molaee} et al., Comput. Oper. Res. 129, Article ID 105231, 23 p. (2021; Zbl 1510.90115) Full Text: DOI
Brito, Samuel Souza; Santos, Haroldo Gambini Preprocessing and cutting planes with conflict graphs. (English) Zbl 1510.90189 Comput. Oper. Res. 128, Article ID 105176, 22 p. (2021). MSC: 90C11 90C57 PDFBibTeX XMLCite \textit{S. S. Brito} and \textit{H. G. Santos}, Comput. Oper. Res. 128, Article ID 105176, 22 p. (2021; Zbl 1510.90189) Full Text: DOI arXiv
Assunção, Lucas; Mateus, Geraldo Robson Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem. (English) Zbl 1510.90275 Comput. Oper. Res. 128, Article ID 105175, 21 p. (2021). MSC: 90C35 90B06 90C27 90C59 PDFBibTeX XMLCite \textit{L. Assunção} and \textit{G. R. Mateus}, Comput. Oper. Res. 128, Article ID 105175, 21 p. (2021; Zbl 1510.90275) Full Text: DOI arXiv
Shang, Lei; T’Kindt, Vincent; Della Croce, Federico Branch & memorize exact algorithms for sequencing problems: efficient embedding of memorization into search trees. (English) Zbl 1510.90121 Comput. Oper. Res. 128, Article ID 105171, 13 p. (2021). MSC: 90B35 PDFBibTeX XMLCite \textit{L. Shang} et al., Comput. Oper. Res. 128, Article ID 105171, 13 p. (2021; Zbl 1510.90121) Full Text: DOI
Pettersson, William; Delorme, Maxence; García, Sergio; Gondzio, Jacek; Kalcsics, Joerg; Manlove, David Improving solution times for stable matching problems through preprocessing. (English) Zbl 1510.91109 Comput. Oper. Res. 128, Article ID 105128, 25 p. (2021). MSC: 91B68 PDFBibTeX XMLCite \textit{W. Pettersson} et al., Comput. Oper. Res. 128, Article ID 105128, 25 p. (2021; Zbl 1510.91109) Full Text: DOI
Bucarey, Víctor; Elloumi, Sourour; Labbé, Martine; Plein, Fränk Models and algorithms for the product pricing with single-minded customers requesting bundles. (English) Zbl 1510.91077 Comput. Oper. Res. 127, Article ID 105139, 12 p. (2021). MSC: 91B24 90C11 PDFBibTeX XMLCite \textit{V. Bucarey} et al., Comput. Oper. Res. 127, Article ID 105139, 12 p. (2021; Zbl 1510.91077) Full Text: DOI HAL
Mönch, Lars; Shen, Liji Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing. (English) Zbl 1510.90116 Comput. Oper. Res. 127, Article ID 105126, 17 p. (2021). MSC: 90B35 PDFBibTeX XMLCite \textit{L. Mönch} and \textit{L. Shen}, Comput. Oper. Res. 127, Article ID 105126, 17 p. (2021; Zbl 1510.90116) Full Text: DOI
Lewis, R.; Thiruvady, D.; Morgan, K. The maximum happy induced subgraph problem: bounds and algorithms. (English) Zbl 1510.68081 Comput. Oper. Res. 126, Article ID 105114, 15 p. (2021). MSC: 68R10 05C15 05C85 90C27 PDFBibTeX XMLCite \textit{R. Lewis} et al., Comput. Oper. Res. 126, Article ID 105114, 15 p. (2021; Zbl 1510.68081) Full Text: DOI
Ekici, Ali Bin packing problem with conflicts and item fragmentation. (English) Zbl 1510.90227 Comput. Oper. Res. 126, Article ID 105113, 16 p. (2021). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{A. Ekici}, Comput. Oper. Res. 126, Article ID 105113, 16 p. (2021; Zbl 1510.90227) Full Text: DOI
Touati, Sofiane; Radjef, Mohammed Said; Sais, Lakhdar A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games. (English) Zbl 1458.91026 Comput. Oper. Res. 125, Article ID 105094, 12 p. (2021). MSC: 91A12 90C27 91-08 65C05 PDFBibTeX XMLCite \textit{S. Touati} et al., Comput. Oper. Res. 125, Article ID 105094, 12 p. (2021; Zbl 1458.91026) Full Text: DOI
Valle, Cristiano Arbex; Beasley, John E. Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment. (English) Zbl 1458.90041 Comput. Oper. Res. 125, Article ID 105090, 32 p. (2021). MSC: 90B05 90B06 90B35 90C10 PDFBibTeX XMLCite \textit{C. A. Valle} and \textit{J. E. Beasley}, Comput. Oper. Res. 125, Article ID 105090, 32 p. (2021; Zbl 1458.90041) Full Text: DOI arXiv
Ouyang, Ruilin; Chou, Chun-An Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data. (English) Zbl 1458.90487 Comput. Oper. Res. 124, Article ID 105049, 14 p. (2020). MSC: 90C11 68T05 90C27 PDFBibTeX XMLCite \textit{R. Ouyang} and \textit{C.-A. Chou}, Comput. Oper. Res. 124, Article ID 105049, 14 p. (2020; Zbl 1458.90487) Full Text: DOI
Kramer, Arthur; Dell’Amico, Mauro; Feillet, Dominique; Iori, Manuel Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time. (English) Zbl 1458.90314 Comput. Oper. Res. 123, Article ID 105018, 16 p. (2020). MSC: 90B35 90C11 90C57 PDFBibTeX XMLCite \textit{A. Kramer} et al., Comput. Oper. Res. 123, Article ID 105018, 16 p. (2020; Zbl 1458.90314) Full Text: DOI arXiv
Hamzadayı, Alper An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem. (English) Zbl 1458.90302 Comput. Oper. Res. 123, Article ID 105006, 15 p. (2020). MSC: 90B35 90C11 90C59 PDFBibTeX XMLCite \textit{A. Hamzadayı}, Comput. Oper. Res. 123, Article ID 105006, 15 p. (2020; Zbl 1458.90302) Full Text: DOI
Soares, Leonardo C. R.; Reinsma, Jordi Alves; Nascimento, Luis H. L.; Carvalho, Marco A. M. Heuristic methods to consecutive block minimization. (English) Zbl 1458.90560 Comput. Oper. Res. 120, Article ID 104948, 10 p. (2020). MSC: 90C27 05C50 68Q25 PDFBibTeX XMLCite \textit{L. C. R. Soares} et al., Comput. Oper. Res. 120, Article ID 104948, 10 p. (2020; Zbl 1458.90560) Full Text: DOI
Mostafaie, Taha; Modarres Khiyabani, Farzin; Navimipour, Nima Jafari A systematic study on meta-heuristic approaches for solving the graph coloring problem. (English) Zbl 1458.90617 Comput. Oper. Res. 120, Article ID 104850, 29 p. (2020). MSC: 90C35 05C15 05C85 90C59 PDFBibTeX XMLCite \textit{T. Mostafaie} et al., Comput. Oper. Res. 120, Article ID 104850, 29 p. (2020; Zbl 1458.90617) Full Text: DOI
Rojas-Gonzalez, Sebastian; van Nieuwenhuyse, Inneke A survey on kriging-based infill algorithms for multiobjective simulation optimization. (English) Zbl 1458.90582 Comput. Oper. Res. 116, Article ID 104869, 13 p. (2020). MSC: 90C29 PDFBibTeX XMLCite \textit{S. Rojas-Gonzalez} and \textit{I. van Nieuwenhuyse}, Comput. Oper. Res. 116, Article ID 104869, 13 p. (2020; Zbl 1458.90582) Full Text: DOI Link
Nagata, Yuichi; Imamiya, Akinori; Ono, Norihiko A genetic algorithm for the picture maze generation problem. (English) Zbl 1458.68144 Comput. Oper. Res. 115, Article ID 104860, 13 p. (2020). MSC: 68R10 05C38 05C85 68W50 90C59 PDFBibTeX XMLCite \textit{Y. Nagata} et al., Comput. Oper. Res. 115, Article ID 104860, 13 p. (2020; Zbl 1458.68144) Full Text: DOI
Dell’Amico, Mauro; Furini, Fabio; Iori, Manuel A branch-and-price algorithm for the temporal bin packing problem. (English) Zbl 1458.90543 Comput. Oper. Res. 114, Article ID 104825, 16 p. (2020). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{M. Dell'Amico} et al., Comput. Oper. Res. 114, Article ID 104825, 16 p. (2020; Zbl 1458.90543) Full Text: DOI arXiv
Liu, Zhaohui; Zhan, Jiyuan Online fractional hierarchical scheduling on uniformly related machines. (English) Zbl 1458.90324 Comput. Oper. Res. 113, Article ID 104778, 8 p. (2020). MSC: 90B35 PDFBibTeX XMLCite \textit{Z. Liu} and \textit{J. Zhan}, Comput. Oper. Res. 113, Article ID 104778, 8 p. (2020; Zbl 1458.90324) Full Text: DOI
Perea, Federico; Puerto, Justo A heuristic procedure for computing the nucleolus. (English) Zbl 1458.91024 Comput. Oper. Res. 112, Article ID 104764, 9 p. (2019). MSC: 91A12 90C05 90C59 PDFBibTeX XMLCite \textit{F. Perea} and \textit{J. Puerto}, Comput. Oper. Res. 112, Article ID 104764, 9 p. (2019; Zbl 1458.91024) Full Text: DOI
Khatami, Mostafa; Salehipour, Amir; Hwang, F. J. Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem. (English) Zbl 1458.90310 Comput. Oper. Res. 111, 400-414 (2019). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{M. Khatami} et al., Comput. Oper. Res. 111, 400--414 (2019; Zbl 1458.90310) Full Text: DOI
Mallek, Amin; Bendraouche, Mohamed; Boudhar, Mourad Scheduling identical jobs on uniform machines with a conflict graph. (English) Zbl 1458.90330 Comput. Oper. Res. 111, 357-366 (2019). MSC: 90B35 90C11 PDFBibTeX XMLCite \textit{A. Mallek} et al., Comput. Oper. Res. 111, 357--366 (2019; Zbl 1458.90330) Full Text: DOI
Liu, Peihai; Gu, Manzhan; Li, Ganggang Two-agent scheduling on a single machine with release dates. (English) Zbl 1458.90323 Comput. Oper. Res. 111, 35-42 (2019). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Liu} et al., Comput. Oper. Res. 111, 35--42 (2019; Zbl 1458.90323) Full Text: DOI
Catanzaro, Daniele; Pesenti, Raffaele Enumerating vertices of the balanced minimum evolution polytope. (English) Zbl 1458.90639 Comput. Oper. Res. 109, 209-217 (2019). MSC: 90C57 90C27 92D15 94B05 PDFBibTeX XMLCite \textit{D. Catanzaro} and \textit{R. Pesenti}, Comput. Oper. Res. 109, 209--217 (2019; Zbl 1458.90639) Full Text: DOI
Sinnl, Markus Algorithmic expedients for the \(S\)-labeling problem. (English) Zbl 1458.90626 Comput. Oper. Res. 108, 201-212 (2019). MSC: 90C35 05C78 90C11 90C57 90C59 PDFBibTeX XMLCite \textit{M. Sinnl}, Comput. Oper. Res. 108, 201--212 (2019; Zbl 1458.90626) Full Text: DOI arXiv
Purevsuren, Dalaijargal; Cui, Gang Efficient heuristic algorithm for identifying critical nodes in planar networks. (English) Zbl 1458.90622 Comput. Oper. Res. 106, 143-153 (2019). MSC: 90C35 90C27 90C59 PDFBibTeX XMLCite \textit{D. Purevsuren} and \textit{G. Cui}, Comput. Oper. Res. 106, 143--153 (2019; Zbl 1458.90622) Full Text: DOI
Davoodi, Mansoor \(k\)-balanced center location problem: a new multi-objective facility location problem. (English) Zbl 1458.90426 Comput. Oper. Res. 105, 68-84 (2019). MSC: 90B80 90C29 90C59 68Q25 PDFBibTeX XMLCite \textit{M. Davoodi}, Comput. Oper. Res. 105, 68--84 (2019; Zbl 1458.90426) Full Text: DOI
Beresnev, Vladimir; Melnikov, Andrey Approximation of the competitive facility location problem with MIPs. (English) Zbl 1458.90413 Comput. Oper. Res. 104, 139-148 (2019). MSC: 90B80 91A65 90C57 PDFBibTeX XMLCite \textit{V. Beresnev} and \textit{A. Melnikov}, Comput. Oper. Res. 104, 139--148 (2019; Zbl 1458.90413) Full Text: DOI
Liu, Ming; Chu, Feng; He, Junkai; Yang, Dapeng; Chu, Chengbin Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times. (English) Zbl 1458.90322 Comput. Oper. Res. 104, 37-48 (2019). MSC: 90B35 90C10 PDFBibTeX XMLCite \textit{M. Liu} et al., Comput. Oper. Res. 104, 37--48 (2019; Zbl 1458.90322) Full Text: DOI
Lewis, R.; Thiruvady, D.; Morgan, K. Finding happiness: an analysis of the maximum happy vertices problem. (English) Zbl 1458.05076 Comput. Oper. Res. 103, 265-276 (2019). MSC: 05C15 05C85 90C10 90C35 PDFBibTeX XMLCite \textit{R. Lewis} et al., Comput. Oper. Res. 103, 265--276 (2019; Zbl 1458.05076) Full Text: DOI Link
Bacci, Tiziano; Mattia, Sara; Ventura, Paolo The bounded beam search algorithm for the block relocation problem. (English) Zbl 1458.90410 Comput. Oper. Res. 103, 252-264 (2019). MSC: 90B80 90B06 90C59 PDFBibTeX XMLCite \textit{T. Bacci} et al., Comput. Oper. Res. 103, 252--264 (2019; Zbl 1458.90410) Full Text: DOI
Kovalyov, Mikhail Y.; Kress, Dominik; Meiswinkel, Sebastian; Pesch, Erwin A parallel machine schedule updating game with compensations and clients averse to uncertain loss. (English) Zbl 1458.90313 Comput. Oper. Res. 103, 148-157 (2019). MSC: 90B35 90B06 91A10 PDFBibTeX XMLCite \textit{M. Y. Kovalyov} et al., Comput. Oper. Res. 103, 148--157 (2019; Zbl 1458.90313) Full Text: DOI
Ding, Junwen; Shen, Liji; Lü, Zhipeng; Peng, Bo Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration. (English) Zbl 1458.90285 Comput. Oper. Res. 103, 35-45 (2019). MSC: 90B35 PDFBibTeX XMLCite \textit{J. Ding} et al., Comput. Oper. Res. 103, 35--45 (2019; Zbl 1458.90285) Full Text: DOI
Cordone, Roberto; Hosteins, Pierre A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. (English) Zbl 1458.90281 Comput. Oper. Res. 102, 130-140 (2019). MSC: 90B35 90C29 90C57 PDFBibTeX XMLCite \textit{R. Cordone} and \textit{P. Hosteins}, Comput. Oper. Res. 102, 130--140 (2019; Zbl 1458.90281) Full Text: DOI HAL
Ecker, Grit; Yuan, Di; Koster, Arie M. C. A.; Schmeink, Anke Accurate optimization models for interference constrained bandwidth allocation in cellular networks. (English) Zbl 1458.90191 Comput. Oper. Res. 101, 1-12 (2019). MSC: 90B18 90C11 PDFBibTeX XMLCite \textit{G. Ecker} et al., Comput. Oper. Res. 101, 1--12 (2019; Zbl 1458.90191) Full Text: DOI Link
Mnich, Matthias; van Bevern, René Parameterized complexity of machine scheduling: 15 open problems. (English) Zbl 1458.90333 Comput. Oper. Res. 100, 254-261 (2018). MSC: 90B35 68Q25 68M20 68Q17 90C60 PDFBibTeX XMLCite \textit{M. Mnich} and \textit{R. van Bevern}, Comput. Oper. Res. 100, 254--261 (2018; Zbl 1458.90333) Full Text: DOI arXiv
Cabo, Marta; González-Velarde, José Luis; Possani, Edgar; Ríos Solís, Yasmín Á. Bi-objective scheduling on a restricted batching machine. (English) Zbl 1458.90269 Comput. Oper. Res. 100, 201-210 (2018). MSC: 90B35 90C10 90C29 PDFBibTeX XMLCite \textit{M. Cabo} et al., Comput. Oper. Res. 100, 201--210 (2018; Zbl 1458.90269) Full Text: DOI
Branda, Martin Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times. (English) Zbl 1391.90438 Comput. Oper. Res. 98, 231-239 (2018). MSC: 90C15 90B36 90C10 90C60 PDFBibTeX XMLCite \textit{M. Branda}, Comput. Oper. Res. 98, 231--239 (2018; Zbl 1391.90438) Full Text: DOI
Santos, J. L.; Di Puglia Pugliese, Luigi; Guerriero, Francesca A new approach for the multiobjective minimum spanning tree. (English) Zbl 1391.90618 Comput. Oper. Res. 98, 69-83 (2018). MSC: 90C35 90C29 68R10 90C60 90C27 PDFBibTeX XMLCite \textit{J. L. Santos} et al., Comput. Oper. Res. 98, 69--83 (2018; Zbl 1391.90618) Full Text: DOI
Furini, Fabio; Malaguti, Enrico; Santini, Alberto An exact algorithm for the partition coloring problem. (English) Zbl 1391.90603 Comput. Oper. Res. 92, 170-181 (2018). MSC: 90C35 90C27 05C85 05C15 90C10 90C59 PDFBibTeX XMLCite \textit{F. Furini} et al., Comput. Oper. Res. 92, 170--181 (2018; Zbl 1391.90603) Full Text: DOI Link