A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343): 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.1016/j.ejor.2013.11.003 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q62048271 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2013.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071020517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP Modeling of Incremental Connected Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / 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: 0-1 reformulations of the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP models for connected facility location: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation algorithms for 0-1 knapsack polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A splitter location-allocation problem in designing fiber optic access networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut-and-price for capacitated connected facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact approaches to the single-source network loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Capacitated Local Access Network Design Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2013.11.003 / rank
 
Normal rank

Latest revision as of 17:14, 17 December 2024

scientific article
Language Label Description Also known as
English
A MIP-based approach to solve the prize-collecting local access network design problem
scientific article

    Statements

    A MIP-based approach to solve the prize-collecting local access network design problem (English)
    0 references
    0 references
    0 references
    19 February 2015
    0 references
    network loading
    0 references
    local access
    0 references
    prize-collecting
    0 references
    matheuristic algorithm
    0 references

    Identifiers

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