Insertion heuristics for central cycle problems (Q3057168): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20348 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3122853765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominant, an algorithm for the \(p\)-center problem. / 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: The p-Centre Problem-Heuristic and Optimal Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple heuristic for the p-centre problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling and solving central cycle problems with integer programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covering Tour 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: Lexicographic local search and the \(p\)-center problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized \(p\)-center problems: Complexity results and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy and hard bottleneck location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating median cycles in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a cycle in a transportation or a telecommunications network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-center problems with minimum coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of extensive facility location in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem / rank
 
Normal rank

Latest revision as of 12:59, 3 July 2024

scientific article
Language Label Description Also known as
English
Insertion heuristics for central cycle problems
scientific article

    Statements

    Insertion heuristics for central cycle problems (English)
    0 references
    0 references
    0 references
    24 November 2010
    0 references
    tour
    0 references
    cycle
    0 references
    center
    0 references
    eccentricity
    0 references
    cycle-length
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references