Exact approaches to the single-source network loading problem (Q2892148): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.20481 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q62048286 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20481 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117058482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric inequalities and the network loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for a network loading problem with multiple facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost capacity installation for multicommodity network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing the push-relabel method for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source sink flows with capacity installation in batches / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impact of filtering in a branch-and-cut algorithm 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: Benders, metric and cutset inequalities for multicommodity capacitated network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the selection of Benders' cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Benders decomposition applied to a multi-layer network design 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: Exact solution of multicommodity network optimization problems with general step cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backbone Network Design Tools with Economic Tradeoffs / 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: Improved Approximation for Single-Sink Buy-at-Bulk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for representing piecewise linear cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / 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: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical enhancements to the Magnanti-Wong method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition by Local Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Single-Sink Link-Installation Problem in Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Capacitated Local Access Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirected and unidirected capacity installation in telecommunication networks. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.20481 / rank
 
Normal rank

Latest revision as of 03:27, 20 December 2024

scientific article
Language Label Description Also known as
English
Exact approaches to the single-source network loading problem
scientific article

    Statements

    Exact approaches to the single-source network loading problem (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    local access network design
    0 references
    network loading
    0 references
    capacitated network design
    0 references

    Identifiers