Hochschulschrift | Online-Publikation
The maximum feasible subsystem problem and vertex facet incidences of polyhedra
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Language
-
Englisch
- Notes
-
Berlin, Techn. Univ., Diss., 2002
- Keyword
-
Kombinatorische Optimierung
NP-hartes Problem
- Creator
- URN
-
urn:nbn:de:kobv:83-opus-4459
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:22 AM CEST
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.
Object type
- Hochschulschrift
- Online-Publikation
Associated
Other Objects (12)
Vertex-facet assignments for polytopes
Polyhedra with Hexagonal and Triangular Faces and Three Faces Around Each Vertex
Convex polyhedra
Stratified Polyhedra
Notes on polyhedra.
Polynomials, polyvectors, polyhedra ...
Polyhedra and commensurability
Subsystem Procol : Anwenderhandbuch
Helios-Subsystem-Telekommunikation
Integer Points in Polyhedra
Maintaining a kernel subsystem
Coupling iterative subsystem solvers
Vertex-facet assignments for polytopes
Polyhedra with Hexagonal and Triangular Faces and Three Faces Around Each Vertex
Convex polyhedra
Stratified Polyhedra
Notes on polyhedra.
Polynomials, polyvectors, polyhedra ...
Polyhedra and commensurability
Subsystem Procol : Anwenderhandbuch
Helios-Subsystem-Telekommunikation
Integer Points in Polyhedra
Maintaining a kernel subsystem
Coupling iterative subsystem solvers
Vertex-facet assignments for polytopes
Polyhedra with Hexagonal and Triangular Faces and Three Faces Around Each Vertex
Convex polyhedra
Stratified Polyhedra
Notes on polyhedra.
Polynomials, polyvectors, polyhedra ...
Polyhedra and commensurability
Subsystem Procol : Anwenderhandbuch
Helios-Subsystem-Telekommunikation
Integer Points in Polyhedra
Maintaining a kernel subsystem