Adaptive robust optimization problems have received significant attention in recent years,
but remain notoriously difficult to solve when recourse decisions are discrete in nature. In …

We introduce a new class of two-stage stochastic uncapacitated facility location problems
under system nervousness considerations. The location and allocation decisions are made …

The tree t^* t∗-spanner problem is an NP-hard problem, which is concerned with finding a
spanning tree in a given undirected weighted graph, such that for each pair of nodes the …

Accelerated bridge construction (ABC) techniques are rapidly gaining acceptance as an
alternative to conventional construction to reduce construction duration and minimize the …

This chapter discusses different possibilities for modeling and solving robust discrete facility
location problems. Initially, a finite uncertainty set is assumed. Several concepts are …

A significant amount of academic material has been developed for Facility Location
Problems (FLPs), allowing new approaches for solving and applying them in real-world …

Optimization models have become a cornerstone of the operations research and
prescriptive analytics community. In practice, model parameters are seldom known with …

In this study the Geographic Information System (GIS) method and the Analytical
Hierarchical Process (AHP) are combined in order to present a methodology for locating fire …

The article discusses how Location Theory studies optimization problems to determine
points that satisfy conditions with the works of Pierre de Fermat, Bonaventura Cavalieri, and …

Maximal Coverage Location Problem (MCLP) attempts to find a predetermined number of
facilities to maximize the number of demand points that can be covered. In MCLP, while all …