Similar Search Results

Integrating combinatorial algorithms into a linear programming solver

Molnár-Szipai, Richárd; Varga, Anita - In: Central European journal of operations research : CEJOR … 27 (2019) 2, pp. 475-482

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

A new exact discrete linear reformulation of the quadratic assignment problem

Nyberg, Axel; Westerlund, Tapio - In: European Journal of Operational Research 220 (2012) 2, pp. 314-319

The quadratic assignment problem (QAP) is a challenging combinatorial problem. The problem is NP-hard and in addition, it is considered practically intractable to solve large QAP instances, to proven optimality, within reasonable time limits. In this paper we present an attractive mixed integer...

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

An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset

Morrison, David Robert; Sewell, Edward C.; Jacobson, … - In: European journal of operational research : EJOR 236 (2014) 2, pp. 403-409

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

An effective branch-and-bound algorithm for the maximum s-bundle problem

Zhou, Yi; Lin, Weibo; Hao, Jin-Kao; Xiao, Mingyu; Jin, Yan - In: European journal of operational research : EJOR 297 (2022) 1, pp. 27-39

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

Machine learning for combinatorial optimization : a methodological tour d'horizon

Bengio, Yoshua; Lodi, Andrea; Prouvost, Antoine - In: European journal of operational research : EJOR 290 (2021) 2, pp. 405-421

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

Branch, bound and remember algorithm for two-sided assembly line balancing problem

Li, Zixiang; Kucukkoc, Ibrahim; Zhang, Zikai - In: European journal of operational research : EJOR 284 (2020) 3, pp. 896-905

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

An empirical analysis of exact algorithms for the unbounded knapsack problem

Becker, Henrique; Buriol, Luciana S. - In: European journal of operational research : EJOR 277 (2019) 1, pp. 84-99

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

A new upper bound for the maximum weight clique problem

Li, Chu-Min; Liu, Yanli; Jiang, Hua; Manyà, Felip; Li, Yu - In: European journal of operational research : EJOR 270 (2018) 1, pp. 66-77

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

Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs

Forget, Nicolas; Gadegaard, Sune Lauth; Nielsen, Lars Relund - In: European journal of operational research : EJOR 302 (2022) 3, pp. 909-924

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

Computational results of a semidefinite branch-and-bound algorithm for k-cluster

Krislock, Nathan; Malick, Jérôme; Roupin, Frédéric - In: Computers & operations research : and their … 66 (2016), pp. 153-159

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