We present a theoretical analysis of Watson’s Hierarchicalif-and-only-if (HIFF) problem using a variety of tools. These include schema theory and course graining, the concept of...
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
We develop a multi-objective model for resource allocation problem in PERT networks with exponentially or Erlang distributed activity durations, where the mean duration of each ac...
Amir Azaron, Hideki Katagiri, Masatoshi Sakawa, Ko...
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...