An integer programming-based local search for the covering salesman problem
type: Item
instance of: scholarly article
title: An integer programming-based local search for the covering salesman problem
zbMATH Open document ID: 1251.90338
author: Majid Salari
author: Zahra Naji-Azimi
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6106614
zbMATH Keywords: covering salesman problem
zbMATH Keywords: heuristics
zbMATH Keywords: integer linear programming
describes a project that uses: TSPLIB
describes a project that uses: VRP
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2012.01.004
OpenAlex ID: W2030714952
cites work: Approximation algorithms for the Geometric Covering Salesman Problem
cites work: The Capacitated m-Ring-Star Problem
cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
cites work: The Covering Salesman Problem
cites work: The median tour and maximal covering tour problems: Formulations and heuristics
cites work: A new ILP-based refinement heuristic for vehicle routing problems
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: The Covering Tour Problem
cites work: The generalized covering salesman problem
cites work: The traveling salesman problem and its variations
cites work: Heuristics for the multi-vehicle covering tour problem
cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm
cites work: Locating median cycles in networks
cites work: The selective travelling salesman problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: A heuristic procedure for the capacitated \(m\)-ring-star problem
cites work: An ILP improvement procedure for the open vehicle routing problem
cites work: An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
cites work: The vehicle routing problem
DOI: 10.1016/J.COR.2012.01.004
description: scientific article; zbMATH DE number 6106614