Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(10 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-011-0497-4 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSEP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-011-0497-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117319367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687196 / 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: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods based on node-routing formulations for undirected arc-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle 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: A cutting plane algorithm 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 guided local search heuristic for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the generalized routing problem through graph transformations / 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: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / 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: Q4510100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routeing winter gritting vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part I: The Chinese Postman Problem / 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: Robust branch-and-cut-and-price for the capacitated vehicle routing problem / 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: Capacitated arc routing problems / 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: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in pricing routines for the capacitated arc routing 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 new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / 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: Q3801316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bound for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decade of Capacitated Arc Routing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-011-0497-4 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:30, 16 December 2024

scientific article
Language Label Description Also known as
English
Improved lower bounds and exact algorithm for the capacitated arc routing problem
scientific article

    Statements

    Improved lower bounds and exact algorithm for the capacitated arc routing problem (English)
    0 references
    0 references
    0 references
    0 references
    18 March 2013
    0 references
    arc routing
    0 references
    set partitioning
    0 references
    valid inequalities
    0 references
    column generation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers