Upgrading nodes in tree-shaped hub location (Q1628119): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2018.10.007 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963527389 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1802.05252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(p\)-hub median problem for non-complete networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian and branch-and-cut approaches for upgrading spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming: Methods, Uses, Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations of discrete hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Arc Location Problems: Part I—Introduction and Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds from a path based formulation for the tree of hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic approaches for the cycle hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upgrading Shortest Paths in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem / 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: Improving Minimum Cost Spanning Trees by Upgrading Nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree network design avoiding congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic integer program for the location of interacting hub facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub network design with single and multiple allocation: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network upgrading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A biased random-key genetic algorithm for the tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Benders decomposition algorithm for the tree of hubs location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upgrading the 1-center problem with edge length variables on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129114360 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2018.10.007 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:36, 11 December 2024

scientific article
Language Label Description Also known as
English
Upgrading nodes in tree-shaped hub location
scientific article

    Statements

    Upgrading nodes in tree-shaped hub location (English)
    0 references
    0 references
    0 references
    3 December 2018
    0 references
    hub location
    0 references
    spanning tree
    0 references
    upgrading
    0 references
    0 references

    Identifiers

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