| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Accommodating the rainy season in Third World location-allocation applications
|
|
|
1997
|
5 |
1 |
p. 65-
1 p.
|
article
|
| 2 |
A double annealing algorithm for discrete location/allocation problems
|
|
|
1997
|
5 |
1 |
p. 71-
1 p.
|
article
|
| 3 |
A Lagrangean heuristic for the maximal covering location problem
|
|
|
1997
|
5 |
1 |
p. 72-
1 p.
|
article
|
| 4 |
A location based heuristic for general routing problems
|
|
|
1997
|
5 |
1 |
p. 60-
1 p.
|
article
|
| 5 |
A maxmin location problem with nonconvex feasible region
|
|
|
1997
|
5 |
1 |
p. 61-
1 p.
|
article
|
| 6 |
A model for locating automatic external defibrillators
|
|
|
1997
|
5 |
1 |
p. 65-
1 p.
|
article
|
| 7 |
A multifacility location problem on median spaces
|
|
|
1997
|
5 |
1 |
p. 69-
1 p.
|
article
|
| 8 |
An axiomatic characterization of some locations in trees
|
|
|
1997
|
5 |
1 |
p. 73-
1 p.
|
article
|
| 9 |
An efficient algorithm for facility location in the presence of forbidden regions
|
|
|
1997
|
5 |
1 |
p. 72-
1 p.
|
article
|
| 10 |
An impossibility result in axiomatic location theory
|
|
|
1997
|
5 |
1 |
p. 67-
1 p.
|
article
|
| 11 |
A note on the allocation of queuing facilities using a minisum criterion
|
|
|
1997
|
5 |
1 |
p. 62-
1 p.
|
article
|
| 12 |
A perspective on location science
|
Revelle, Charles
|
|
1997
|
5 |
1 |
p. 3-13
11 p.
|
article
|
| 13 |
A review of extensive facility location in networks
|
|
|
1997
|
5 |
1 |
p. 69-
1 p.
|
article
|
| 14 |
A sequential location scheme for the distance-constrained multifacility location problem on a tree
|
|
|
1997
|
5 |
1 |
p. 70-71
2 p.
|
article
|
| 15 |
A simple search heuristic for the MCLP: application to the location of ambulance bases in a rural region
|
|
|
1997
|
5 |
1 |
p. 66-
1 p.
|
article
|
| 16 |
Bicriteria and restricted 2-facility Weber problems
|
|
|
1997
|
5 |
1 |
p. 59-
1 p.
|
article
|
| 17 |
Capacitated location problems on a line
|
|
|
1997
|
5 |
1 |
p. 70-
1 p.
|
article
|
| 18 |
Comparison of solution procedures to the facility location problem
|
|
|
1997
|
5 |
1 |
p. 67-
1 p.
|
article
|
| 19 |
Composite regions of feasibility for certain classes of distance constrained network location problems
|
|
|
1997
|
5 |
1 |
p. 70-
1 p.
|
article
|
| 20 |
Consistent and inconsistent rules in competitive facility choice
|
|
|
1997
|
5 |
1 |
p. 62-63
2 p.
|
article
|
| 21 |
Constructing and selecting adjacency constraints
|
|
|
1997
|
5 |
1 |
p. 61-
1 p.
|
article
|
| 22 |
Degree of locational freedom in a single facility euclidean minimax location model
|
Ohsawa, Yoshiaki
|
|
1997
|
5 |
1 |
p. 29-45
17 p.
|
article
|
| 23 |
Deterministic flow-demand location problems
|
|
|
1997
|
5 |
1 |
p. 62-
1 p.
|
article
|
| 24 |
Duality theorem for a generalized Fermat-Weber problem
|
|
|
1997
|
5 |
1 |
p. 59-
1 p.
|
article
|
| 25 |
Editorial Board
|
|
|
1997
|
5 |
1 |
p. IFC-
1 p.
|
article
|
| 26 |
Editor's note
|
Current, John
|
|
1997
|
5 |
1 |
p. 1-
1 p.
|
article
|
| 27 |
Erratum: Capacitated facility location: valid inequalities and facets
|
|
|
1997
|
5 |
1 |
p. 66-
1 p.
|
article
|
| 28 |
Estimating the parameters of the weighted lp norm by linear regression
|
|
|
1997
|
5 |
1 |
p. 67-
1 p.
|
article
|
| 29 |
Facility location in the presence of congested regions with the rectilinear distance metric
|
|
|
1997
|
5 |
1 |
p. 65-
1 p.
|
article
|
| 30 |
Facility location on a tree with maximum distance constraints
|
|
|
1997
|
5 |
1 |
p. 65-
1 p.
|
article
|
| 31 |
Fractional location problems
|
Barros, A.I.
|
|
1997
|
5 |
1 |
p. 47-58
12 p.
|
article
|
| 32 |
Genetic algorithms applied to computationally difficult set covering problems
|
|
|
1997
|
5 |
1 |
p. 62-
1 p.
|
article
|
| 33 |
Integer-friendly formulations for the r-separation problem
|
|
|
1997
|
5 |
1 |
p. 73-74
2 p.
|
article
|
| 34 |
Locating discretionary service Facilities, II: Maximizing market size, minimizing inconvenience
|
|
|
1997
|
5 |
1 |
p. 60-
1 p.
|
article
|
| 35 |
Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
|
|
|
1997
|
5 |
1 |
p. 73-
1 p.
|
article
|
| 36 |
Lower bounds for the hub location problem
|
|
|
1997
|
5 |
1 |
p. 60-
1 p.
|
article
|
| 37 |
Massively parallel analog tabu search using neural networks applied to simple plant location problems
|
|
|
1997
|
5 |
1 |
p. 68-
1 p.
|
article
|
| 38 |
Minimum covering criterion for obnoxious facility location on a network
|
|
|
1997
|
5 |
1 |
p. 64-
1 p.
|
article
|
| 39 |
Modelling the number and location of sidings on a single line railway
|
|
|
1997
|
5 |
1 |
p. 64-
1 p.
|
article
|
| 40 |
Models and algorithms for distribution problems with uncertain demands
|
|
|
1997
|
5 |
1 |
p. 69-
1 p.
|
article
|
| 41 |
Multicriteria planar location problems
|
|
|
1997
|
5 |
1 |
p. 68-
1 p.
|
article
|
| 42 |
Multinational plant location as a game of timing
|
|
|
1997
|
5 |
1 |
p. 71-
1 p.
|
article
|
| 43 |
Nested heuristic methods for the location-routeing problem
|
|
|
1997
|
5 |
1 |
p. 63-
1 p.
|
article
|
| 44 |
On cent-dians of general networks
|
Ogryczak, Wlodzimierz
|
|
1997
|
5 |
1 |
p. 15-28
14 p.
|
article
|
| 45 |
On the location of a tree-shaped facility
|
|
|
1997
|
5 |
1 |
p. 63-
1 p.
|
article
|
| 46 |
Optimal robotic component placement
|
|
|
1997
|
5 |
1 |
p. 63-
1 p.
|
article
|
| 47 |
Optimizing solid waste collection in Brussels
|
|
|
1997
|
5 |
1 |
p. 73-
1 p.
|
article
|
| 48 |
Parametric uncapacitated facility location
|
|
|
1997
|
5 |
1 |
p. 72-
1 p.
|
article
|
| 49 |
Polynomial algorithms for center location on spheres
|
|
|
1997
|
5 |
1 |
p. 60-61
2 p.
|
article
|
| 50 |
Production, transportation, and distribution planning in a multi-commodity tri-echelon system
|
|
|
1997
|
5 |
1 |
p. 71-
1 p.
|
article
|
| 51 |
Retail saturation, retail location, and retail competition: an analysis of British grocery retailing
|
|
|
1997
|
5 |
1 |
p. 66-
1 p.
|
article
|
| 52 |
Row-column aggregation for rectilinear distance p-median problems
|
|
|
1997
|
5 |
1 |
p. 70-
1 p.
|
article
|
| 53 |
Solving the anti-covering location problem using Lagrangian relaxation
|
|
|
1997
|
5 |
1 |
p. 64-
1 p.
|
article
|
| 54 |
Solving the dynamic facility location problem
|
|
|
1997
|
5 |
1 |
p. 64-
1 p.
|
article
|
| 55 |
Specially structured uncapacitated facility location problems
|
|
|
1997
|
5 |
1 |
p. 59-
1 p.
|
article
|
| 56 |
The capacitated distribution and waste disposal problem
|
|
|
1997
|
5 |
1 |
p. 72-
1 p.
|
article
|
| 57 |
The general one center location problem
|
|
|
1997
|
5 |
1 |
p. 67-
1 p.
|
article
|
| 58 |
The maximal conditional covering problem
|
|
|
1997
|
5 |
1 |
p. 61-
1 p.
|
article
|
| 59 |
The multiple criteria location problem: 2. Preference-based techniques and interactive decision support
|
|
|
1997
|
5 |
1 |
p. 66-
1 p.
|
article
|
| 60 |
The queueing maximal availability location problem: a model for the siting of emergency vehicles
|
|
|
1997
|
5 |
1 |
p. 68-
1 p.
|
article
|
| 61 |
Tight linear programming relaxation of uncapacitated p-hub median problems
|
|
|
1997
|
5 |
1 |
p. 68-69
2 p.
|
article
|
Journal description