#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2001

2017

- This year (0)
- Last 5 years (7)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Gianpaolo Oriolo
- Math. Oper. Res.
- 2008

A crucial assumption in this model is that of knowing the traffic demands in advance. Unfortunately, measuring and predicting traffic demands are difficult problems. Moreover, in severalâ€¦ (More)

- Gianpaolo Oriolo
- Discrete Applied Mathematics
- 2003

In one of fundamental work in combinatorial optimization Edmonds gave a complete linear description of the matching polytope. Matchings in a graph are equivalent to stable sets its line graph. Alsoâ€¦ (More)

- Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia ScutellÃ
- Networks
- 2007

The authors settle the complexity status of the robust network design problem in undirected graphs. The fact that the flow-cut gap in general graphs can be large, poses some difficulty inâ€¦ (More)

Virtual private network design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent the amount of flowâ€¦ (More)

- Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
- SODA
- 2011

We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in O(n3)--time, drastically improving the previous best known complexity bound. Thisâ€¦ (More)

- Giuseppe F. Italiano, Stefano Leonardi, Gianpaolo Oriolo
- Oper. Res. Lett.
- 2006

It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximumâ€¦ (More)

- Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo, Martin Skutella
- Oper. Res. Lett.
- 2008

Only recently, Hurkens, Keijsper, and Stougie proved the VPN Tree Routing Conjecture for the special case of ring networks. We present a short proof of a slightly stronger result which might alsoâ€¦ (More)

- Roberto Sabella, Marina Settembre, Gianpaolo Oriolo, Federica Razza, Fabio Ferlito, Giulia Conte
- 2001

This paper proposes an offline solution for global path provisioning in new-generation optical networks based on the generalized multiprotocol label switching (GMPLS) paradigm. This solution is basedâ€¦ (More)

- Flavia Bonomo, Sara Mattia, Gianpaolo Oriolo
- Theor. Comput. Sci.
- 2011

The Double Traveling Salesman Problem with Multiple Stacks is a vehicle routing problem in which pickups and deliveries must be performed in two independent networks. The items are stored in stacksâ€¦ (More)