in this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (mrcpsp) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. we present a depth-first branch and bound algorithm for the resource constrained project schedulin...

This paper shows that a method that has long been used to solve Resource Constrained Optimization Problems and found extremely effective in practice, is effective in the theoretical sense as well, it is proved to be strongly polynomial. In the special case of Resource Constrained Shortest Path Problem a better running time estimation is also presented.

We consider a class of packing problems with uncertain data, which we refer to as the chance-constrained binary packing problem. In this problem, a subset of items is selected that maximizes the total profit so that a generic packing constraint is satisfied with high probability. Interesting special cases of our problem include chance-constrained knapsack and set packing problems with random co...

Several practical instances of network design problems often require the network to satisfy multiple constraints. In this paper, we focus on the following problem (and its variants): nd a low-cost network, under one cost function, that services every node in the graph, under another cost function, (i.e., every node of the graph is within a prespeciied distance from the network). This study has ...

We consider the problem of synthesizing feasible signals in the presence of inconsistent convex constraints, some of which are hard in the sense that they must absolutely be satis ed. This problem is formalized as that of minimizing an objective function measuring the degree of unfeasibility with respect to the soft constraints over the intersection of the sets associated with the hard constrai...

We consider the following class of polygon-constrained motion planning problems: Given a set of k centrally controlled mobile agents (say pebbles) initially sitting on the vertices of an n-vertex simple polygon P , we study how to plan their vertex-to-vertex motion in order to reach with a minimum (either maximum or total) movement (either in terms of number of hops or Euclidean distance) a fin...

Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , we consider the problem of finding a shortest (simple) path p in G complying with the additional constraint that l(p) 2 L. Here l(p) denotes the unique word given by concatenating the -labels of the edges along the path p. The main contributions of this paper include the following: 1. We sh...

A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...