The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective programming and planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive approach to identify the best compromise solution for two objective shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path problem with two objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank

Latest revision as of 16:03, 22 May 2024

scientific article
Language Label Description Also known as
English
The median tour and maximal covering tour problems: Formulations and heuristics
scientific article

    Statements

    The median tour and maximal covering tour problems: Formulations and heuristics (English)
    0 references
    0 references
    0 references
    19 February 1995
    0 references
    bicriterion routing problems
    0 references
    median tour problem
    0 references
    maximal covering tour problem
    0 references
    NP-hard
    0 references
    heuristic procedure
    0 references
    realistically scaled problem
    0 references
    distributed computer networks
    0 references

    Identifiers