All Stories

  1. An efficient way to design a protein

    Article • Computers & Operations Research, July 2020, Elsevier

    Claudio Arbib

  2. Almost always observable hybrid systems

    Article • Nonlinear Analysis Hybrid Systems, May 2020, Elsevier

    Claudio Arbib

  3. Pricing and locating economic activities in a competitive environment, and maximize profit

    Article • European Journal of Operational Research, August 2019, Elsevier

    Claudio Arbib

  4. On fair allocations of items to potential buyers

    Article • Discrete Applied Mathematics, May 2019, Elsevier

    Claudio Arbib

  5. Common operation scheduling with general processing times: A branch-and-cut algorithm to minimize the weighted number of tardy jobs

    Article • Omega, April 2019, Elsevier

    Claudio Arbib

  6. IoT Flows: A Network Flow Model Application to Building Evacuation

    Article • January 2019, Springer Science + Business Media

    Claudio Arbib

  7. An IoT Software Architecture for an Evacuable Building Architecture

    Article • January 2019, HICSS Conference Office

    Claudio Arbib

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

    Article • January 2018, Scitepress

    Claudio Arbib

  9. Packing things in the right order

    Article • Omega, April 2017, Elsevier

    Fabrizio Marinelli, Claudio Arbib

  10. How to quickly reach the "center" of many strings

    Article • Computers & Operations Research, April 2017, Elsevier

    Claudio Arbib

  11. Optimization Models for Cut Sequencing

    Article • January 2017, Springer Science + Business Media

    Claudio Arbib

  12. Optimum Solution of the Closest String Problem via Rank Distance

    Article • January 2016, Springer Science + Business Media

    Claudio Arbib

  13. How to rank single operations when they contribute to complete different tasks

    Article • Networks, November 2014, Wiley

    Claudio Arbib

  14. The directed profitable location Rural Postman Problem

    Article • European Journal of Operational Research, August 2014, Elsevier

    Claudio Arbib

  15. Cutting things in a convenient order

    Article • Omega, July 2014, Elsevier

    Fabrizio Marinelli, Claudio Arbib

  16. Real industrial cutting processes have finite buffer capacities...

    Article • International Journal of Production Economics, April 2012, Elsevier

    Fabrizio Marinelli, Claudio Arbib

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

    Article • Discrete Optimization, May 2011, Elsevier

    Fabrizio Marinelli, Claudio Arbib

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

    Article • Networks, January 2011, Wiley

    Claudio Arbib

  19. On minimizing cutting patterns to obtain small items from larger ones with a given trim loss

    Article • Networks, December 2010, Wiley

    Fabrizio Marinelli, Claudio Arbib

  20. Reducing trim loss while improving inventory management

    Article • INFORMS Journal on Computing, February 2009, INFORMS

    Fabrizio Marinelli, Claudio Arbib

  21. Recent contributions of OR to network optimization

    Article • European Journal of Operational Research, September 2008, Elsevier

    Claudio Arbib

  22. Stock and cut optimization in automotive glass manufacturing

    Article • European Journal of Operational Research, December 2007, Elsevier

    Fabrizio Marinelli, Claudio Arbib

  23. Annals of OR—Special volume in memory of Mario Lucertini

    Article • Annals of Operations Research, January 2007, Springer Science + Business Media

    Claudio Arbib

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

    Article • Networks, January 2004, Wiley

    Claudio Arbib

  25. The Lazy Cook Problem, or Scheduling Two Parallel Machines to Optimize Vehicle Utilization

    Article • International Journal of Flexible Manufacturing Systems, October 2003, Springer Science + Business Media

    Fabrizio Marinelli, Claudio Arbib

  26. Minimum Flow Time Graph Ordering

    Article • January 2003, Springer Science + Business Media

    Fabrizio Marinelli, Claudio Arbib

  27. Cutting and Reuse: An Application from Automobile Component Manufacturing

    Article • Operations Research, December 2002, INFORMS

    Fabrizio Marinelli, Claudio Arbib

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

    Article • Information Processing Letters, August 2002, Elsevier

    Claudio Arbib

  29. On the upper chromatic number of (v3,b2)-configurations

    Article • Discrete Applied Mathematics, August 2002, Elsevier

    Claudio Arbib

  30. On (P5, diamond)-free graphs

    Article • Discrete Mathematics, May 2002, Elsevier

    Claudio Arbib

  31. Optimal resource assignment through negotiation in a multi-agent manufacturing system

    Article • IIE Transactions, October 2000, Taylor & Francis

    Claudio Arbib

  32. An optimization problem arising in the design of multiring systems

    Article • European Journal of Operational Research, July 2000, Elsevier

    Claudio Arbib

  33. How to survive while visiting a graph

    Article • Discrete Applied Mathematics, February 2000, Elsevier

    Claudio Arbib

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

    Article • Electronic Notes in Discrete Mathematics, May 1999, Elsevier

    Claudio Arbib

  35. A three-dimensional matching model for perishable production scheduling

    Article • Discrete Applied Mathematics, March 1999, Elsevier

    Claudio Arbib

  36. THE LAZY COOK PROBLEM: SCHEDULING PARALLEL MACHINES TO OPTIMIZE VEHICLE UTILIZATION

    Article • January 1999, World Scientific Pub Co Pte Lt

    Fabrizio Marinelli, Claudio Arbib

  37. Workload balance and part-transfer minimization in flexible manufacturing systems

    Article • International Journal of Flexible Manufacturing Systems, February 1991, Springer Science + Business Media

    Claudio Arbib

  38. Two polynomial problems in PLA folding

    Article • January 1991, Springer Science + Business Media

    Claudio Arbib

  39. Predicting deadlock in store-and-forward networks

    Article • Networks, December 1990, Wiley

    Claudio Arbib

  40. A polynomial algorithm for partitioning line-graphs

    Article • January 1989, Springer Science + Business Media

    Claudio Arbib

  41. A polynomial characterization of some graph partitioning problems

    Article • Information Processing Letters, January 1988, Elsevier

    Claudio Arbib

  42. Predicting deadlock in store-and-forward networks

    Article • January 1988, Springer Science + Business Media

    Claudio Arbib

  43. Methodological aspects of ring network design

    Article • Springer Science + Business Media

    Claudio Arbib

  44. Tool loading problems in FMS and VLSI circuit layout problems

    Article • Springer Science + Business Media

    Claudio Arbib