Narrow search
Showing 41 - 50 of 46,400
Cover Image
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
Ruiz, Efrain; Albareda-Sambola, Maria; Fernández, Elena; … - In: Computers & operations research : and their … 57 (2015), pp. 95-108
Persistent link: https://www.econbiz.de/10010495397
Cover Image
Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
Kulich, Miroslav; Přeučil, Libor - In: International transactions in operational research : a … 29 (2022) 2, pp. 805-836
Persistent link: https://www.econbiz.de/10012795802
Cover Image
A heuristic for the convex recoloring problem in graphs
Dantas, Ana Paula S.; Souza, Cid C. de; Dias, Zanoni - In: International transactions in operational research : a … 29 (2022) 3, pp. 1454-1478
Persistent link: https://www.econbiz.de/10012795863
Cover Image
Comparison of metaheuristics for the k-labeled spanning forest problem
Consoli, Sergio; Moreno Pérez, José Andrés; … - In: International transactions in operational research : … 24 (2017) 3, pp. 559-582
Persistent link: https://www.econbiz.de/10011724430
Cover Image
Tabu search for min-max edge crossing in graphs
Pastore, Tommaso; Martínez-Gavara, Anna; Napoletano, … - In: Computers & operations research : and their … 114 (2020), pp. 1-15
Persistent link: https://www.econbiz.de/10012146640
Cover Image
A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
Singh, Kavita; Sundar, Shyam - In: European journal of operational research : EJOR 276 (2019) 1, pp. 88-105
Persistent link: https://www.econbiz.de/10011997860
Cover Image
A massively parallel evolutionary algorithm for the partial Latin square extension problem
Goudet, Olivier; Hao, Jin-Kao - In: Computers & operations research : and their … 158 (2023), pp. 1-16
Persistent link: https://www.econbiz.de/10014446174
Cover Image
Some new clique inequalities in four-index hub location models
Landete, Mercedes; Peiró, Juanjo - In: European journal of operational research : EJOR 318 (2024) 3, pp. 768-777
Persistent link: https://www.econbiz.de/10015048157
Cover Image
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano; Furini, Fabio; San Segundo, Pablo - In: European journal of operational research : EJOR 289 (2021) 2, pp. 435-455
Persistent link: https://www.econbiz.de/10012416751
Cover Image
Branch-Relax-and-Check : a tractable decomposition method for order acceptance and identical parallel machine scheduling
Naderi, Bahman; Roshanaei, Vahid - In: European journal of operational research : EJOR 286 (2020) 3, pp. 811-827
Persistent link: https://www.econbiz.de/10012291573