The single allocation problem in the interacting three-hub network (Q4944738): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
The single allocation problem in the interacting three-hub network
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 formulations of discrete hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Location and the <i>p</i>-Hub Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / 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: An Exact Solution Approach Based on Shortest-Paths for <i>p</i>-Hub Median Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing satellite communication networks by zero—one quadratic programming / 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: Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / 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: On tabu search for the location of interacting hub facilities / 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: Neural versus traditional approaches to the location of interacting hub facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear program for the two-hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solution procedure and reduced size formulations for \(p\)-hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with the Aid of Network Flow Algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200001)35:1<17::aid-net2>3.0.co;2-n / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047031742 / rank
 
Normal rank
Property / title
 
The single allocation problem in the interacting three-hub network (English)
Property / title: The single allocation problem in the interacting three-hub network (English) / rank
 
Normal rank

Latest revision as of 12:11, 30 July 2024

scientific article; zbMATH DE number 1420488
Language Label Description Also known as
English
The single allocation problem in the interacting three-hub network
scientific article; zbMATH DE number 1420488

    Statements

    0 references
    0 references
    27 June 2000
    0 references
    single allocation problem
    0 references
    three-hub network
    0 references
    NP-hard
    0 references
    mixed integer formulation
    0 references
    The single allocation problem in the interacting three-hub network (English)
    0 references

    Identifiers