Approximation algorithms for group prize-collecting and location-routing problems (Q1003471): 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: Transformations of generalized ATSP into ATSP. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Steiner problems and other variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several formulations for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized network design problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient transformation of the generalized vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized travelling salesman problem through n sets of nodes: The asymmetrical case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for the group Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank

Latest revision as of 02:31, 29 June 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for group prize-collecting and location-routing problems
scientific article

    Statements

    Approximation algorithms for group prize-collecting and location-routing problems (English)
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    algorithm
    0 references
    approximation
    0 references
    prize-collecting
    0 references
    travelling salesman
    0 references
    location
    0 references
    group
    0 references

    Identifiers