Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU
From MaRDI portal
Publication:5111122
DOI10.1007/978-3-319-95104-1_2zbMath1444.90096arXiv1704.06258OpenAlexW2609586893MaRDI QIDQ5111122
Jaouad Boukachour, Unnamed Author, A. Berrajaa, Abdelhamid Benaini
Publication date: 26 May 2020
Published in: Bioinspired Heuristics for Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.06258
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Lower bounding procedures for the single allocation hub location problem
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- Stochastic uncapacitated hub location
- Solving the uncapacitated hub location problem using genetic algorithms
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A quadratic integer program for the location of interacting hub facilities
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Integer programming formulations of discrete hub location problems
- A hybrid heuristic for the uncapacitated hub location problem
- The topology optimization design for cracked structures
- A branch and cut algorithm for hub location problems with single assignment
- Hub Arc Location Problems: Part I—Introduction and Results
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- GPU Computing for Parallel Local Search Metaheuristic Algorithms
