Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
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 / Wikidata QID
 
Property / Wikidata QID: Q57702228 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997401436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3159349 / 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: Robust branch-and-cut-and-price for the capacitated vehicle 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: Q4762469 / 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: A new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Vehicle Routing on Trees / 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: Q4532226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / 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
Property / cites work
 
Property / cites work: A result on projection for the vehicle 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 deterministic tabu search algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilized column generation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:26, 1 July 2024

scientific article
Language Label Description Also known as
English
Exploiting sparsity in pricing routines for the capacitated arc routing problem
scientific article

    Statements

    Exploiting sparsity in pricing routines for the capacitated arc routing problem (English)
    0 references
    0 references
    0 references
    17 April 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    arc routing
    0 references
    column generation
    0 references
    branch-cut-and-price
    0 references
    0 references
    0 references