Search Results - subject:"Anytime algorithms"

Anytime algorithms for the longest common palindromic subsequence problem

Djukanovic, Marko; Raidl, Günther; Blum, Christian - In: Computers & operations research : and their … 114 (2020), pp. 1-20

Persistent link: https://www.econbiz.de/10012146641

Adaptive online scheduling of tasks with anytime property on heterogeneous resources

Módos, István; Sůcha, Přemysl; Václavík, Roman; … - In: Computers & operations research : and their … 76 (2016), pp. 95-117

Persistent link: https://www.econbiz.de/10011582654

Automatically improving the anytime behaviour of optimisation algorithms

López-Ibáñez, Manuel; Stützle, Thomas - In: European Journal of Operational Research 235 (2014) 3, pp. 569-582

Optimisation algorithms with good anytime behaviour try to return as high-quality solutions as possible independently of the computation time allowed. Designing algorithms with good anytime behaviour is a difficult task, because performance is often evaluated subjectively, by plotting the...

Persistent link: https://www.econbiz.de/10011052520

Automatically improving the anytime behaviour of optimisation algorithms

López-Ibáñez, Manuel; Stützle, Thomas G. - In: European journal of operational research : EJOR 235 (2014) 3, pp. 569-582

Persistent link: https://www.econbiz.de/10010341291

An efficient hybrid search algorithm for job shop scheduling with operators

Mencía, Carlos; Sierra, María R.; Varela, Ramiro - In: International journal of production research 51 (2013) 17, pp. 5221-5237

Persistent link: https://www.econbiz.de/10010194446