Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem (Q1291636): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / 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: Hub Location and the <i>p</i>-Hub Median Problem / 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: A quadratic integer program 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

Latest revision as of 19:32, 28 May 2024

scientific article
Language Label Description Also known as
English
Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
scientific article

    Statements

    Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem (English)
    0 references
    0 references
    0 references
    22 February 2001
    0 references
    location
    0 references
    linear programming
    0 references
    heuristics
    0 references
    branch and bound
    0 references
    cutting
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references