An approach to the asymmetric multi-depot capacitated arc routing problem (Q319291): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066210488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the windy postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results on Arc Routing Problems: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized assignment problem: Valid inequalities and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the minimum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated arc routing problems using a transformation to the CVRP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank

Latest revision as of 15:38, 12 July 2024

scientific article
Language Label Description Also known as
English
An approach to the asymmetric multi-depot capacitated arc routing problem
scientific article

    Statements

    An approach to the asymmetric multi-depot capacitated arc routing problem (English)
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    arc routing
    0 references
    valid inequalities
    0 references
    branch-and-cut
    0 references

    Identifiers