A comparison of formulations and solution methods for the minimum-envy location problem
- 1 June 2009
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 36 (6) , 1966-1981
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Junta de Andalucía (P06-FQM-01364, P06-FQM-01366)
- Fundación Séneca (02911/PI/05)
- Ministerio de Educación, Cultura y Deporte (01,02, HA2003-0121, HI2006-0123, MTM2004-0909, MTM2006-14961-C05-04, MTM2007-67433-C02)
This publication has 24 references indexed in Scilit:
- A flexible model and efficient solution strategies for discrete location problemsDiscrete Applied Mathematics, 2009
- A strengthened formulation for the simple plant location problem with orderOperations Research Letters, 2007
- Thek-centrum shortest path problemTOP, 2006
- A branch-and-cut method for the obnoxious p-median problem4OR, 2006
- Strategy-proof assignment with fair compensationMathematical Social Sciences, 2005
- Improved algorithms for several network location problems with equality measuresDiscrete Applied Mathematics, 2003
- Minimizing the sum of the k largest functions in linear timeInformation Processing Letters, 2003
- Equity measurement in facility location analysis: A review and frameworkEuropean Journal of Operational Research, 1994
- Outcomes of voting and planning in single facility location problemsEuropean Journal of Operational Research, 1985
- Outcomes of voting and planningJournal of Public Economics, 1981