- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Stochastic Programming E-Print Series ; 2
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Humboldt-Universität zu Berlin
- (when)
-
2007
- Creator
-
Saxena, Anureet
Goyal, Vineet
Lejeune, Miguel
- DOI
-
10.18452/8374
- URN
-
urn:nbn:de:kobv:11-110-18452/9026-2
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:50 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.
Associated
- Saxena, Anureet
- Goyal, Vineet
- Lejeune, Miguel
- Humboldt-Universität zu Berlin
Time of origin
- 2007
Other Objects (12)
A Short Note on the Probabilistic Set Covering Problem
Set Covering Probleme in der Funknetzplanung
Set Covering Probleme in der Funknetzplanung
Covering Planar Sets
Das Partial set covering problem und Erweiterungen : Modellierung und Lösungsverfahren
Das Partial set covering problem und Erweiterungen : Modellierung und Lösungsverfahren
CMSA based on set covering models for packing and routing problems
COVERING PLANE SETS WITH SETS OF THREE TIMES LESS DIAMETER
Aspects of set packing, partitioning, and covering
Set Covering With Almost Consecutive Ones Property
Discrete tomography, packing and covering, and stable set problems : polytopes and algorithms
Multi-objective database queries in combined knapsack and set covering problem domains
A Short Note on the Probabilistic Set Covering Problem
Set Covering Probleme in der Funknetzplanung
Set Covering Probleme in der Funknetzplanung
Covering Planar Sets
Das Partial set covering problem und Erweiterungen : Modellierung und Lösungsverfahren
Das Partial set covering problem und Erweiterungen : Modellierung und Lösungsverfahren
CMSA based on set covering models for packing and routing problems
COVERING PLANE SETS WITH SETS OF THREE TIMES LESS DIAMETER
Aspects of set packing, partitioning, and covering
Set Covering With Almost Consecutive Ones Property
Discrete tomography, packing and covering, and stable set problems : polytopes and algorithms
Multi-objective database queries in combined knapsack and set covering problem domains
A Short Note on the Probabilistic Set Covering Problem
Set Covering Probleme in der Funknetzplanung
Set Covering Probleme in der Funknetzplanung
Covering Planar Sets
Das Partial set covering problem und Erweiterungen : Modellierung und Lösungsverfahren
Das Partial set covering problem und Erweiterungen : Modellierung und Lösungsverfahren
CMSA based on set covering models for packing and routing problems
COVERING PLANE SETS WITH SETS OF THREE TIMES LESS DIAMETER
Aspects of set packing, partitioning, and covering
Set Covering With Almost Consecutive Ones Property
Discrete tomography, packing and covering, and stable set problems : polytopes and algorithms