Similar Search Results

A tutorial on branch and cut algorithms for the maximum stable set problem

Rebennack, Steffen; Reinelt, Gerhard; Pardalos, Panos M. - In: International transactions in operational research : … 19 (2012) 1/2, pp. 161-199

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

Evaluating the quality of image matrices in blockmodeling

Wiesberg, Stefan; Reinelt, Gerhard - In: EURO journal on computational optimization 3 (2015) 2, pp. 111-129

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

Operations research proceedings 2003 : selected papers of the International Conference on Operations Research (OR 2003), Heidelberg, September 3 - 5, 2003 ; with 51 tables

Ahr, Dino (ed.); Fahrion, Roland (ed.); Oswald, Marcus (ed.) - 2004

This proceedings volume contains a selection of papers presented at the International Conference on Operations Research (OR 2003). The contributions cover the broad interdisciplinary spectrum of Operations Research and present recent advances in theory, development of methods, and applications...

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

Provably good solutions for the traveling salesman problem

Jünger, Michael - In: Zeitschrift für Operations-Research : ZOR ; … 40 (1994) 2, pp. 183-217

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

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

A mixed integer linear programming model for multi-satellite scheduling

Chen, Xiaoyu; Reinelt, Gerhard; Dai, Guangming; Spitz, … - In: European journal of operational research : EJOR 275 (2019) 2, pp. 694-707

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

Heuristics for budget facility location-network design problems with minisum objective

Cocking, Cara; Reinelt, Gerhard - In: Operations research proceedings 2008 : selected papers …, (pp. 563-568). 2009

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

Solving the earth observing satellite constellation scheduling problem by branch-and-price

Wang, Pei; Reinelt, Gerhard - In: Operations research proceedings 2010 : selected papers …, (pp. 491-496). 2011

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

Small instance relaxations for the traveling salesman problem

Reinelt, Gerhard - In: Operations research proceedings 2003 : selected papers …, (pp. 371-378). 2004

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

A complete description of the traveling salesman polytope on 8 nodes

Jünger, Michael; Reinelt, Gerhard - 1991

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