Claudio Arbib

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 18

Top Topics

Number Of Tardy Jobs

Natural Disasters

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

J. Comput. Biol.

Publications

Claudio Arbib, Andrea D'Ascenzo, Fabrizio Rossi, Daniele Santoni
An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators. J. Comput. Biol. 31 (5) (2024)
Claudio Arbib, Fabrizio Marinelli, Ulrich Pferschy, Fatemeh K. Ranjbar
One-dimensional stock cutting resilient against singular random defects. Comput. Oper. Res. 157 (2023)
Claudio Arbib, Fabrizio Marinelli, Mustafa Ç. Pinar, Andrea Pizzuti
Assortment and Cut of Defective Stocks by Bilevel Programming. ICORES (2022)
Evans Etrue Howard, Lorenza Pasquini, Claudio Arbib, Antinisca Di Marco, Eliseo Clementini
Definition of an Enriched GIS Network for Evacuation Planning. GISTAM (2021)
Claudio Arbib, Andrea Pizzuti, Fatemeh K. Ranjbar, Stefano Smriglio
A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout. ICORES (Selected Papers) (2021)
Claudio Arbib, Fatemeh K. Ranjbar, Stefano Smriglio
A Dynamic Dial-a-ride Model for Optimal Vehicle Routing in a Wafer Fab. ICORES (2021)
Claudio Arbib, Fabrizio Marinelli, Andrea Pizzuti
Number of bins and maximum lateness minimization in two-dimensional bin packing. Eur. J. Oper. Res. 291 (1) (2021)
Ghulam Mudassir, Evans Etrue Howard, Lorenza Pasquini, Claudio Arbib, Eliseo Clementini, Antinisca Di Marco, Giovanni Stilo
Toward Effective Response to Natural Disasters: A Data Science Approach. IEEE Access 9 (2021)
Claudio Arbib, Mustafa Ç. Pinar, Fabrizio Rossi, Alessandra Tessitore
Codon optimization by 0-1 linear programming. Comput. Oper. Res. 119 (2020)
Claudio Arbib, Mustafa Ç. Pinar, Matteo Tonelli
Competitive location and pricing on a line with metric transportation costs. Eur. J. Oper. Res. 282 (1) (2020)
Claudio Arbib, Oya Ekin Karasan, Mustafa Ç. Pinar
On envy-free perfect matching. Discret. Appl. Math. 261 (2019)
Claudio Arbib, Davide Arcelli, Julie Dugdale, Mahyar Tourchi Moghaddam, Henry Muccini
Real-time Emergency Response through Performant IoT Architectures. ISCRAM (2019)
Henry Muccini, Claudio Arbib, Paul Davidsson, Mahyar Tourchi Moghaddam
An IoT Software Architecture for an Evacuable Building Architecture. HICSS (2019)
Claudio Arbib, Fabrizio Marinelli, Andrea Pizzuti, Roberto Rosetti
A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting Problem. ICORES (2018)
Claudio Arbib, Henry Muccini, Mahyar Tourchi Moghaddam
Applying a network flow model to quick and safe evacuation of people from a building: a real case. RSFF (2018)
Claudio Arbib, Mara Servilio, Paolo Ventura
An improved integer linear programming formulation for the closest 0-1 string problem. Comput. Oper. Res. 80 (2017)
Claudio Arbib, Fabrizio Marinelli, Paolo Ventura
One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model. Int. Trans. Oper. Res. 23 (1-2) (2016)
Claudio Arbib, Giovanni Felici, Mara Servilio, Paolo Ventura
Optimum Solution of the Closest String Problem via Rank Distance. ISCO (2016)
Claudio Arbib, Giovanni Felici, Mara Servilio
Sorting common operations to minimize the number of tardy jobs. Networks 64 (4) (2014)
Claudio Arbib, Mara Servilio, Claudia Archetti, Maria Grazia Speranza
The directed profitable location Rural Postman Problem. Eur. J. Oper. Res. 236 (3) (2014)
Claudio Arbib, Giovanni Felici, Mara Servilio
Sorting Common Operations to Minimize Tardy Jobs. CTW (2011)
Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli
On LP relaxations for the pattern minimization problem. Networks 57 (3) (2011)
Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli
Cutting stock with no three parts per pattern: Work-in-process and pattern minimization. Discret. Optim. 8 (2) (2011)
Claudio Arbib, Martine Labbé, Mara Servilio
Scheduling two chains of unit jobs on one machine: A polyhedral study. Networks 58 (2) (2011)
Claudio Arbib, Fabrizio Marinelli
Exact and Asymptotically Exact Solutions for a Class of Assortment Problems. INFORMS J. Comput. 21 (1) (2009)
Claudio Arbib, Fabrizio Marinelli, Carlo M. Scoppola
A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks. CTW (2009)
Claudio Arbib, Giovanni Felici
Recent contributions of OR to network optimization. Eur. J. Oper. Res. 189 (3) (2008)
Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli
A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs. CTW (2008)
Claudio Arbib, Fabrizio Rossi, Stefano Smriglio
Annals of OR - Special volume in memory of Mario Lucertini. Ann. Oper. Res. 150 (1) (2007)
Claudio Arbib, Fabrizio Marinelli
An optimization model for trim loss minimization in an automotive glass plant. Eur. J. Oper. Res. 183 (3) (2007)
Claudio Arbib, Fabrizio Marinelli
Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application. Eur. J. Oper. Res. 163 (3) (2005)
Claudio Arbib, Stefano Smriglio, Mara Servilio
A competitive scheduling problem and its relevance to UMTS channel assignment. Networks 44 (2) (2004)
Claudio Arbib, Michele Flammini, Fabrizio Marinelli
Minimum Flow Time Graph Ordering. WG (2003)
Claudio Arbib, Alberto Caprara
On the stability number of the edge intersection of two graphs. Inf. Process. Lett. 83 (3) (2002)
Claudio Arbib, Raffaele Mosca
, diamond)-free graphs. Discret. Math. 250 (1-3) (2002)
Claudio Arbib, Fabrizio Marinelli, Fabrizio Rossi, Francesco Di Iorio
Cutting and Reuse: An Application from Automobile Component Manufacturing. Oper. Res. 50 (6) (2002)
Claudio Arbib, Michele Flammini
)-configurations. Discret. Appl. Math. 120 (1-3) (2002)
Claudio Arbib, Fabrizio Rossi
An optimization problem arising in the design of multiring systems. Eur. J. Oper. Res. 124 (1) (2000)
Claudio Arbib, Michele Flammini, Enrico Nardelli
How to Survive While Visiting a Graph. Discret. Appl. Math. 99 (1-3) (2000)
Claudio Arbib
A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs. Electron. Notes Discret. Math. 3 (1999)
Claudio Arbib, Dario Pacciarelli, Stefano Smriglio
A Three-dimensional Matching Model for Perishable Production Scheduling. Discret. Appl. Math. 92 (1) (1999)
Alessandro Agnetis, Claudio Arbib
Concurrent operations assignment and sequencing for particular assembly problems in flow lines. Ann. Oper. Res. 69 (1997)
Alessandro Agnetis, Fernando Nicolò, Claudio Arbib, Mario Lucertini
Task assignment and subassembly scheduling in flexible assembly lines. IEEE Trans. Robotics Autom. 11 (1) (1995)
Alessandro Agnetis, Fernando Nicolò, Claudio Arbib, Mario Lucertini
Task assignment in pipeline assembly systems. ICRA (1992)
Alessandro Agnetis, Claudio Arbib, Mario Lucertini, Fernando Nicolò
Part routing in flexible assembly systems. IEEE Trans. Robotics Autom. 6 (6) (1990)
Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi
Predicting deadlock in store-and-forward networks. Networks 20 (7) (1990)
Claudio Arbib
Two Polynomial Problems in PLA Folding. WG (1990)
Claudio Arbib
A Polynomial Characterization of Some Graph Partitioning Problems. Inf. Process. Lett. 26 (5) (1988)
Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi
Predicting deadlock in Store-and-Forward Networks. FSTTCS (1988)
Claudio Arbib, Gianna Cioni
Meta-Reasoning and Data Structuring for Improving PROLOG Programming Style. AIMSA (1986)