Claudio Arbib

According to our database, Claudio Arbib authored at least 49 papers between 1986 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators.

Claudio Arbib, Andrea D'Ascenzo, Fabrizio Rossi, Daniele Santoni

J. Comput. Biol., 2024

2023

One-dimensional stock cutting resilient against singular random defects.

Claudio Arbib, Fabrizio Marinelli, Ulrich Pferschy, Fatemeh K. Ranjbar

Comput. Oper. Res., September, 2023

2022

Assortment and Cut of Defective Stocks by Bilevel Programming.

Claudio Arbib, Fabrizio Marinelli, Mustafa Ç. Pinar, Andrea Pizzuti

Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

2021

Number of bins and maximum lateness minimization in two-dimensional bin packing.

Claudio Arbib, Fabrizio Marinelli, Andrea Pizzuti

Eur. J. Oper. Res., 2021

Toward Effective Response to Natural Disasters: A Data Science Approach.

Ghulam Mudassir, Evans Etrue Howard, Lorenza Pasquini, Claudio Arbib, Eliseo Clementini, Antinisca Di Marco, Giovanni Stilo

IEEE Access, 2021

A Dynamic Dial-a-ride Model for Optimal Vehicle Routing in a Wafer Fab.

Claudio Arbib, Fatemeh K. Ranjbar, Stefano Smriglio

Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021

A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout.

Claudio Arbib, Andrea Pizzuti, Fatemeh K. Ranjbar, Stefano Smriglio

Proceedings of the Operations Research and Enterprise Systems, 2021

Definition of an Enriched GIS Network for Evacuation Planning.

Evans Etrue Howard, Lorenza Pasquini, Claudio Arbib, Antinisca Di Marco, Eliseo Clementini

Proceedings of the 7th International Conference on Geographical Information Systems Theory, 2021

2020

Competitive location and pricing on a line with metric transportation costs.

Claudio Arbib, Mustafa Ç. Pinar, Matteo Tonelli

Eur. J. Oper. Res., 2020

Codon optimization by 0-1 linear programming.

Claudio Arbib, Mustafa Ç. Pinar, Fabrizio Rossi, Alessandra Tessitore

Comput. Oper. Res., 2020

2019

On envy-free perfect matching.

Claudio Arbib, Oya Ekin Karasan, Mustafa Ç. Pinar

Discret. Appl. Math., 2019

Real-time Emergency Response through Performant IoT Architectures.

Claudio Arbib, Davide Arcelli, Julie Dugdale, Mahyar Tourchi Moghaddam, Henry Muccini

Proceedings of the 16th International Conference on Information Systems for Crisis Response and Management, 2019

An IoT Software Architecture for an Evacuable Building Architecture.

Henry Muccini, Claudio Arbib, Paul Davidsson, Mahyar Tourchi Moghaddam

Proceedings of the 52nd Hawaii International Conference on System Sciences, 2019

2018

Applying a network flow model to quick and safe evacuation of people from a building: a real case.

Claudio Arbib, Henry Muccini, Mahyar Tourchi Moghaddam

Proceedings of the GEOSAFE Workshop on Robust Solutions for Fire Fighting, 2018

A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting Problem.

Claudio Arbib, Fabrizio Marinelli, Andrea Pizzuti, Roberto Rosetti

Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, 2018

2017

An improved integer linear programming formulation for the closest 0-1 string problem.

Claudio Arbib, Mara Servilio, Paolo Ventura

Comput. Oper. Res., 2017

2016

One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model.

Claudio Arbib, Fabrizio Marinelli, Paolo Ventura

Int. Trans. Oper. Res., 2016

Optimum Solution of the Closest String Problem via Rank Distance.

Claudio Arbib, Giovanni Felici, Mara Servilio, Paolo Ventura

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2014

Sorting common operations to minimize the number of tardy jobs.

Claudio Arbib, Giovanni Felici, Mara Servilio

Networks, 2014

The directed profitable location Rural Postman Problem.

Claudio Arbib, Mara Servilio, Claudia Archetti, Maria Grazia Speranza

Eur. J. Oper. Res., 2014

2011

Scheduling two chains of unit jobs on one machine: A polyhedral study.

Claudio Arbib, Martine Labbé, Mara Servilio

Networks, 2011

On LP relaxations for the pattern minimization problem.

Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli

Networks, 2011

Cutting stock with no three parts per pattern: Work-in-process and pattern minimization.

Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli

Discret. Optim., 2011

Sorting Common Operations to Minimize Tardy Jobs.

Claudio Arbib, Giovanni Felici, Mara Servilio

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2009

Exact and Asymptotically Exact Solutions for a Class of Assortment Problems.

Claudio Arbib, Fabrizio Marinelli

INFORMS J. Comput., 2009

A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks.

Claudio Arbib, Fabrizio Marinelli, Carlo M. Scoppola

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Recent contributions of OR to network optimization.

Claudio Arbib, Giovanni Felici

Eur. J. Oper. Res., 2008

A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs.

Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

An optimization model for trim loss minimization in an automotive glass plant.

Claudio Arbib, Fabrizio Marinelli

Eur. J. Oper. Res., 2007

Annals of OR - Special volume in memory of Mario Lucertini.

Claudio Arbib, Fabrizio Rossi, Stefano Smriglio

Ann. Oper. Res., 2007

2005

Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application.

Claudio Arbib, Fabrizio Marinelli

Eur. J. Oper. Res., 2005

2004

A competitive scheduling problem and its relevance to UMTS channel assignment.

Claudio Arbib, Stefano Smriglio, Mara Servilio

Networks, 2004

2003

Minimum Flow Time Graph Ordering.

Claudio Arbib, Michele Flammini, Fabrizio Marinelli

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2002

On the stability number of the edge intersection of two graphs.

Claudio Arbib, Alberto Caprara

Inf. Process. Lett., 2002

Cutting and Reuse: An Application from Automobile Component Manufacturing.

Claudio Arbib, Fabrizio Marinelli, Fabrizio Rossi, Francesco Di Iorio

Oper. Res., 2002

On (<i>P</i>₅, diamond)-free graphs.

Claudio Arbib, Raffaele Mosca

Discret. Math., 2002

On the upper chromatic number of (v₃, b₂)-configurations.

Claudio Arbib, Michele Flammini

Discret. Appl. Math., 2002

2000

An optimization problem arising in the design of multiring systems.

Claudio Arbib, Fabrizio Rossi

Eur. J. Oper. Res., 2000

How to Survive While Visiting a Graph.

Claudio Arbib, Michele Flammini, Enrico Nardelli

Discret. Appl. Math., 2000

1999

A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs.

Claudio Arbib

Electron. Notes Discret. Math., 1999

A Three-dimensional Matching Model for Perishable Production Scheduling.

Claudio Arbib, Dario Pacciarelli, Stefano Smriglio

Discret. Appl. Math., 1999

1997

Concurrent operations assignment and sequencing for particular assembly problems in flow lines.

Alessandro Agnetis, Claudio Arbib

Ann. Oper. Res., 1997

1995

Task assignment and subassembly scheduling in flexible assembly lines.

Alessandro Agnetis, Fernando Nicolò, Claudio Arbib, Mario Lucertini

IEEE Trans. Robotics Autom., 1995

1992

Task assignment in pipeline assembly systems.

Alessandro Agnetis, Fernando Nicolò, Claudio Arbib, Mario Lucertini

Proceedings of the 1992 IEEE International Conference on Robotics and Automation, 1992

1990

Part routing in flexible assembly systems.

Alessandro Agnetis, Claudio Arbib, Mario Lucertini, Fernando Nicolò

IEEE Trans. Robotics Autom., 1990

Two Polynomial Problems in PLA Folding.

Claudio Arbib

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

1988

A Polynomial Characterization of Some Graph Partitioning Problems.

Claudio Arbib

Inf. Process. Lett., 1988

Predicting deadlock in Store-and-Forward Networks.

Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

1986

Meta-Reasoning and Data Structuring for Improving PROLOG Programming Style.

Claudio Arbib, Gianna Cioni

Proceedings of the Artificial Intelligence II: Methodology, Systems, Applications, 1986