scientific article; zbMATH DE number 3648431
approximation algorithmChinese postmancomputational complexityNp-hardnesspolynomial- time algorithmrural postmanscheduling problemsstacker-cranesurveytraveling salesmanvehicle routingvehicle schedulingworst-case performance
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Programming involving graphs or networks (90C35)
- Vehicle routing via column generation
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- New trends in machine scheduling
- 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
- 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
- A two-phase tabu search approach to the location routing problem
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- Routing problems: A bibliography
- Incorporating vehicle into the vehicle routing fleet composition problem
- On the vehicle routing problem
- Systematic review of the latest scientific publications on the vehicle routing problem
- Network models for vehicle and crew scheduling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206662)
