Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2004.11.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967687507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel insert method for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fleet size and mix problem for capacitated arc routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solutions for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augment-insert algorithms for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part II: The Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated arc routing problem: Valid inequalities and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the Capacitated Arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Arc Routing Problem: Lower bounds / 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: Transforming arc routing into node routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3159359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3 / rank
 
Normal rank

Latest revision as of 13:57, 11 June 2024

scientific article
Language Label Description Also known as
English
Solving capacitated arc routing problems using a transformation to the CVRP
scientific article

    Statements

    Solving capacitated arc routing problems using a transformation to the CVRP (English)
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    Arc routing
    0 references
    Mixed-integer programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers