Models and branch-and-cut algorithms for pickup and delivery problems with time windows.
Stefan RopkeJean-François CordeauGilbert LaportePublished in: Networks (2007)
Keyphrases
- optimization problems
- benchmark problems
- learning models
- estimation problems
- problems in computer vision
- structured prediction problems
- search methods
- statistical models
- orders of magnitude
- theoretical analysis
- run times
- practical problems
- graph theory
- difficult problems
- computational problems
- np hard problems
- vehicle routing problem
- reinforcement learning
- machine learning algorithms
- np complete
- probabilistic model
- iterative algorithms
- learning algorithm
- convex optimization problems
- association rules
- optimization criteria
- evolutionary algorithm
- large scale data sets
- theoretical guarantees
- statistical methods
- learned models
- worst case
- computationally efficient
- related problems
- combinatorial optimization
- machine learning