Lower and upper bounds for the linear arrangement problem on interval graphs
Year of publication: |
2018
|
---|---|
Authors: | Quilliot, Alain ; Rebaine, Djamal ; Toussaint, Hélène |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 52.2018, 4/5, p. 1123-1145
|
Subject: | Interval Graphs | Linear Ordering | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
Quilliot, Alain, (2016)
-
Strong SDP based bounds on the cutwidth of a graph
Gaar, Elisabeth, (2024)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
- More ...
-
Duhamel, Christophe, (2011)
-
Moukrim, Aziz, (2015)
-
Flow polyhedra and resource constrained project scheduling problems
Quilliot, Alain, (2012)
- More ...