IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v46y1990i1p48-60.html
   My bibliography  Save this item

The discrete p-dispersion problem

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Tetsuya Araki & Shin-ichi Nakano, 0. "Max–min dispersion on a line," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-7.
  2. Maria Scaparra & Richard Church & F. Medrano, 2014. "Corridor location: the multi-gateway shortest path model," Journal of Geographical Systems, Springer, vol. 16(3), pages 287-309, July.
  3. Rennen, G., 2008. "Subset Selection from Large Datasets for Kriging Modeling," Other publications TiSEM 9dfe6396-1933-45c0-b4e3-5, Tilburg University, School of Economics and Management.
  4. W. David Pisinger & Anders Bo Rasmussen & Rune Sandvik, 2007. "Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 280-290, May.
  5. Niblett, Matthew R. & Church, Richard L., 2015. "The disruptive anti-covering location problem," European Journal of Operational Research, Elsevier, vol. 247(3), pages 764-773.
  6. Sayyady, Fatemeh & Fathi, Yahya, 2016. "An integer programming approach for solving the p-dispersion problem," European Journal of Operational Research, Elsevier, vol. 253(1), pages 216-225.
  7. David Sayah & Stefan Irnich, 2015. "A New Compact Formulation for Discrete p-Dispersion," Working Papers 1517, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  8. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.
  9. Erkut, E. & ReVelle, C. & Ulkusal, Y., 1996. "Integer-friendly formulations for the r-separation problem," European Journal of Operational Research, Elsevier, vol. 92(2), pages 342-351, July.
  10. Spiers, Sandy & Bui, Hoa T. & Loxton, Ryan, 2023. "An exact cutting plane method for the Euclidean max-sum diversity problem," European Journal of Operational Research, Elsevier, vol. 311(2), pages 444-454.
  11. Martí, Rafael & Martínez-Gavara, Anna & Pérez-Peló, Sergio & Sánchez-Oro, Jesús, 2022. "A review on discrete diversity and dispersion maximization from an OR perspective," European Journal of Operational Research, Elsevier, vol. 299(3), pages 795-813.
  12. Prokopyev, Oleg A. & Kong, Nan & Martinez-Torres, Dayna L., 2009. "The equitable dispersion problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 59-67, August.
  13. Kevin Curtin & Richard Church, 2007. "Optimal dispersion and central places," Journal of Geographical Systems, Springer, vol. 9(2), pages 167-187, June.
  14. Anna Martínez-Gavara & Vicente Campos & Manuel Laguna & Rafael Martí, 2017. "Heuristic solution approaches for the maximum minsum dispersion problem," Journal of Global Optimization, Springer, vol. 67(3), pages 671-686, March.
  15. Nicolas Dupin & Frank Nielsen & El-Ghazali Talbi, 2021. "Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front," Mathematics, MDPI, vol. 9(4), pages 1-30, February.
  16. Rennen, G., 2008. "Subset Selection from Large Datasets for Kriging Modeling," Discussion Paper 2008-26, Tilburg University, Center for Economic Research.
  17. Alain Billionnet & Sourour Elloumi & Amélie Lambert & Angelika Wiegele, 2017. "Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 318-331, May.
  18. Turner, S.D.O. & Romero, D.A. & Zhang, P.Y. & Amon, C.H. & Chan, T.C.Y., 2014. "A new mathematical programming approach to optimize wind farm layouts," Renewable Energy, Elsevier, vol. 63(C), pages 674-680.
  19. Aringhieri, Roberto & Cordone, Roberto & Grosso, Andrea, 2015. "Construction and improvement algorithms for dispersion problems," European Journal of Operational Research, Elsevier, vol. 242(1), pages 21-33.
  20. Jesús Sánchez-Oro & Ana D. López-Sánchez & Anna Martínez-Gavara & Alfredo G. Hernández-Díaz & Abraham Duarte, 2021. "A Hybrid Strategic Oscillation with Path Relinking Algorithm for the Multiobjective k -Balanced Center Location Problem," Mathematics, MDPI, vol. 9(8), pages 1-21, April.
  21. Wang, Yang & Wu, Qinghua & Glover, Fred, 2017. "Effective metaheuristic algorithms for the minimum differential dispersion problem," European Journal of Operational Research, Elsevier, vol. 258(3), pages 829-843.
  22. Jia Wang & Shiyan Hu, 2013. "A linear time approximation scheme for computing geometric maximum k-star," Journal of Global Optimization, Springer, vol. 55(4), pages 849-855, April.
  23. Lei, Ting L. & Church, Richard L., 2015. "On the unified dispersion problem: Efficient formulations and exact algorithms," European Journal of Operational Research, Elsevier, vol. 241(3), pages 622-630.
  24. Akgun, Vedat & Erkut, Erhan & Batta, Rajan, 2000. "On finding dissimilar paths," European Journal of Operational Research, Elsevier, vol. 121(2), pages 232-246, March.
  25. Frank J. Kampas & János D. Pintér & Ignacio Castillo, 2023. "Model Development and Solver Demonstrations Using Randomized Test Problems," SN Operations Research Forum, Springer, vol. 4(1), pages 1-15, March.
  26. Daniel Porumbel & Jin-Kao Hao & Fred Glover, 2011. "A simple and effective algorithm for the MaxMin diversity problem," Annals of Operations Research, Springer, vol. 186(1), pages 275-293, June.
  27. Tetsuya Araki & Shin-ichi Nakano, 2022. "Max–min dispersion on a line," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1824-1830, October.
  28. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
  29. Michael Kuby & Seow Lim, 2007. "Location of Alternative-Fuel Stations Using the Flow-Refueling Location Model and Dispersion of Candidate Sites on Arcs," Networks and Spatial Economics, Springer, vol. 7(2), pages 129-152, June.
  30. Ríos-Mercado, Roger Z. & Bard, Jonathan F., 2019. "An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation," European Journal of Operational Research, Elsevier, vol. 276(1), pages 259-271.
  31. Husslage, B.G.M. & Rennen, G. & van Dam, E.R. & den Hertog, D., 2011. "Space-filling Latin hypercube designs for computer experiments," Other publications TiSEM 694f73df-a373-46a7-aa4d-1, Tilburg University, School of Economics and Management.
  32. Zhengguan Dai & Kathleen Xu & Melkior Ornik, 2021. "Repulsion-based p-dispersion with distance constraints in non-convex polygons," Annals of Operations Research, Springer, vol. 307(1), pages 75-91, December.
  33. Castillo, Ignacio & Kampas, Frank J. & Pintér, János D., 2008. "Solving circle packing problems by global optimization: Numerical results and industrial applications," European Journal of Operational Research, Elsevier, vol. 191(3), pages 786-802, December.
  34. Amirgaliyeva, Zhazira & Mladenović, Nenad & Todosijević, Raca & Urošević, Dragan, 2017. "Solving the maximum min-sum dispersion by alternating formulations of two different problems," European Journal of Operational Research, Elsevier, vol. 260(2), pages 444-459.
  35. Drezner, Zvi & Kalczynski, Pawel & Salhi, Said, 2019. "The planar multiple obnoxious facilities location problem: A Voronoi based heuristic," Omega, Elsevier, vol. 87(C), pages 105-116.
  36. Sayah, David & Irnich, Stefan, 2017. "A new compact formulation for the discrete p-dispersion problem," European Journal of Operational Research, Elsevier, vol. 256(1), pages 62-67.
  37. Vicky Mak & Tommy Thomadsen, 2006. "Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem," Journal of Combinatorial Optimization, Springer, vol. 11(4), pages 421-434, June.
  38. Gliesch, Alex & Ritt, Marcus, 2021. "A hybrid heuristic for the maximum dispersion problem," European Journal of Operational Research, Elsevier, vol. 288(3), pages 721-735.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.