The tree of hubs location problem (Q1039782): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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 relaxation based approaches to capacitated hub-and-spoke network design problem / 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: Preprocessing and cutting for multiple allocation hub location problems. / 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: Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: New formulations for the uncapacitated multiple allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design for time‐constrained delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation for the capacitated hub location problem with single assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated multiple allocation hub location problem: Formulations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Solution Approach Based on Shortest-Paths for <i>p</i>-Hub Median Problems / 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: Solution algorithms for the capacitated single allocation hub location problem / 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: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / 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: Adapting polyhedral properties from facility to hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Communication Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the p-hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the uncapacitated hub location 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: A branch and cut algorithm for hub location problems with single assignment / 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: A hub location problem in designing digital data service networks: Lagrangian relaxation approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating and solving splittable capacitated multiple allocation hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm / 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: HubLocator: An exact solution method for the multiple allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776481 / 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: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new relaxation method for the generalized minimum spanning tree problem / 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: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank

Latest revision as of 05:37, 2 July 2024

scientific article
Language Label Description Also known as
English
The tree of hubs location problem
scientific article

    Statements

    The tree of hubs location problem (English)
    0 references
    0 references
    0 references
    0 references
    23 November 2009
    0 references
    0 references
    hub location
    0 references
    spanning trees
    0 references
    valid inequalities
    0 references
    0 references
    0 references
    0 references
    0 references