A polynomial algorithm for the max cut problem on graphs without long odd cycles
Year of publication: |
1982
|
---|---|
Authors: | Grötschel, Martin ; Nemhauser, George L. |
Publisher: |
Bonn : Inst. für Ökonometrie u. Operations-Research |
Subject: | Programming | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Algorithmus | Algorithm |
Extent: | 20 S. graph. Darst. 30 cm |
---|---|
Series: | Report / OR. - Bonn : Inst. für Ökonometrie und Operations-Research, ISSN 0724-3138, ZDB-ID 265820-3. - Vol. No. 82,211 |
Type of publication: | Book / Working Paper |
Language: | English |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Mathematical models and routing algorithms for economical cutting tool paths
Makarovskikh, T. A., (2018)
-
Hosseinian, Seyedmohammadhossein, (2020)
- More ...
-
Geometric algorithms and combinatorial optimization
Grötschel, Martin, (1988)
-
Polyhedral aspects of the traveling salesman problem
Grötschel, Martin,
-
Order picking in an automatic warehouse: Solving online asymmetric TSPs
Ascheuer, Norbert, (1999)
- More ...