2006
DOI: 10.1016/j.ejor.2004.05.027
|View full text |Cite
|
Sign up to set email alerts
|

Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2006
2006
2013
2013

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(11 citation statements)
references
References 7 publications
0
11
0
Order By: Relevance
“…Domínguez-Marín et al (2005) deal with solving the discrete ordered median problem, Fathali and Kakhki (2006) apply VNS to the p-median problem with pos/neg weights, solve the capacitated p-median problem and Pérez et al (2007) propose a hybrid which combines VNS with Path Relinking for the p-hub median problem. Osman and Ahmadi (2007) investigate different search and selection strategies, including the VND for the capacitated p-median problem with single source constraint.…”
Section: Location Problemsmentioning
confidence: 99%
“…Domínguez-Marín et al (2005) deal with solving the discrete ordered median problem, Fathali and Kakhki (2006) apply VNS to the p-median problem with pos/neg weights, solve the capacitated p-median problem and Pérez et al (2007) propose a hybrid which combines VNS with Path Relinking for the p-hub median problem. Osman and Ahmadi (2007) investigate different search and selection strategies, including the VND for the capacitated p-median problem with single source constraint.…”
Section: Location Problemsmentioning
confidence: 99%
“…Domínguez-Marín et al (2005) deal with solving the discrete ordered median problem, Fathali and Kakhki (2006) apply VNS to the p-median problem with pos/neg weights, Fleszar and Hindi (2008) solve the capacitated p-median problem and Pérez et al (2007) propose a hybrid which combines VNS with Path Relinking for the p-hub median problem. Osman and Ahmadi (2007) investigate different search and selection strategies, including the variable neighbourhood descent (VND) for the capacitated p-median problem with single source constraint.…”
Section: Location Problemsmentioning
confidence: 99%
“…Constraints (9) and (10) guarantee that potential links and MS centers are not used if they are not constructed. Constraints (13) emphasize that, on any given link, an optimal solution flow will be in only one direction. Therefore, both links ( , ) and ( , ) cannot be constructed or improved simultaneously.…”
Section: Model Formulationmentioning
confidence: 99%
“…Therefore, both links ( , ) and ( , ) cannot be constructed or improved simultaneously. Constraint (12) restricts the total number of newly located MS centers to the predetermined MS centers of P. Constraints (13) represent that every MS center can be selected as a backup of a primary MS center at most on one level. Constraints (14) guarantee that allocation of MS centers in different levels of reliability is not done if an MS center is not located or constructed.…”
Section: Model Formulationmentioning
confidence: 99%