Locating median cycles in networks (Q1887911): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: The Circuit Polytope: Facets / 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 Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks / 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: Solving the Orienteering Problem through Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covering Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating A Median Subtree On A Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal location of a path or tree in a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the core of a tree with a specified length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted cover facets of the 0-1 knapsack polytope with GUB constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal location of a path or tree on a network with cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search / rank
 
Normal rank

Latest revision as of 14:36, 7 June 2024

scientific article
Language Label Description Also known as
English
Locating median cycles in networks
scientific article

    Statements

    Locating median cycles in networks (English)
    0 references
    22 November 2004
    0 references
    Integer programming
    0 references
    Location
    0 references
    Routing
    0 references
    Travelling salesman
    0 references
    0 references
    0 references

    Identifiers

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