Tight bounds from a path based formulation for the tree of hub location problem (Q833527): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Iván A. Contreras / rank
Normal rank
 
Property / author
 
Property / author: Elena Fernández / rank
Normal rank
 
Property / author
 
Property / author: Iván A. Contreras / rank
 
Normal rank
Property / author
 
Property / author: Elena Fernández / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2008.12.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076515248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders Decomposition for Hub Location Problems Arising in Public Transport / 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: Optimum Communication Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design for time‐constrained delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the optimal \(p\)-source communication spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating path- or tree-shaped facilities on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating tree-shaped facilities using the ordered median objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension to rapid transit network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a cycle in a transportation or a telecommunications network / 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: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution algorithms for the capacitated single allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation. (With comments and rejoinder). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating and solving splittable capacitated multiple allocation hub location problems / rank
 
Normal rank

Latest revision as of 20:49, 1 July 2024

scientific article
Language Label Description Also known as
English
Tight bounds from a path based formulation for the tree of hub location problem
scientific article

    Statements

    Tight bounds from a path based formulation for the tree of hub location problem (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2009
    0 references
    hub location
    0 references
    spanning trees
    0 references
    Lagrangean relaxation
    0 references

    Identifiers