Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Network Design is an active research area in the intersection of Combinatorial Optimization
and Theoretical Computer Science that focuses on problems arising in the realm of modern …

The relay node placement problem for wireless sensor networks is concerned with placing a
minimum number of relay nodes into a wireless sensor network to meet certain connectivity …

Efficient methods to model and optimise the design of open pit mines have been known for
many years. Although the underground mine design problem is conceptually more difficult it …

Spatial optimization deals with a variety of problems involved in arranging, operating, and
designing systems of activities across a spatial domain. It is comprised of both models and …

Efficient methods to model and optimize the design of open‐cut mines have been known for
many years. The design of the infrastructure of underground mines has a similar potential for …

The spatial relations of sites within networks of priority areas for conservation is critical to the
long-term maintenance of key genetic, population and ecosystem processes. However …

Most travel behavior studies on route and mode choice focus only on an individual level.
This paper adopts the concept of multi-state supernetworks to model the two-person joint …

This paper presents a protocol and design for concurrent and reliable group multicast (many-
to-many) from bursty data sources in general networks. In a group multicast, any node can …

We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the
partition LP relaxation introduced by Könemann et al. Math. Programming, 2009 …