Optimizing in graphs with expensive computation of edge weights
Year of publication: |
2008
|
---|---|
Authors: | Noé, Frank ; Oswald, Marcus ; Reinelt, Gerhard |
Published in: |
Operations research proceedings 2007 : selected papers of the Annual International Conference of the German Operations Research Society (GOR) ; Saarbrücken, September 5 - 7, 2007. - Berlin : Springer, ISBN 3-540-77902-7. - 2008, p. 435-440
|
Subject: | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
The cutting plane method is polynomial for perfect matchings
Chandrasekaran, Karthekeyan, (2016)
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
- More ...
-
Ahr, Dino, (2004)
-
A branch and cut solver for the maximum stable set problem
Rebennack, Steffen, (2011)
-
Applying mod-k-cuts for solving linear ordering problems
Oswald, Marcus, (2009)
- More ...