scientific article

zbMath0416.90049MaRDI QIDQ3206662

Alexander H. G. Rinnooy Kan, Jan Karel Lenstra

Publication date: 1979

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

zbMATH Keywords

surveycomputational complexityvehicle routingtraveling salesmanapproximation algorithmscheduling problemsworst-case performancevehicle schedulingChinese postmanrural postmanpolynomial- time algorithmNp-hardnessstacker-crane

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (16)

A tabu search heuristic for the vehicle routing problem with time windows and split deliveries ⋮ Incorporating vehicle into the vehicle routing fleet composition problem ⋮ Generalized travelling salesman problem through n sets of nodes: The asymmetrical case ⋮ New trends in machine scheduling ⋮ Routing problems: A bibliography ⋮ The vehicle routing problem with backhauls ⋮ A result on projection for the vehicle routing problem ⋮ An appraisal of computational complexity for operations researchers ⋮ Polyhedral results for a vehicle routing problem ⋮ On the vehicle routing problem ⋮ Systematic review of the latest scientific publications on the vehicle routing problem ⋮ A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem ⋮ A tabu search algorithm for the multi-trip vehicle routing and scheduling problem ⋮ Network models for vehicle and crew scheduling ⋮ Vehicle routing via column generation ⋮ A two-phase tabu search approach to the location routing problem

This page was built for publication: