Kenneth E. Rosing

According to our database, Kenneth E. Rosing authored at least 6 papers between 1992 and 2002.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

2002

Heuristic concentration for the <i>p</i>-median: an example demonstrating how and why it works.

Kenneth E. Rosing, M. John Hodgson

Comput. Oper. Res., 2002

2001

Response by Brimberg, ReVelle and Rosing.

Jack Brimberg, Charles S. ReVelle, Kenneth E. Rosing

J. Oper. Res. Soc., 2001

2000

Defendens Imperium Romanum: A Classical Problem in Military Strategy.

Charles S. Revelle, Kenneth E. Rosing

Am. Math. Mon., 2000

Network distance characteristics that affect computational effort in p-median location problems.

David A. Schilling, Kenneth E. Rosing, Charles S. Revelle

Eur. J. Oper. Res., 2000

1999

A gamma heuristic for the p-median problem.

Kenneth E. Rosing, Charles S. Revelle, David A. Schilling

Eur. J. Oper. Res., 1999

1992

A network location-allocation model trading off flow capturing and<i>p</i>-median objectives.

M. John Hodgson, Kenneth E. Rosing

Ann. Oper. Res., 1992