A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097): 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.cam.2008.10.055 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007402232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tailoring Benders decomposition for uncapacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex hull of two core capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach to the fixed-charge capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplex-Based Tabu Search Method for Capacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search for network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A first multilevel cooperative algorithm for capacitated multicommodity network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Heuristic for Production Planning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem / rank
 
Normal rank

Latest revision as of 22:35, 1 July 2024

scientific article
Language Label Description Also known as
English
A capacity scaling heuristic for the multicommodity capacitated network design problem
scientific article

    Statements

    A capacity scaling heuristic for the multicommodity capacitated network design problem (English)
    0 references
    0 references
    10 September 2009
    0 references
    A capacity scaling heuristic using a column generation and row generation technique to address the multi-commodity capacitated network design problem is proposed. The capacity scaling heuristic is an approximate iterative solution method for capacitated network problems based on changing arc capacities, which depend on flow volumes on the arcs.
    0 references
    0 references
    network optimization
    0 references
    capacity scaling
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references