Narrow search
Showing 1 - 10 of 31,823
Cover Image
A dual ascent-based branch-and-bound framework for the prize-collecting steiner tree and related problems
Leitner, Markus; Ljubić, Ivana; Luipersbeck, Martin; … - In: INFORMS journal on computing : JOC 30 (2018) 2, pp. 402-420
Persistent link: https://www.econbiz.de/10011878363
Cover Image
A theoretical development for the total tardiness problem and its application in branch and bound algorithm
Zhou, Shuyu; Liu, Zhaohui - In: Computers & operations research : and their … 40 (2013) 1, pp. 248-252
Persistent link: https://www.econbiz.de/10009657960
Cover Image
Experiments with parallel algorithms for combinatorial problems
Kindervater, G. A.; Trienekens, H. W. J. M. - In: European journal of operational research : EJOR 33 (1988) 1, pp. 65-81
Persistent link: https://www.econbiz.de/10003601202
Cover Image
Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
Paulavičius, Remigijus; Žilinskas, Julius; Grothey, … - In: Optimization letters 4 (2010) 2, pp. 173-183
Persistent link: https://www.econbiz.de/10003958305
Cover Image
A branch and cut solver for the maximum stable set problem
Rebennack, Steffen; Oswald, Marcus; Theis, Dirk Oliver; … - In: Journal of combinatorial optimization 21 (2011) 4, pp. 434-457
Persistent link: https://www.econbiz.de/10009129585
Cover Image
A branch-and-bound approach for maximum quasi-cliques
Mahdavi Pajouh, Foad; Miao, Zhuqi; Balasundaram, Balabhaskar - In: Data mining and informatics, (pp. 145-161). 2014
Persistent link: https://www.econbiz.de/10010344210
Cover Image
Truncated branch-and-bound guided meta-heuristics for the unrelated parallel machine
Sels, Veronique; Coelho, José; Vanhoucke, Mario - 2011
Persistent link: https://www.econbiz.de/10009501222
Cover Image
An improved branch-and-bound clustering approach for data partitioning
Cheng, Chun Hung; Wong, Kam-fai; Woo, Kwan-ho - In: International transactions in operational research : … 18 (2011) 2, pp. 231-255
Persistent link: https://www.econbiz.de/10008907195
Cover Image
An improved branch-and-bound method for maximum monomial agreement
Eckstein, Jonathan; Goldberg, Noam - In: INFORMS journal on computing : JOC 24 (2012) 2, pp. 328-341
Persistent link: https://www.econbiz.de/10009551747
Cover Image
The stochastic capacitated branch restructuring problem
Ruiz-Hernández, Diego; Delgado-Gómez, David - In: Location analysis, (pp. 77-100). 2016
Persistent link: https://www.econbiz.de/10011563095