scientific article
From MaRDI portal
Publication:3151784
zbMath1005.90510MaRDI QIDQ3151784
Enrico Angelelli, Renata Mansini
Publication date: 16 October 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Traffic problems in operations research (90B20)
Related Items (14)
A unified heuristic for a large class of vehicle routing problems with backhauls ⋮ A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ General solutions to the single vehicle routing problem with pickups and deliveries ⋮ Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery ⋮ A review of vehicle routing with simultaneous pickup and delivery ⋮ A branch-and-price algorithm for a routing problem with inbound and outbound requests ⋮ The single vehicle routing problem with deliveries and selective pickups ⋮ A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery ⋮ A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery ⋮ A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries ⋮ Lasso solution strategies for the vehicle routing problem with pickups and deliveries ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
This page was built for publication:
