A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
From MaRDI portal
Publication:2496041
DOI10.1016/j.cor.2005.02.011zbMath1094.90032OpenAlexW2115114028MaRDI QIDQ2496041
Publication date: 30 June 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.011
Minimax problems in mathematical programming (90C47) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Approximation algorithms for the min-max mixed rural postmen cover problem and its variants, Approximation algorithms for the min-max mixed rural postmen cover problem and its variants, Kripke modelling and verification of temporal specifications of a multiple UAV system, Stochastic level-value approximation for quadratic integer convex programming, A Decade of Capacitated Arc Routing, Min-Max K -vehicles windy rural postman problem, Recent results on Arc Routing Problems: An annotated bibliography, A metaheuristic for the min-max windy rural postman problem with K vehicles, New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem, The min-max close-enough arc routing problem, The aircraft maintenance base location problem
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- Competitive memetic algorithms for arc routing problems
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- Routeing winter gritting vehicles
- A polyhedral approach to the rural postman problem
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Variable neighborhood search
- Future paths for integer programming and links to artificial intelligence
- A guided local search heuristic for the capacitated arc routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Tabu Search—Part II
- The Capacitated Arc Routing Problem: Lower bounds
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- On general routing problems
- Parallel iterative search methods for vehicle routing problems
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- Improvement Procedures for the Undirected Rural Postman Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Matching, Euler tours and the Chinese postman
- A Tabu Search Heuristic for the Vehicle Routing Problem
- The m-Traveling Salesman Problem with Minmax Objective
- Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
- Computer Solutions of the Traveling Salesman Problem
- A cutting plane algorithm for the general routing problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
