An integer programming-based local search for the covering salesman problem (Q1761202): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation algorithms for the Geometric Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>m</i>-Ring-Star Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The median tour and maximal covering tour problems: Formulations and heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new ILP-based refinement heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covering Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the multi-vehicle covering tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating median cycles in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic procedure for the capacitated \(m\)-ring-star problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ILP improvement procedure for the open vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank

Latest revision as of 21:46, 5 July 2024

scientific article
Language Label Description Also known as
English
An integer programming-based local search for the covering salesman problem
scientific article

    Statements

    An integer programming-based local search for the covering salesman problem (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    covering salesman problem
    0 references
    heuristics
    0 references
    integer linear programming
    0 references
    0 references
    0 references
    0 references
    0 references