- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Event
-
Veröffentlichung
- (where)
-
Köln
- (who)
-
Universitäts- und Stadtbibliothek Köln
- (when)
-
1997
- Creator
- URN
-
urn:nbn:de:hbz:38-547682
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:25 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
- Christof, Thomas
- Jünger, Michael
- Kececioglu, John
- Mutzel, Petra
- Reinelt, Gerhard
- Universitäts- und Stadtbibliothek Köln
Time of origin
- 1997
Other Objects (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
Contributions to branch-and-price-and-cut algorithms for routing problems
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
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
Export credits: An end to cut-rate competition
Managing the cut end of a K wire
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
Contributions to branch-and-price-and-cut algorithms for routing problems
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
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
Export credits: An end to cut-rate competition
Managing the cut end of a K wire
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
Contributions to branch-and-price-and-cut algorithms for routing problems
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
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
Export credits: An end to cut-rate competition