scientific article; zbMATH DE number 6741966
From MaRDI portal
Publication:5271456
zbMath1387.90256MaRDI QIDQ5271456
Stefan Irnich, José-Manuel Belenguer, Enrique Benavent
Publication date: 11 July 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
column generationbranch and boundbranch and cutpricingcapacitated arc routing problemvalid constraintsCVRP formulation
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (8)
The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem ⋮ An efficiency-based path-scanning heuristic for the capacitated arc routing problem ⋮ The commodity-split multi-compartment capacitated arc routing problem ⋮ Large multiple neighborhood search for the soft-clustered vehicle-routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ Fast upper and lower bounds for a large‐scale real‐world arc routing problem ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ Exact solution of the soft-clustered vehicle-routing problem
This page was built for publication:
