An \(M/M/c\) queue model for hub covering location problem (Q409968): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: A quadratic integer program for the location of interacting hub facilities / 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: Solution algorithms for the capacitated single allocation hub location problem / 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: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single-assignment hub covering problem: Models and linearizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projecting the flow variables for hub location problems / 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: The capacitated multiple allocation hub location problem: Formulations and algorithms / 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: Formulating and solving splittable capacitated multiple allocation hub location problems / 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: Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment / 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: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location models for airline hubs behaving as \(M/D/c\) queues. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub-and-spoke network design with congestion / 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: On tabu search for the location of interacting hub facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil / 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: Q4070096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colonial competitive algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path relinking approach for multiple allocation hub maximal covering problem / rank
 
Normal rank

Revision as of 01:36, 5 July 2024

scientific article
Language Label Description Also known as
English
An \(M/M/c\) queue model for hub covering location problem
scientific article

    Statements

    An \(M/M/c\) queue model for hub covering location problem (English)
    0 references
    0 references
    0 references
    0 references
    15 April 2012
    0 references
    location
    0 references
    facilities planning and design
    0 references
    hub covering location
    0 references
    queuing
    0 references
    evolutionary computations
    0 references
    imperialist competitive algorithm
    0 references
    0 references

    Identifiers