Claudio Arbib

Orcid: 0000-0002-0866-3795

Affiliations:
  • University of L'Aquila, Italy


According to our database1, Claudio Arbib authored at least 48 papers between 1986 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
One-dimensional stock cutting resilient against singular random defects.
Comput. Oper. Res., September, 2023

2022
Assortment and Cut of Defective Stocks by Bilevel Programming.
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.
Eur. J. Oper. Res., 2021

Toward Effective Response to Natural Disasters: A Data Science Approach.
IEEE Access, 2021

A Dynamic Dial-a-ride Model for Optimal Vehicle Routing in a Wafer Fab.
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021

A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout.
Proceedings of the Operations Research and Enterprise Systems, 2021

Definition of an Enriched GIS Network for Evacuation Planning.
Proceedings of the 7th International Conference on Geographical Information Systems Theory, 2021

2020
Competitive location and pricing on a line with metric transportation costs.
Eur. J. Oper. Res., 2020

Codon optimization by 0-1 linear programming.
Comput. Oper. Res., 2020

2019
On envy-free perfect matching.
Discret. Appl. Math., 2019

Real-time Emergency Response through Performant IoT Architectures.
Proceedings of the 16th International Conference on Information Systems for Crisis Response and Management, 2019

An IoT Software Architecture for an Evacuable Building Architecture.
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.
Proceedings of the GEOSAFE Workshop on Robust Solutions for Fire Fighting, 2018

A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting Problem.
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.
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.
Int. Trans. Oper. Res., 2016

Optimum Solution of the Closest String Problem via Rank Distance.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2014
Sorting common operations to minimize the number of tardy jobs.
Networks, 2014

The directed profitable location Rural Postman Problem.
Eur. J. Oper. Res., 2014

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

On LP relaxations for the pattern minimization problem.
Networks, 2011

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

Sorting Common Operations to Minimize Tardy Jobs.
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.
INFORMS J. Comput., 2009

A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Recent contributions of OR to network optimization.
Eur. J. Oper. Res., 2008

A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs.
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.
Eur. J. Oper. Res., 2007

Annals of OR - Special volume in memory of Mario Lucertini.
Ann. Oper. Res., 2007

2005
Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application.
Eur. J. Oper. Res., 2005

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

2003
Minimum Flow Time Graph Ordering.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2002
On the stability number of the edge intersection of two graphs.
Inf. Process. Lett., 2002

Cutting and Reuse: An Application from Automobile Component Manufacturing.
Oper. Res., 2002

On (<i>P</i><sub>5</sub>, diamond)-free graphs.
Discret. Math., 2002

On the upper chromatic number of (v<sub>3</sub>, b<sub>2</sub>)-configurations.
Discret. Appl. Math., 2002

2000
An optimization problem arising in the design of multiring systems.
Eur. J. Oper. Res., 2000

How to Survive While Visiting a Graph.
Discret. Appl. Math., 2000

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

A Three-dimensional Matching Model for Perishable Production Scheduling.
Discret. Appl. Math., 1999

1997
Concurrent operations assignment and sequencing for particular assembly problems in flow lines.
Ann. Oper. Res., 1997

1995
Task assignment and subassembly scheduling in flexible assembly lines.
IEEE Trans. Robotics Autom., 1995

1992
Task assignment in pipeline assembly systems.
Proceedings of the 1992 IEEE International Conference on Robotics and Automation, 1992

1990
Part routing in flexible assembly systems.
IEEE Trans. Robotics Autom., 1990

Predicting deadlock in store-and-forward networks.
Networks, 1990

Two Polynomial Problems in PLA Folding.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

1988
A Polynomial Characterization of Some Graph Partitioning Problems.
Inf. Process. Lett., 1988

1986
Meta-Reasoning and Data Structuring for Improving PROLOG Programming Style.
Proceedings of the Artificial Intelligence II: Methodology, Systems, Applications, 1986


  Loading...