Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
K.E. Rosing
Information about the author K.E. Rosing will soon be added to the site.
Found
11 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Heuristic concentration for the p-median: An example demonstrating how and why it works
2002
We map certain combinatorial aspects of the p -median problem and explore their...
Network distance characteristics that affect computational effort in p-median location problems
2000
In solving location models, the effort expended and the quality of the solutions...
A gamma heuristic for the p-median problem
1999
Heuristics concentration (HC) is a two-stage metaheuristic that can be applied to a...
Heuristic concentration and Tabu search: A head to head comparison
1998
Earlier this year two papers applying the metaheuristics Tabu search (TS) and...
Heuristic concentration: Two stage solution construction
1997
By utilizing information from multiple runs of an interchange heuristic we construct a...
Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
1996
Traditional location-allocation models aim to locate network facilities to optimally...
A systematic classification of application of location-allocation models
1996
This paper presents a systematic classification of formally published applications of...
Considering offshore production platforms
1994
Hansen et al. provides us with a most significant piece of work and one which, by...
An optimal method for solving the (Generalized) Multi-Weber Problem
1992
The Single Weber Problem and the Multi-Weber Problem have troubled generations of...
Toward the solution of the (generalised) multi-Weber problem
1991
Despite the long history of the multi-Weber problem and the generalised multi-Weber...
On the correct number of regions in regionalisation structures
1989
In region building, different models of cluster analysis conform to different...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers