Integer-friendly formulations for the r-separation problem

European Journal of Operational Research

Volumn 92, Issue 2, 1996, Pages 342-351

  Erkut, E ^a,c   ReVelle, C ^b   Ulkusal Y ^c  

^a UNIVERSITY OF ALBERTA   (Canada)

^b Johns Hopkins University   (United States)

^c BOGAZICI UNIVERSITY   (Turkey)

Author keywords

Independent set; Integer programming; R separation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; SET THEORY;

INDEPENDENT SET; R SEPARATION;

OPERATIONS RESEARCH;

EID: 0030190098     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00348-3     Document Type: Article

References (16)

1. Brooke, A., Kendrick, D., and Meeraus, A. (1992), GAMS: A User's Guide, Release 2.25, Scientific Press, San Francisco, CA.
2. Cornuejols, G., Nemhauser, G.L., and Wolsey L.A. (1990), "The uncapacitated facility location problem", in: P.B. Mirchandani and R.L. Francis (eds.), Discrete Location Theory, Wiley Interscience, New York.
3. Erkut, E. (1990), "The discrete p-dispersion problem", European Journal of Operational Research 40/1, 48-60.
4. Erkut, E., and Neuman, S. (1991), "Comparison of four models for dispersing facilities", INFOR 29/2, 68-86.
5. Garey, M.R., and Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 194-195.
6. Kincaid, R.K. (1992), "Good solutions to discrete noxious location problems via metaheuristics", Annals of Operations Research 40, 265-281.
7. Kuby, M.J. (1987), "Programming models for facility dispersion: The p-dispersion and maxisum dispersion problems", Geographical Analysis 19/4, 315-329.
8. Moon, I.D., and Chaudhry, S.S. (1984), "Network location with distance constraints", Management Science 30/3, 290-307.
9. Ravi, S.S., Rosenkrantz, D.J., and Tayi, G.K. (1991), "Facility dispersion problems: Heuristics and special cases", in Lecture Notes in Comp. Scriber Science, Vol. 519, 355-366.
10. Ravi, S.S., Rosenkrantz, D.J., and Tayi, G.K. (1994), "Heuristic and special case algorithms for dispersion problems", Operations Research 42, 299-310.
11. ReVelle, C. (1993), "Facility siting and integer-friendly programming", European Journal of Operational Research 65, 147-158.
12. Steuer, R.E., and Harris, F.W. (1980), "Intra-set point generation and filtering in decision and criterion space", Computers & Operations Research 7, 41-53.
13. Tamir, A. (1991), "Obnoxious facility location on graphs", SIAM Journal on Discrete Mathematics 4, 550-567.
14. Wang, D.W., and Kuo, Y.S. (1988), "A study of two geometric location problems", Information Processing Letters 28, 281-286.
15. White, D.J. (1991a), "The maximal dispersion problem and the 'First Point Outside the Neighborhood' heuristic", Computers & Operations Research 18/1, 43-50.
16. White, D.J. (1991b), "The maximal-dispersion problem", IMA Journal of Mathematics Applied in Business and Industry 3, 131-140.