The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Lecture notes in computer science ; 894 : Springer, S. 119-130
- Bibliographic citation
-
Lecture notes in computer science ; 894
- Event
-
Veröffentlichung
- (where)
-
Köln
- (who)
-
Universitäts- und Stadtbibliothek Köln
- (when)
-
1995
- Creator
- URN
-
urn:nbn:de:hbz:38-546909
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:57 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Jünger, Michael
- Mutzel, Petra
- Universitäts- und Stadtbibliothek Köln
Time of origin
- 1995
Other Objects (12)
The maximum planar subgraph problem
Planar Location Problems with Barriers under Polyhedral Gauges
The polyhedral projection problem
Polyhedral combinatorics of the quadratic assignment problem
Polyhedral combinatorics and the acyclic subdigraph problem
Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut
A polyhedral approach to the weighted girth problem
The theorem of the alternative, the key-theorem, and the vector-maximum problem, for non-polyhedral ordering cones
Polyhedral aspects of the traveling salesman problem, 1.. Theory
Polyhedral aspects of the traveling salesman problem, 2.. Computation
Polyhedral aspects of the traveling salesman problem, 2.. Computation
Polyhedral aspects of the traveling salesman problem, 1.. Theory
The maximum planar subgraph problem
Planar Location Problems with Barriers under Polyhedral Gauges
The polyhedral projection problem
Polyhedral combinatorics of the quadratic assignment problem
Polyhedral combinatorics and the acyclic subdigraph problem
Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut
A polyhedral approach to the weighted girth problem
The theorem of the alternative, the key-theorem, and the vector-maximum problem, for non-polyhedral ordering cones
Polyhedral aspects of the traveling salesman problem, 1.. Theory
Polyhedral aspects of the traveling salesman problem, 2.. Computation
Polyhedral aspects of the traveling salesman problem, 2.. Computation
Polyhedral aspects of the traveling salesman problem, 1.. Theory
The maximum planar subgraph problem
Planar Location Problems with Barriers under Polyhedral Gauges
The polyhedral projection problem
Polyhedral combinatorics of the quadratic assignment problem
Polyhedral combinatorics and the acyclic subdigraph problem
Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut
A polyhedral approach to the weighted girth problem
The theorem of the alternative, the key-theorem, and the vector-maximum problem, for non-polyhedral ordering cones
Polyhedral aspects of the traveling salesman problem, 1.. Theory
Polyhedral aspects of the traveling salesman problem, 2.. Computation
Polyhedral aspects of the traveling salesman problem, 2.. Computation