A tabu-search based heuristic for the hub covering problem over incomplete hub networks (Q833521): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Efficient algorithms for the uncapacitated single allocation p-hub median problem / 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: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147668 / 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: Integer programming formulations of discrete hub location 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: Q2776481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Arc Location Problems: Part I—Introduction and Results / 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: A hub covering network design problem for cargo applications in Turkey / 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: An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems / 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: 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: Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated single and multiple allocation \(p\)-hub center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hub covering model for cargo delivery systems / rank
 
Normal rank

Revision as of 21:48, 1 July 2024

scientific article
Language Label Description Also known as
English
A tabu-search based heuristic for the hub covering problem over incomplete hub networks
scientific article

    Statements

    A tabu-search based heuristic for the hub covering problem over incomplete hub networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2009
    0 references
    hub location
    0 references
    hub covering problem
    0 references
    network design
    0 references
    0 references
    0 references

    Identifiers