Polynomial algorithms for some hard problems of finding connected spanning subgraphs of extreme total edge weight
Year of publication: |
2007
|
---|---|
Authors: | Baburin, Alexey ; Gimadi, Edward |
Published in: |
Operations research proceedings 2006 : selected papers of the Annual International Conference of the German Operations Research Society (GOR), jointly organized with the Austrian Society of Operations Research (Ă–GOR) and the Swiss Society of Operations Research (SVOR), Karlsruhe, September 6 - 8 2006 ; with 79 tables. - Berlin : Springer, ISBN 3-540-69994-5. - 2007, p. 215-220
|
Subject: | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
Computing integral solutions of complementarity problems
Laan, Gerard van der, (2004)
- More ...
-
Approximation polynomial algorithms for some modifications of TSP
Gimadi, Edward, (2009)
- More ...