#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1977

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Lucio Bianco, Giuseppe Confessore, Pierfrancesco Reverberi
- Transportation Science
- 2001

In this paper we consider the Project Scheduling Problem with resource constraints, where the objective is to minimize the project makespan. We present a new 0-1 linear programming formulation of the problem that requires an exponential number of variables, corresponding to all feasible subsets of activities that can be simultaneously executed withoutā¦ (More)

- Lucio Bianco, Aristide Mingozzi, Salvatore Ricciardelli
- Networks
- 1993

In this work we consider the following hazmat transportation network design problem. A given set of hazmat shipments has to be shipped over a road transportation network in order to transport a given amount of hazardous materials from specific origin points to specific destination points, and we assume there are regional and local government authoritiesā¦ (More)

- Lucio Bianco, Paolo Dell'Olmo, Stefano Giordani
- Annals OR
- 1999

- Lucio Bianco, Paolo Dell'Olmo, Stefano Giordani
- J. Scheduling
- 2006

- Lucio Bianco, Giuseppe Confessore, Monica Gentili
- Annals OR
- 2006

In this paper we address the Sensor Location Problem, that is the location of the minimum number of counting sensors, on the nodes of a network, in order to determine the arc flow volume of all the network. Despite the relevance of the problem from a practical point of view, there are very few contributions in the literature and no combinatorial analysis isā¦ (More)

- Aristide Mingozzi, Lucio Bianco, Salvatore Ricciardelli
- Operations Research
- 1997

- Aristide Mingozzi, Marco A. Boschetti, Salvatore Ricciardelli, Lucio Bianco
- Operations Research
- 1999

- Lucio Bianco, Massimiliano Caramia
- Computers & OR
- 2011

In this paper we propose a new lower bound for the resource constrained project scheduling problem with generalized precedence relationships. The lower bound is based on a relaxation of the resource constraints among independent activities and on a solution of the relaxed problem suitably represented by means of an AON acyclic network. Computational resultsā¦ (More)