Francis R.L.

R.L. Francis

Information about the author R.L. Francis will soon be added to the site.
Found 9 papers in total
Demand point aggregation for planar covering location models
Demand point aggregation for planar covering location models
2005
The covering location problem seeks the minimum number of facilities such that each...
A framework for demand point and solution space aggregation analysis for location models
A framework for demand point and solution space aggregation analysis for location models
2004
Many location problems can be formulated as minimizing some location objective...
Exploiting self-cancelling demand point aggregation error for some planar rectilinear median location problems
Exploiting self-cancelling demand point aggregation error for some planar rectilinear median location problems
2003
When solving location problems in practice it is quite common to aggregate demand...
Worst-case incremental analysis for a class of p-facility location problems
Worst-case incremental analysis for a class of p-facility location problems
2002
We consider a rather large class of p -facility location models including the p...
Aggregation error bounds for a class of location models
Aggregation error bounds for a class of location models
2000
Many location models involve distances and demand points in their objective function....
Row-column aggregation for rectilinear distance p-median problems
Row-column aggregation for rectilinear distance p-median problems
1996
For large-scale p- median problems, it is common to aggregate the demand points. This...
Contributions of operations research to location analysis
Contributions of operations research to location analysis
1993
Location problems which can be quantified as optimization problems are natural...
Equivalent mathematical programming formulations of monotonic tree network location problems
Equivalent mathematical programming formulations of monotonic tree network location problems
1989
The authors consider the optimization problem of locating several new facilities on a...
The 1-center problem: Exploiting block structure
The 1-center problem: Exploiting block structure
1988
A block of a graph is a maximal nonseparable subgraph. The authors show how the...
Papers per page: