scientific article; zbMATH DE number 3892967

zbMath0559.90091MaRDI QIDQ5184698

Gilbert Laporte, Yves Nobert

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

comb inequalitiesVehicle Routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (15)

Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm ⋮ A branch-and-cut algorithm for vehicle routing problems ⋮ Routing problems: A bibliography ⋮ A result on projection for the vehicle routing problem ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem ⋮ Recent advances in vehicle routing exact algorithms ⋮ Polyhedral results for a vehicle routing problem ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ Combined route capacity and route length models for unit demand vehicle routing problems ⋮ Polyhedral study of the capacitated vehicle routing problem ⋮ Exact algorithms for routing problems under vehicle capacity constraints ⋮ Branch and cut methods for network optimization ⋮ Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs ⋮ Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure ⋮ A computational comparison of flow formulations for the capacitated location-routing problem

This page was built for publication: