Claudio Arbib - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 50 from 50

2024

An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript IndicatorsClaudio Arbib, Andrea D'Ascenzo, Fabrizio Rossi, Daniele Santoni. jcb, 31(5):416-428, 2024. [doi]

2023

One-dimensional stock cutting resilient against singular random defectsClaudio Arbib, Fabrizio Marinelli 0001, Ulrich Pferschy, Fatemeh K. Ranjbar. cor, 157:106280, September 2023. [doi]

2022

Assortment and Cut of Defective Stocks by Bilevel ProgrammingClaudio Arbib, Fabrizio Marinelli 0001, Mustafa Ç. Pinar, Andrea Pizzuti. icores 2022: 294-301 [doi]

2021

A Dynamic Dial-a-ride Model for Optimal Vehicle Routing in a Wafer FabClaudio Arbib, Fatemeh K. Ranjbar, Stefano Smriglio. icores 2021: 281-286

A MIP-Based Heuristic for Pickup and Delivery on Rectilinear LayoutClaudio Arbib, Andrea Pizzuti, Fatemeh K. Ranjbar, Stefano Smriglio. icores 2022: 211-226 [doi]

Number of bins and maximum lateness minimization in two-dimensional bin packingClaudio Arbib, Fabrizio Marinelli 0001, Andrea Pizzuti. eor, 291(1):101-113, 2021. [doi]

Definition of an Enriched GIS Network for Evacuation PlanningEvans Etrue Howard, Lorenza Pasquini, Claudio Arbib, Antinisca Di Marco, Eliseo Clementini. gistam 2021: 241-252 [doi]

Toward Effective Response to Natural Disasters: A Data Science ApproachGhulam Mudassir, Evans Etrue Howard, Lorenza Pasquini, Claudio Arbib, Eliseo Clementini, Antinisca Di Marco, Giovanni Stilo. access, 9:167827-167844, 2021. [doi]

2020

Codon optimization by 0-1 linear programmingClaudio Arbib, Mustafa Ç. Pinar, Fabrizio Rossi, Alessandra Tessitore. cor, 119:104932, 2020. [doi]

Competitive location and pricing on a line with metric transportation costsClaudio Arbib, Mustafa Ç. Pinar, Matteo Tonelli. eor, 282(1):188-200, 2020. [doi]

2019

2018

A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting ProblemClaudio Arbib, Fabrizio Marinelli 0001, Andrea Pizzuti, Roberto Rosetti. icores 2018: 31-37 [doi]

Applying a network flow model to quick and safe evacuation of people from a building: a real caseClaudio Arbib, Henry Muccini, Mahyar Tourchi Moghaddam. rsff 2018: 50-61 [doi]

2017

An improved integer linear programming formulation for the closest 0-1 string problemClaudio Arbib, Mara Servilio, Paolo Ventura. cor, 80:94-100, 2017. [doi]

2016

Optimum Solution of the Closest String Problem via Rank DistanceClaudio Arbib, Giovanni Felici, Mara Servilio, Paolo Ventura. iscopt 2016: 297-307 [doi]

One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming modelClaudio Arbib, Fabrizio Marinelli, Paolo Ventura. itor, 23(1-2):47-63, 2016. [doi]

2014

Sorting common operations to minimize the number of tardy jobsClaudio Arbib, Mara Servilio, Giovanni Felici, Mara Servilio. networks, 64(4):306-320, 2014. [doi]

The directed profitable location Rural Postman ProblemClaudio Arbib, Mara Servilio, Claudia Archetti, Maria Grazia Speranza. eor, 236(3):811-819, 2014. [doi]

2011

2009

A Lower Bound for the Cutting Stock Problem with a Limited Number of Open StacksClaudio Arbib, Fabrizio Marinelli, Carlo M. Scoppola. colognetwente 2009: 75-78 [doi]

Exact and Asymptotically Exact Solutions for a Class of Assortment ProblemsClaudio Arbib, Fabrizio Marinelli. informs, 21(1):13-25, 2009. [doi]

2008

A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup CostsAlessandro Aloisio, Claudio Arbib, Fabrizio Marinelli. colognetwente 2008: 181-183

Recent contributions of OR to network optimizationClaudio Arbib, Giovanni Felici. eor, 189(3):1343-1344, 2008. [doi]

2007

An optimization model for trim loss minimization in an automotive glass plantClaudio Arbib, Fabrizio Marinelli. eor, 183(3):1421-1432, 2007. [doi]

Annals of OR - Special volume in memory of Mario LucertiniClaudio Arbib, Fabrizio Rossi, Stefano Smriglio. anor, 150(1):1, 2007. [doi]

2005

Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its applicationClaudio Arbib, Fabrizio Marinelli. eor, 163(3):617-630, 2005. [doi]

2004

A competitive scheduling problem and its relevance to UMTS channel assignmentClaudio Arbib, Stefano Smriglio, Mara Servilio. networks, 44(2):132-141, 2004. [doi]

2003

Minimum Flow Time Graph OrderingClaudio Arbib, Michele Flammini, Fabrizio Marinelli. criwg 2003: 23-33 [doi]

2002

On the stability number of the edge intersection of two graphsClaudio Arbib, Alberto Caprara. ipl, 83(3):173-174, 2002. [doi]

On (::::P::::::5::, diamond)-free graphsClaudio Arbib, Raffaele Mosca. DM, 250(1-3):1-22, 2002. [doi]

Cutting and Reuse: An Application from Automobile Component ManufacturingClaudio Arbib, Fabrizio Marinelli, Fabrizio Rossi, Francesco Di Iorio. ior, 50(6):923-934, 2002. [doi]

On the upper chromatic number of (v::3::, b::2::)-configurationsClaudio Arbib, Michele Flammini. DAM, 120(1-3):3-12, 2002.

2000

An optimization problem arising in the design of multiring systemsClaudio Arbib, Fabrizio Rossi. eor, 124(1):63-76, 2000. [doi]

How to Survive While Visiting a GraphClaudio Arbib, Michele Flammini, Enrico Nardelli. DAM, 99(1-3):279-293, 2000. [doi]

1999

A Primal-Dual Property of the Upper Chromatic Number of Mixed HypergraphsClaudio Arbib. endm, 3:2-6, 1999. [doi]

A Three-dimensional Matching Model for Perishable Production SchedulingClaudio Arbib, Dario Pacciarelli, Stefano Smriglio. DAM, 92(1):1-15, 1999. [doi]

1997

Concurrent operations assignment and sequencing for particular assembly problems in flow linesAlessandro Agnetis, Claudio Arbib. anor, 69:1-31, 1997. [doi]

1995

Task assignment and subassembly scheduling in flexible assembly linesAlessandro Agnetis, Fernardo Nicolò, Claudio Arbib, Mario Lucertini. trob, 11(1):1-20, 1995. [doi]

1992

Task assignment in pipeline assembly systemsAlessandro Agnetis, Fernando Nicolò, Claudio Arbib, Mario Lucertini. icra 1992: 1133-1138 [doi]

1990

Part routing in flexible assembly systemsAlessandro Agnetis, Claudio Arbib, Mario Lucertini, Fernardo Nicolò. trob, 6(6):697-705, 1990. [doi]

Two Polynomial Problems in PLA FoldingClaudio Arbib. criwg 1991: 119-129

Predicting deadlock in store-and-forward networksClaudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi. networks, 20(7):861-881, 1990. [doi]

1988

A Polynomial Characterization of Some Graph Partitioning ProblemsClaudio Arbib. ipl, 26(5):223-230, 1988.

Predicting deadlock in Store-and-Forward NetworksClaudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi. fsttcs 1988: 123-142

1986

Meta-Reasoning and Data Structuring for Improving PROLOG Programming StyleClaudio Arbib, Gianna Cioni. aimsa 1986: 55-61

Sign in or sign up to see more results.

runs on WebDSL