The minimum linear arrangement problem consists of finding an embedding of the nodes of a graph on the line such that the sum of the resulting edge lengths is minimized. The problem is among the classical NP-hard optimization problems and there has been extensive research on exact and...

The coupled task problem is to schedule n jobs on one machine where each job consists of two subtasks with required delay time between them. The objective is to minimize the makespan. This problem was analyzed in depth by Orman and Potts [3]. They investigated the complexity of different cases...

The coupled task problem is to schedule jobs on a single machine where each job consists of two subtasks and where the second subtask has to be started after a given time interval with respect to the first one. The problem has several applications and is NP-hard. In this paper we present a...

The coupled task problem is to schedule n jobs on one machine where each job consists of two subtasks with required delay time between them. The objective is to minimize the makespan. This problem was analyzed in depth by Orman and Potts [3]. They investigated the complexity of different cases...

The Nouna health district in Burkina Faso, has a population of approximately 275,000 people living in 281 villages, and is served by 25 health facilities, as of 2006. For many people, the time and effort required in traveling to a health facility, which may demand a journey of many kilometers...

This paper presents a combined Facility Location/Network Design Problem which simultaneously considers the location of facilities and the design of its underlying network so as to minimize the maximum customer-facility travel time. The model generalizes the classical p-center problem and has...