Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2020.12.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3118724284 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q118165393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choice of explicit stabilizing terms in column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow pack facets of the single node fixed-charge flow polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders, metric and cutset inequalities for multicommodity capacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating benders decomposition with heuristicmaster problem solutions / 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: Q3500141 / 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: 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 first multilevel cooperative algorithm for capacitated multicommodity network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition without separability: a computational study for capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / 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: Lagrangean decomposition: A model yielding stronger lagrangean bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem / 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 COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacity scaling heuristic for the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for solving the single-sink fixed-charge transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local branching heuristic for the capacitated fixed-charge network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411416 / rank
 
Normal rank

Latest revision as of 16:20, 27 July 2024

scientific article
Language Label Description Also known as
English
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
scientific article

    Statements

    Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 January 2022
    0 references
    network design
    0 references
    Lagrangian relaxation
    0 references
    column generation
    0 references
    matheuristic
    0 references
    0 references
    0 references
    0 references

    Identifiers