A polynomial algorithm for the max cut problem on graphs without long odd cycles

by Martin Grötschel and George L. Nemhauser. [Inst. für Ökonometrie u. Operations-Research, Rhein. Friedrich-Wilhelms-Univ., Bonn]

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

Check Google Scholar |

More access options

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

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

A service of the