Hochschulschrift
Anwendung des Branch & Cut Verfahrens auf das kapazitierte Vehicle-Routing-Problem
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
VII, 95 S.
- Language
-
Deutsch
- Notes
-
graph. Darst.
Köln, Univ., Diss., 2000
- Keyword
-
Tourenplanung
Branch-and-Cut-Methode
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:02 PM 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
Associated
Other Objects (12)
A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies
Contributions to branch-and-price-and-cut algorithms for routing problems
Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
Cut-first branch-and-price-second for the capacitated arc-routing problem
The Vehicle Routing Problem with Worker and Vehicle Synchronization: Metaheuristic and Branch-and-Price Approaches
Vehicle routing problem
A branch-and-price algorithm for two-echelon electric vehicle routing problem
A machine learning-based branch and price algorithm for a sampled vehicle routing problem
Neural Algorithms for Vehicle Routing : Learning Deep Models to Solve Vehicle Routing Problems
Synchronization requirements in vehicle routing
Anticipation in dynamic vehicle routing
On Clustered Vehicle-Routing Problems
A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies
Contributions to branch-and-price-and-cut algorithms for routing problems
Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
Cut-first branch-and-price-second for the capacitated arc-routing problem
The Vehicle Routing Problem with Worker and Vehicle Synchronization: Metaheuristic and Branch-and-Price Approaches
Vehicle routing problem
A branch-and-price algorithm for two-echelon electric vehicle routing problem
A machine learning-based branch and price algorithm for a sampled vehicle routing problem
Neural Algorithms for Vehicle Routing : Learning Deep Models to Solve Vehicle Routing Problems
Synchronization requirements in vehicle routing
Anticipation in dynamic vehicle routing
On Clustered Vehicle-Routing Problems
A Branch-and-Cut-and-Price Algorithm for the Electric Vehicle Routing Problem with Multiple Technologies
Contributions to branch-and-price-and-cut algorithms for routing problems
Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
Cut-first branch-and-price-second for the capacitated arc-routing problem
The Vehicle Routing Problem with Worker and Vehicle Synchronization: Metaheuristic and Branch-and-Price Approaches
Vehicle routing problem
A branch-and-price algorithm for two-echelon electric vehicle routing problem
A machine learning-based branch and price algorithm for a sampled vehicle routing problem
Neural Algorithms for Vehicle Routing : Learning Deep Models to Solve Vehicle Routing Problems
Synchronization requirements in vehicle routing
Anticipation in dynamic vehicle routing