HUBBI: iterative network design for incomplete hub location problems (Q1725629): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129142483, #quickstatements; #temporary_batch_1723938276269
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu-search based heuristic for the hub covering problem over incomplete hub networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new formulation and an exact approach for the many-to-many hub location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition for the uncapacitated multiple allocation hub location problem / 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: Lagrangean relaxation for the capacitated hub location problem with single assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment / 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: The capacitated multiple allocation hub location problem: Formulations and algorithms / 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: A two‐stage hub location method for air transportation in Brazil / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the capacitated modular hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search for an uncapacitated \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-phase algorithm for solving the single allocation \(p\)-hub center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / 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: GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial analysis of single allocation hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the hub location and routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the design of hub networks with multiple lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition applied to a robust multiple allocation incomplete hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New simple and efficient heuristics for the uncapacitated single allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tabu search for the location of interacting hub facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the hub location problem with modular link capacities / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129142483 / rank
 
Normal rank

Latest revision as of 00:45, 18 August 2024

scientific article
Language Label Description Also known as
English
HUBBI: iterative network design for incomplete hub location problems
scientific article

    Statements

    HUBBI: iterative network design for incomplete hub location problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    incomplete hub location problems
    0 references
    hubbiness
    0 references
    network design
    0 references
    scalability
    0 references
    0 references

    Identifiers