New LP relaxations for minimum cycle/path/tree cover problems (Q2283007): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Approximations for minimum and min-max vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Multi-Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max tree covers of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax Tree Cover in the Euclidean Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Vehicle Routing with a Common Deadline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for distance constrained vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Min-Max Cycle Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for a min-max location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for some min-max and minimum cycle cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for the minimum cycle cover problem / rank
 
Normal rank

Revision as of 07:52, 21 July 2024

scientific article
Language Label Description Also known as
English
New LP relaxations for minimum cycle/path/tree cover problems
scientific article

    Statements

    New LP relaxations for minimum cycle/path/tree cover problems (English)
    0 references
    0 references
    0 references
    0 references
    27 December 2019
    0 references
    vehicle routing
    0 references
    cycle cover
    0 references
    path cover
    0 references
    approximation algorithm
    0 references
    integrality gap
    0 references

    Identifiers

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