The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Lecture notes in computer science ; 894 : Springer, S. 119-130
- Erschienen in
-
Lecture notes in computer science ; 894
- Ereignis
-
Veröffentlichung
- (wo)
-
Köln
- (wer)
-
Universitäts- und Stadtbibliothek Köln
- (wann)
-
1995
- Urheber
- URN
-
urn:nbn:de:hbz:38-546909
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:57 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Jünger, Michael
- Mutzel, Petra
- Universitäts- und Stadtbibliothek Köln
Entstanden
- 1995
Ähnliche Objekte (12)
The maximum planar subgraph problem
Planar Location Problems with Barriers under Polyhedral Gauges
The polyhedral projection problem
Polyhedral combinatorics and the acyclic subdigraph problem
Polyhedral combinatorics of the quadratic assignment problem
Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut
The theorem of the alternative, the key-theorem, and the vector-maximum problem, for non-polyhedral ordering cones
A polyhedral approach to the weighted girth problem
Polyhedral aspects of the traveling salesman problem, 1.. Theory
The uncapacitated hub location problem : polyhedral analysis and applications
Polyhedral aspects of the traveling salesman problem, 1.. Theory
Polyhedral aspects of the traveling salesman problem, 2.. Computation
The maximum planar subgraph problem
Planar Location Problems with Barriers under Polyhedral Gauges
The polyhedral projection problem
Polyhedral combinatorics and the acyclic subdigraph problem
Polyhedral combinatorics of the quadratic assignment problem
Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut
The theorem of the alternative, the key-theorem, and the vector-maximum problem, for non-polyhedral ordering cones
A polyhedral approach to the weighted girth problem
Polyhedral aspects of the traveling salesman problem, 1.. Theory
The uncapacitated hub location problem : polyhedral analysis and applications
Polyhedral aspects of the traveling salesman problem, 1.. Theory
Polyhedral aspects of the traveling salesman problem, 2.. Computation
The maximum planar subgraph problem
Planar Location Problems with Barriers under Polyhedral Gauges
The polyhedral projection problem
Polyhedral combinatorics and the acyclic subdigraph problem
Polyhedral combinatorics of the quadratic assignment problem
Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut
The theorem of the alternative, the key-theorem, and the vector-maximum problem, for non-polyhedral ordering cones
A polyhedral approach to the weighted girth problem
Polyhedral aspects of the traveling salesman problem, 1.. Theory
The uncapacitated hub location problem : polyhedral analysis and applications
Polyhedral aspects of the traveling salesman problem, 1.. Theory