A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2008.09.003 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2008.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027918977 / 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: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Benders decomposition applied to fixed-charge network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Network Design—Polyhedral Structure and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for capacitated network design problems / 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: 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: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search and local branching / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2008.09.003 / rank
 
Normal rank

Latest revision as of 14:17, 10 December 2024

scientific article
Language Label Description Also known as
English
A local branching heuristic for the capacitated fixed-charge network design problem
scientific article

    Statements

    A local branching heuristic for the capacitated fixed-charge network design problem (English)
    0 references
    17 November 2009
    0 references
    network design
    0 references
    heuristics
    0 references
    local branching
    0 references

    Identifiers