2008 |
17 | | Alessandro Aloisio,
Claudio Arbib,
Fabrizio Marinelli:
A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs.
CTW 2008: 181-183 |
16 | EE | Claudio Arbib,
Giovanni Felici:
Recent contributions of OR to network optimization.
European Journal of Operational Research 189(3): 1343-1344 (2008) |
2007 |
15 | EE | Claudio Arbib,
Fabrizio Rossi,
Stefano Smriglio:
Annals of OR - Special volume in memory of Mario Lucertini.
Annals OR 150(1): 1 (2007) |
14 | EE | Claudio Arbib,
Fabrizio Marinelli:
An optimization model for trim loss minimization in an automotive glass plant.
European Journal of Operational Research 183(3): 1421-1432 (2007) |
2005 |
13 | EE | Claudio Arbib,
Fabrizio Marinelli:
Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application.
European Journal of Operational Research 163(3): 617-630 (2005) |
2004 |
12 | EE | Claudio Arbib,
Stefano Smriglio,
Mara Servilio:
A competitive scheduling problem and its relevance to UMTS channel assignment.
Networks 44(2): 132-141 (2004) |
2003 |
11 | EE | Claudio Arbib,
Michele Flammini,
Fabrizio Marinelli:
Minimum Flow Time Graph Ordering.
WG 2003: 23-33 |
2002 |
10 | | Claudio Arbib,
Michele Flammini:
On the upper chromatic number of (v3, b2)-configurations.
Discrete Applied Mathematics 120(1-3): 3-12 (2002) |
9 | EE | Claudio Arbib,
Raffaele Mosca:
On (P5, diamond)-free graphs.
Discrete Mathematics 250(1-3): 1-22 (2002) |
8 | EE | Claudio Arbib,
Alberto Caprara:
On the stability number of the edge intersection of two graphs.
Inf. Process. Lett. 83(3): 173-174 (2002) |
2000 |
7 | EE | Claudio Arbib,
Michele Flammini,
Enrico Nardelli:
How to Survive While Visiting a Graph.
Discrete Applied Mathematics 99(1-3): 279-293 (2000) |
1999 |
6 | EE | Claudio Arbib,
Dario Pacciarelli,
Stefano Smriglio:
A Three-dimensional Matching Model for Perishable Production Scheduling.
Discrete Applied Mathematics 92(1): 1-15 (1999) |
5 | EE | Claudio Arbib:
A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs.
Electronic Notes in Discrete Mathematics 3: 2-6 (1999) |
1990 |
4 | | Claudio Arbib:
Two Polynomial Problems in PLA Folding.
WG 1990: 119-129 |
1988 |
3 | | Claudio Arbib,
Giuseppe F. Italiano,
Alessandro Panconesi:
Predicting deadlock in Store-and-Forward Networks.
FSTTCS 1988: 123-142 |
2 | | Claudio Arbib:
A Polynomial Characterization of Some Graph Partitioning Problems.
Inf. Process. Lett. 26(5): 223-230 (1988) |
1986 |
1 | | Claudio Arbib,
Gianna Cioni:
Meta-Reasoning and Data Structuring for Improving PROLOG Programming Style.
AIMSA 1986: 55-61 |