ReVelle Charles

Charles ReVelle

Information about the author Charles ReVelle will soon be added to the site.
Found 18 papers in total
Solving the maximal covering location problem with heuristic concentration
Solving the maximal covering location problem with heuristic concentration
2008
The metaheuristic heuristic concentration (HC) is applied here to the solution of...
Selecting compact habitat reserves for species with differential habitat size needs
Selecting compact habitat reserves for species with differential habitat size needs
2008
We propose a model for the design of protected habitat reserves, which maximizes the...
Location models for ceding market share and shrinking services
Location models for ceding market share and shrinking services
2007
New location models are presented here for exploring the reduction of facilities in a...
Solving the plant location problem on a line by linear programming
Solving the plant location problem on a line by linear programming
1998
This paper investigates the simple uncapacitated plant location problem on a line. We...
Research challenges in environmental management
Research challenges in environmental management
2000
Operational Research has been usefully applied to a wide variety of environmental...
A bi-objective plant location problem: Cost vs. demand served
A bi-objective plant location problem: Cost vs. demand served
1998
The standard plant location problem requires choosing from a set of potential sites...
Integer-friendly formulations for the r-separation problem
Integer-friendly formulations for the r-separation problem
1996
In this paper, we consider different formulations for the r -separation problem, where...
The Queueing Maximal Availability Location Problem: A model for the siting of emergency vehicles
The Queueing Maximal Availability Location Problem: A model for the siting of emergency vehicles
1996
The Maximal Availability Location Problem (MALP) has been recently formulated as a...
A perspective on location science
A perspective on location science
1997
A perspective on location science written following the author's receipt of the...
A Lagrangean heuristic for the maximal covering location problem
A Lagrangean heuristic for the maximal covering location problem
1996
We develop a Lagrangean heuristic for the maximal covering location problem. Upper...
Dynamic selection of harvests with adjacency restrictions: The SHARe model
Dynamic selection of harvests with adjacency restrictions: The SHARe model
1997
A dynamic forest management model is developed that incorporates spatial and temporal...
Facility siting and integer-friendly programming
Facility siting and integer-friendly programming
1993
Facility siting on networks has been accomplished with some success via integer linear...
Indirect covering tree problems on spanning tree networks
Indirect covering tree problems on spanning tree networks
1993
This paper introduces two types of indirect covering tree problems using a spanning...
The maximum-capture hierarchical location problem
The maximum-capture hierarchical location problem
1992
In this paper we present a 0-1 integer programming model for locating services with a...
A probabilistic FLEET model with individual vehicle reliability requirements
A probabilistic FLEET model with individual vehicle reliability requirements
1991
The maximal covering and location set covering problems have recently been extended by...
A multiobjective approach to evaluating and planning the allocation of inspection resources
A multiobjective approach to evaluating and planning the allocation of inspection resources
1991
A two-objective, zero-one programming model of an inspection allocation problem faced...
Review, extension and prediction in emergency service siting models
Review, extension and prediction in emergency service siting models
1989
This is a review of a selected set of location papers and a research agenda. The...
The maximum availability location problem
The maximum availability location problem
1989
A probabilistic version of the maximal covering location problem is introduced here....
Papers per page: