- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Ereignis
-
Veröffentlichung
- (wo)
-
Köln
- (wer)
-
Universitäts- und Stadtbibliothek Köln
- (wann)
-
1997
- Urheber
- URN
-
urn:nbn:de:hbz:38-547682
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:25 MESZ
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
- Christof, Thomas
- Jünger, Michael
- Kececioglu, John
- Mutzel, Petra
- Reinelt, Gerhard
- Universitäts- und Stadtbibliothek Köln
Entstanden
- 1997
Ähnliche Objekte (12)
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Anwendung des Branch & Cut Verfahrens auf das kapazitierte Vehicle-Routing-Problem
Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Contributions to branch-and-price-and-cut algorithms for routing problems
Optimizing the branch number and branch length of radial drilling in high water cut low permeability reservoirs
Low dimensional 0,1-polytopes and branch-and-cut in combinatorial optimization
Optimizing the design of complex energy conversion systems by Branch and Cut
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Cut-first branch-and-price-second for the capacitated arc-routing problem
Alternative mapping of probes to genes for Affymetrix chips
Export credits: An end to cut-rate competition
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Anwendung des Branch & Cut Verfahrens auf das kapazitierte Vehicle-Routing-Problem
Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Contributions to branch-and-price-and-cut algorithms for routing problems
Optimizing the branch number and branch length of radial drilling in high water cut low permeability reservoirs
Low dimensional 0,1-polytopes and branch-and-cut in combinatorial optimization
Optimizing the design of complex energy conversion systems by Branch and Cut
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Cut-first branch-and-price-second for the capacitated arc-routing problem
Alternative mapping of probes to genes for Affymetrix chips
Export credits: An end to cut-rate competition
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Anwendung des Branch & Cut Verfahrens auf das kapazitierte Vehicle-Routing-Problem
Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Contributions to branch-and-price-and-cut algorithms for routing problems
Optimizing the branch number and branch length of radial drilling in high water cut low permeability reservoirs
Low dimensional 0,1-polytopes and branch-and-cut in combinatorial optimization
Optimizing the design of complex energy conversion systems by Branch and Cut
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Cut-first branch-and-price-second for the capacitated arc-routing problem
Alternative mapping of probes to genes for Affymetrix chips