Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (Q1278346): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Integer programming formulations of discrete hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quadratic assignment problem / 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: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / 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: Lower Bounds for the 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

Latest revision as of 18:32, 28 May 2024

scientific article
Language Label Description Also known as
English
Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
scientific article

    Statements

    Tight linear programming relaxations of uncapacitated \(p\)-hub median problems (English)
    0 references
    0 references
    0 references
    0 references
    22 April 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    hub location
    0 references
    linear programming
    0 references
    integer programming
    0 references
    heuristic solutions
    0 references
    tabu search
    0 references
    0 references
    0 references