An efficient model for the multiple allocation hub maximal covering problem
From MaRDI portal
Publication:6078427
DOI10.1080/10556788.2023.2196726zbMath1523.90259OpenAlexW4376135129MaRDI QIDQ6078427
Mohammad Maleki, Unnamed Author, Ashesh Kumar Sinha
Publication date: 27 September 2023
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2023.2196726
Cites Work
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
- New formulations for the uncapacitated multiple allocation hub location problem
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- The \(p\)-hub center allocation problem
- An exact solution procedure for a cluster hub location problem
- Path relinking approach for multiple allocation hub maximal covering problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Location of hubs in a competitive environment
- Integer programming formulations of discrete hub location problems
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- On the single-assignment \(p\)-hub center problem
- Solving large single allocation \(p\)-hub problems with two or three hubs
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- The simple plant location problem: Survey and synthesis
- Ambulance location and relocation models.
- Solving a capacitated hub location problem
- Bicriteria p-Hub Location Problems and Evolutionary Algorithms
- Model formulations for hub covering problems
- The Maximum Coverage Location Problem
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- The single-assignment hub covering problem: Models and linearizations
- Dual-based approach for a hub network design problem under non-restrictive policy
This page was built for publication: An efficient model for the multiple allocation hub maximal covering problem
