A note on ``A LP-based heuristic for a time-constrained routing problem'' (Q1926858): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A LP-based heuristic for a time-constrained routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 reformulations of the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilized structured Dantzig-Wolfe decomposition method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of column generation to accelerate convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic view of Dantzig--Wolfe decomposition in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling multistage cutting stock problems / rank
 
Normal rank

Latest revision as of 01:32, 6 July 2024

scientific article
Language Label Description Also known as
English
A note on ``A LP-based heuristic for a time-constrained routing problem''
scientific article

    Statements

    A note on ``A LP-based heuristic for a time-constrained routing problem'' (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 December 2012
    0 references
    0 references
    large-scale optimization
    0 references
    column generation
    0 references
    column-and-row generation
    0 references
    time-constrained routing
    0 references
    0 references