Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks (Q336554): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A hub location problem with fully interconnected backbone and access networks / 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: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / 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: A quadratic integer program for the location of interacting hub facilities / 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: Solution approaches to hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the uncapacitated hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the uncapacitated hub location problem using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New simple and efficient heuristics for the uncapacitated single allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Benders decomposition applied to fixed-charge network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized network design problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized fixed-charge network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank

Latest revision as of 21:40, 12 July 2024

scientific article
Language Label Description Also known as
English
Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
scientific article

    Statements

    Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    hierarchical networks
    0 references
    hub location
    0 references
    hybrid heuristic
    0 references
    simulated annealing
    0 references
    tabu search
    0 references
    variable neighborhood search
    0 references

    Identifiers