Meta-Reasoning and Data Structuring for Improving PROLOG Programming Style. - Claudio Arbib; Gianna Cioni (AIMSA, 1986)

A Polynomial Characterization of Some Graph Partitioning Problems. - Claudio Arbib (Inf. Process. Lett., 1988)

Two Polynomial Problems in PLA Folding. - Claudio Arbib (WG, 1990)

Predicting deadlock in store-and-forward networks. - Claudio Arbib; Giuseppe F. Italiano; Alessandro Panconesi (Networks, 1990)

Part routing in flexible assembly systems. - Alessandro Agnetis; Claudio Arbib; Mario Lucertini; Fernando Nicolò (IEEE Trans. Robotics Autom., 1990)

Task assignment in pipeline assembly systems. - Alessandro Agnetis; Fernando Nicolò; Claudio Arbib; Mario Lucertini (ICRA, 1992)

Task assignment and subassembly scheduling in flexible assembly lines. - Alessandro Agnetis; Fernando Nicolò; Claudio Arbib; Mario Lucertini (IEEE Trans. Robotics Autom., 1995)

Concurrent operations assignment and sequencing for particular assembly problems in flow lines. - Alessandro Agnetis; Claudio Arbib (Ann. Oper. Res., 1997)

A Three-dimensional Matching Model for Perishable Production Scheduling. - Claudio Arbib; Dario Pacciarelli; Stefano Smriglio (Discret. Appl. Math., 1999)

A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs. - Claudio Arbib (Electron. Notes Discret. Math., 1999)

How to Survive While Visiting a Graph. - Claudio Arbib; Michele Flammini; Enrico Nardelli (Discret. Appl. Math., 2000)

An optimization problem arising in the design of multiring systems. - Claudio Arbib; Fabrizio Rossi (Eur. J. Oper. Res., 2000)

On the upper chromatic number of (v3, b2)-configurations. - Claudio Arbib; Michele Flammini (Discret. Appl. Math., 2002)

On (P5, diamond)-free graphs. - Claudio Arbib; Raffaele Mosca (Discret. Math., 2002)

Cutting and Reuse: An Application from Automobile Component Manufacturing. - Claudio Arbib; Fabrizio Marinelli 001; Fabrizio Rossi; Francesco Di Iorio (Oper. Res., 2002)

On the stability number of the edge intersection of two graphs. - Claudio Arbib; Alberto Caprara (Inf. Process. Lett., 2002)

Minimum Flow Time Graph Ordering. - Claudio Arbib; Michele Flammini; Fabrizio Marinelli 001 (WG, 2003)

A competitive scheduling problem and its relevance to UMTS channel assignment. - Claudio Arbib; Stefano Smriglio; Mara Servilio (Networks, 2004)

Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application. - Claudio Arbib; Fabrizio Marinelli 001 (Eur. J. Oper. Res., 2005)

Annals of OR - Special volume in memory of Mario Lucertini. - Claudio Arbib; Fabrizio Rossi; Stefano Smriglio (Ann. Oper. Res., 2007)

An optimization model for trim loss minimization in an automotive glass plant. - Claudio Arbib; Fabrizio Marinelli 001 (Eur. J. Oper. Res., 2007)

A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs. - Alessandro Aloisio; Claudio Arbib; Fabrizio Marinelli 001 (CTW, 2008)

Recent contributions of OR to network optimization. - Claudio Arbib; Giovanni Felici (Eur. J. Oper. Res., 2008)

A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks. - Claudio Arbib; Fabrizio Marinelli 001; Carlo M. Scoppola (CTW, 2009)

Exact and Asymptotically Exact Solutions for a Class of Assortment Problems. - Claudio Arbib; Fabrizio Marinelli 001 (INFORMS J. Comput., 2009)

Sorting Common Operations to Minimize Tardy Jobs. - Claudio Arbib; Giovanni Felici; Mara Servilio (CTW, 2011)

Cutting stock with no three parts per pattern: Work-in-process and pattern minimization. - Alessandro Aloisio; Claudio Arbib; Fabrizio Marinelli 001 (Discret. Optim., 2011)

On LP relaxations for the pattern minimization problem. - Alessandro Aloisio; Claudio Arbib; Fabrizio Marinelli 001 (Networks, 2011)

Scheduling two chains of unit jobs on one machine: A polyhedral study. - Claudio Arbib; Martine Labbé; Mara Servilio (Networks, 2011)

The directed profitable location Rural Postman Problem. - Claudio Arbib; Mara Servilio; Claudia Archetti; Maria Grazia Speranza (Eur. J. Oper. Res., 2014)

Sorting common operations to minimize the number of tardy jobs. - Claudio Arbib; Giovanni Felici; Mara Servilio (Networks, 2014)

Optimum Solution of the Closest String Problem via Rank Distance. - Claudio Arbib; Giovanni Felici; Mara Servilio; Paolo Ventura (ISCO, 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 001; Paolo Ventura (Int. Trans. Oper. Res., 2016)

An improved integer linear programming formulation for the closest 0-1 string problem. - Claudio Arbib; Mara Servilio; Paolo Ventura (Comput. Oper. Res., 2017)

A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting Problem. - Claudio Arbib; Fabrizio Marinelli 001; Andrea Pizzuti; Roberto Rosetti (ICORES, 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 (RSFF, 2018)

An IoT Software Architecture for an Evacuable Building Architecture. - Henry Muccini; Claudio Arbib; Paul Davidsson; Mahyar Tourchi Moghaddam (HICSS, 2019)

Real-time Emergency Response through Performant IoT Architectures. - Claudio Arbib; Davide Arcelli; Julie Dugdale; Mahyar Tourchi Moghaddam; Henry Muccini (ISCRAM, 2019)

On envy-free perfect matching. - Claudio Arbib; Oya Ekin Karasan; Mustafa Ç. Pinar (Discret. Appl. Math., 2019)

Codon optimization by 0-1 linear programming. - Claudio Arbib; Mustafa Ç. Pinar; Fabrizio Rossi; Alessandra Tessitore (Comput. Oper. Res., 2020)

Competitive location and pricing on a line with metric transportation costs. - Claudio Arbib; Mustafa Ç. Pinar; Matteo Tonelli (Eur. J. Oper. Res., 2020)

Definition of an Enriched GIS Network for Evacuation Planning. - Evans Etrue Howard; Lorenza Pasquini; Claudio Arbib; Antinisca Di Marco; Eliseo Clementini (GISTAM, 2021)

A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout. - Claudio Arbib; Andrea Pizzuti; Fatemeh K. Ranjbar; Stefano Smriglio (ICORES (Selected Papers), 2021)

A Dynamic Dial-a-ride Model for Optimal Vehicle Routing in a Wafer Fab. - Claudio Arbib; Fatemeh K. Ranjbar; Stefano Smriglio (ICORES, 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)

Number of bins and maximum lateness minimization in two-dimensional bin packing. - Claudio Arbib; Fabrizio Marinelli 001; Andrea Pizzuti (Eur. J. Oper. Res., 2021)

Assortment and Cut of Defective Stocks by Bilevel Programming. - Claudio Arbib; Fabrizio Marinelli 001; Mustafa Ç. Pinar; Andrea Pizzuti (ICORES, 2022)

One-dimensional stock cutting resilient against singular random defects. - Claudio Arbib; Fabrizio Marinelli 001; Ulrich Pferschy; Fatemeh K. Ranjbar (Comput. Oper. Res., 2023)

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)