Search Results - person:"Seitz, Hanna"

On a binary distance model for the minimum linear arrangement problem

Reinelt, Gerhard; Seitz, Hanna - In: TOP: An Official Journal of the Spanish Society of … 22 (2014) 1, pp. 384-396

The minimum linear arrangement problem consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is minimized. The problem is among the classical NP-hard optimization problems and there has been extensive research on exact and...

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

On a binary distance model for the minimum linear arrangement problem

Reinelt, Gerhard; Seitz, Hanna - In: Top : transactions in operations research 22 (2014) 1, pp. 384-396

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

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

Applying mod-k-cuts for solving linear ordering problems

Oswald, Marcus; Reinelt, Gerhard; Seitz, Hanna - In: Top : transactions in operations research 17 (2009) 1, pp. 158-170

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