The Granular Tabu Search for Pickup and Delivery Maximal Covering Problem

A tabu search heuristic for the uncapacitated single allocation p -hub maximal covering problem

European Journal of Operational Research ◽

10.1016/j.ejor.2017.03.066 ◽

2017 ◽

Vol 262 (3) ◽

pp. 954-965 ◽

Cited By ~ 22

Author(s):

Marcos Roberto Silva ◽

Claudio B. Cunha

Keyword(s):

Tabu Search ◽

Covering Problem ◽

Search Heuristic ◽

Maximal Covering ◽

Single Allocation

Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem

Variable Neighborhood Search - Lecture Notes in Computer Science ◽

10.1007/978-3-030-44932-2_9 ◽

2020 ◽

pp. 126-138

Author(s):

Matheus de Araujo Butinholi ◽

Alexandre Xavier Martins ◽

Paganini Barcellos de Oliveira ◽

Diego Perdigão Martino

Keyword(s):

Covering Problem ◽

Maximal Covering ◽

Single Allocation

Two Artificial Intelligence Heuristics in Solving Multiple Allocation Hub Maximal Covering Problem

Lecture Notes in Computer Science - Intelligent Computing ◽

10.1007/11816157_90 ◽

2006 ◽

pp. 737-744 ◽

Cited By ~ 9

Author(s):

Ke-rui Weng ◽

Chao Yang ◽

Yun-feng Ma

Keyword(s):

Artificial Intelligence ◽

Covering Problem ◽

Maximal Covering ◽

Multiple Allocation

Uncapacitated single allocation p-hub maximal covering problem

Computers & Industrial Engineering ◽

10.1016/j.cie.2012.03.014 ◽

2012 ◽

Vol 63 (2) ◽

pp. 382-389 ◽

Cited By ~ 28

Author(s):

Young Ha Hwang ◽

Young Hoon Lee

Keyword(s):

Covering Problem ◽

Maximal Covering ◽

Single Allocation

Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem

Discrete Optimization ◽

10.1016/j.disopt.2021.100672 ◽

2022 ◽

Vol 43 ◽

pp. 100672

Author(s):

Olivera Stančić ◽

Zorica Stanimirović ◽

Raca Todosijević ◽

Stefan Mišković

Keyword(s):

Covering Problem ◽

Maximal Covering ◽

Solution Methods

An exact algorithm for the maximal covering problem

Location Science ◽

10.1016/s0966-8349(97)83448-1 ◽

1996 ◽

Vol 4 (4) ◽

pp. 288

Keyword(s):

Exact Algorithm ◽

Covering Problem ◽

Maximal Covering ◽

Fuzzy multi-objective linear programming for a stochastic hub maximal covering problem with uncertain shipments

International Journal of Industrial and Systems Engineering ◽

10.1504/ijise.2016.077699 ◽

2016 ◽

Vol 23 (4) ◽

pp. 482

Author(s):

Amir Ebrahimi Zade ◽

Ahmad Sadegheih ◽

Mohammad Mehdi Lotfi

Keyword(s):

Linear Programming ◽

Covering Problem ◽

Maximal Covering ◽

Multi Objective ◽

A defensive maximal covering problem on a network

International Transactions in Operational Research ◽

10.1111/j.1475-3995.2009.00660.x ◽

2009 ◽

Vol 16 (1) ◽

pp. 69-86 ◽

Cited By ~ 25

Author(s):

O. Berman ◽

T. Drezner ◽

Z. Drezner ◽

G. O. Wesolowsky

Keyword(s):

Covering Problem ◽

Maximal Covering ◽

An exact algorithm for the maximal covering problem

Naval Research Logistics (NRL) ◽

10.1002/(sici)1520-6750(199604)43:3<435::aid-nav8>3.0.co;2-a ◽

1996 ◽

Vol 43 (3) ◽

pp. 435-461 ◽

Cited By ~ 24

Author(s):

Brian T. Downs ◽

Jeffrey D. Camm

Keyword(s):

Exact Algorithm ◽

Covering Problem ◽

Maximal Covering ◽

The probabilistic 1-maximal covering problem on a network with discrete demand weights

Journal of the Operational Research Society ◽

10.1057/palgrave.jors.2602466 ◽

2008 ◽

Vol 59 (10) ◽

pp. 1398-1405 ◽

Cited By ~ 8

Author(s):

O Berman ◽

J Wang

Keyword(s):

Covering Problem ◽

Maximal Covering ◽