- 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)
-
1993
- Urheber
- URN
-
urn:nbn:de:hbz:38-546782
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:52 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
- 1993
Ähnliche Objekte (12)
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Paths of low weight in planar graphs
Branch-and-refine for solving time-dependent problems
Solving nonconvex planar location problems by finite dominating sets
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Contributions to branch-and-price-and-cut algorithms for routing problems
A branch-and-cut approach to physical mapping with end-probes
Anwendung des Branch & Cut Verfahrens auf das kapazitierte Vehicle-Routing-Problem
Contraction-based Separation and Lifting for Solving the Max-Cut Problem
Contraction-based separation and lifting for solving the max-cut problem
Low dimensional 0,1-polytopes and branch-and-cut in combinatorial optimization
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Paths of low weight in planar graphs
Branch-and-refine for solving time-dependent problems
Solving nonconvex planar location problems by finite dominating sets
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Contributions to branch-and-price-and-cut algorithms for routing problems
A branch-and-cut approach to physical mapping with end-probes
Anwendung des Branch & Cut Verfahrens auf das kapazitierte Vehicle-Routing-Problem
Contraction-based Separation and Lifting for Solving the Max-Cut Problem
Contraction-based separation and lifting for solving the max-cut problem
Low dimensional 0,1-polytopes and branch-and-cut in combinatorial optimization
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Paths of low weight in planar graphs
Branch-and-refine for solving time-dependent problems
Solving nonconvex planar location problems by finite dominating sets
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Contributions to branch-and-price-and-cut algorithms for routing problems
A branch-and-cut approach to physical mapping with end-probes
Anwendung des Branch & Cut Verfahrens auf das kapazitierte Vehicle-Routing-Problem
Contraction-based Separation and Lifting for Solving the Max-Cut Problem
Contraction-based separation and lifting for solving the max-cut problem
Low dimensional 0,1-polytopes and branch-and-cut in combinatorial optimization