 | 2011 |
|---|
| 25 |       | Claudio Arbib,
Giovanni Felici,
Mara Servilio:
Sorting Common Operations to Minimize Tardy Jobs.
CTW 2011: 56-59 |
| 24 | | Alessandro Aloisio,
Claudio Arbib,
Fabrizio Marinelli:
Cutting stock with no three parts per pattern: Work-in-process and pattern minimization.
Discrete Optimization 8(2): 315-332 (2011) |
| 23 | | Alessandro Aloisio,
Claudio Arbib,
Fabrizio Marinelli:
On LP relaxations for the pattern minimization problem.
Networks 57(3): 247-253 (2011) |
| 22 | | Claudio Arbib,
Martine Labbé,
Mara Servilio:
Scheduling two chains of unit jobs on one machine: A polyhedral study.
Networks 58(2): 103-113 (2011) |
| 2009 |
|---|
| 21 | | Claudio Arbib,
Fabrizio Marinelli,
Carlo M. Scoppola:
A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks.
CTW 2009: 75-78 |
| 20 | | Claudio Arbib,
Fabrizio Marinelli:
Exact and Asymptotically Exact Solutions for a Class of Assortment Problems.
INFORMS Journal on Computing 21(1): 13-25 (2009) |
| 2008 |
|---|
| 19 |  | Alessandro Aloisio,
Claudio Arbib,
Fabrizio Marinelli:
A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs.
CTW 2008: 181-183 |
| 18 | | Claudio Arbib,
Giovanni Felici:
Recent contributions of OR to network optimization.
European Journal of Operational Research 189(3): 1343-1344 (2008) |
| 2007 |
|---|
| 17 | | Claudio Arbib,
Fabrizio Rossi,
Stefano Smriglio:
Annals of OR - Special volume in memory of Mario Lucertini.
Annals OR 150(1): 1 (2007) |
| 16 | | 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 |
|---|
| 15 | | 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 |
|---|
| 14 | | Claudio Arbib,
Stefano Smriglio,
Mara Servilio:
A competitive scheduling problem and its relevance to UMTS channel assignment.
Networks 44(2): 132-141 (2004) |
| 2003 |
|---|
| 13 | | Claudio Arbib,
Michele Flammini,
Fabrizio Marinelli:
Minimum Flow Time Graph Ordering.
WG 2003: 23-33 |
| 2002 |
|---|
| 12 | | Claudio Arbib,
Michele Flammini:
On the upper chromatic number of (v3, b2)-configurations.
Discrete Applied Mathematics 120(1-3): 3-12 (2002) |
| 11 | | Claudio Arbib,
Raffaele Mosca:
On (P5, diamond)-free graphs.
Discrete Mathematics 250(1-3): 1-22 (2002) |
| 10 | | Claudio Arbib,
Alberto Caprara:
On the stability number of the edge intersection of two graphs.
Inf. Process. Lett. 83(3): 173-174 (2002) |
| 9 | | Claudio Arbib,
Fabrizio Marinelli,
Fabrizio Rossi,
Francesco Di Iorio:
Cutting and Reuse: An Application from Automobile Component Manufacturing.
Operations Research 50(6): 923-934 (2002) |
| 2000 |
|---|
| 8 | | Claudio Arbib,
Michele Flammini,
Enrico Nardelli:
How to Survive While Visiting a Graph.
Discrete Applied Mathematics 99(1-3): 279-293 (2000) |
| 7 | | Claudio Arbib,
Fabrizio Rossi:
An optimization problem arising in the design of multiring systems.
European Journal of Operational Research 124(1): 63-76 (2000) |
| 1999 |
|---|
| 6 | | Claudio Arbib,
Dario Pacciarelli,
Stefano Smriglio:
A Three-dimensional Matching Model for Perishable Production Scheduling.
Discrete Applied Mathematics 92(1): 1-15 (1999) |
| 5 | | 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page