default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaudio Arbib
Person information
- affiliation: University of L'Aquila, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Claudio Arbib, Andrea D'Ascenzo
, Fabrizio Rossi, Daniele Santoni:
An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators. J. Comput. Biol. 31(5): 416-428 (2024)- 2023
- [j32]Claudio Arbib, Fabrizio Marinelli, Ulrich Pferschy, Fatemeh K. Ranjbar:
One-dimensional stock cutting resilient against singular random defects. Comput. Oper. Res. 157: 106280 (2023) - 2022
- [c17]Claudio Arbib, Fabrizio Marinelli, Mustafa Ç. Pinar, Andrea Pizzuti:
Assortment and Cut of Defective Stocks by Bilevel Programming. ICORES 2022: 294-301 - 2021
- [j31]Ghulam Mudassir, Evans Etrue Howard, Lorenza Pasquini, Claudio Arbib, Eliseo Clementini, Antinisca Di Marco, Giovanni Stilo:
Toward Effective Response to Natural Disasters: A Data Science Approach. IEEE Access 9: 167827-167844 (2021) - [j30]Claudio Arbib, Fabrizio Marinelli, Andrea Pizzuti:
Number of bins and maximum lateness minimization in two-dimensional bin packing. Eur. J. Oper. Res. 291(1): 101-113 (2021) - [c16]Evans Etrue Howard, Lorenza Pasquini, Claudio Arbib, Antinisca Di Marco, Eliseo Clementini:
Definition of an Enriched GIS Network for Evacuation Planning. GISTAM 2021: 241-252 - [c15]Claudio Arbib, Andrea Pizzuti, Fatemeh K. Ranjbar, Stefano Smriglio:
A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout. ICORES (Selected Papers) 2021: 211-226 - [c14]Claudio Arbib, Fatemeh K. Ranjbar, Stefano Smriglio:
A Dynamic Dial-a-ride Model for Optimal Vehicle Routing in a Wafer Fab. ICORES 2021: 281-286 - 2020
- [j29]Claudio Arbib, Mustafa Ç. Pinar, Fabrizio Rossi, Alessandra Tessitore:
Codon optimization by 0-1 linear programming. Comput. Oper. Res. 119: 104932 (2020) - [j28]Claudio Arbib, Mustafa Ç. Pinar, Matteo Tonelli:
Competitive location and pricing on a line with metric transportation costs. Eur. J. Oper. Res. 282(1): 188-200 (2020)
2010 – 2019
- 2019
- [j27]Claudio Arbib, Oya Ekin Karasan, Mustafa Ç. Pinar:
On envy-free perfect matching. Discret. Appl. Math. 261: 22-27 (2019) - [c13]Henry Muccini, Claudio Arbib, Paul Davidsson, Mahyar Tourchi Moghaddam:
An IoT Software Architecture for an Evacuable Building Architecture. HICSS 2019: 1-10 - [c12]Claudio Arbib, Davide Arcelli, Julie Dugdale, Mahyar Tourchi Moghaddam, Henry Muccini:
Real-time Emergency Response through Performant IoT Architectures. ISCRAM 2019 - 2018
- [c11]Claudio Arbib, Fabrizio Marinelli, Andrea Pizzuti, Roberto Rosetti:
A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting Problem. ICORES 2018: 31-37 - [c10]Claudio Arbib, Henry Muccini, Mahyar Tourchi Moghaddam:
Applying a network flow model to quick and safe evacuation of people from a building: a real case. RSFF 2018: 50-61 - 2017
- [j26]Claudio Arbib, Mara Servilio, Paolo Ventura:
An improved integer linear programming formulation for the closest 0-1 string problem. Comput. Oper. Res. 80: 94-100 (2017) - 2016
- [j25]Claudio Arbib, Fabrizio Marinelli, Paolo Ventura:
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. 23(1-2): 47-63 (2016) - [c9]Claudio Arbib, Giovanni Felici, Mara Servilio, Paolo Ventura:
Optimum Solution of the Closest String Problem via Rank Distance. ISCO 2016: 297-307 - 2014
- [j24]Claudio Arbib, Mara Servilio, Claudia Archetti, Maria Grazia Speranza:
The directed profitable location Rural Postman Problem. Eur. J. Oper. Res. 236(3): 811-819 (2014) - [j23]Claudio Arbib, Giovanni Felici, Mara Servilio:
Sorting common operations to minimize the number of tardy jobs. Networks 64(4): 306-320 (2014) - 2011
- [j22]Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli:
Cutting stock with no three parts per pattern: Work-in-process and pattern minimization. Discret. Optim. 8(2): 315-332 (2011) - [j21]Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli:
On LP relaxations for the pattern minimization problem. Networks 57(3): 247-253 (2011) - [j20]Claudio Arbib, Martine Labbé, Mara Servilio:
Scheduling two chains of unit jobs on one machine: A polyhedral study. Networks 58(2): 103-113 (2011) - [c8]Claudio Arbib, Giovanni Felici, Mara Servilio:
Sorting Common Operations to Minimize Tardy Jobs. CTW 2011: 56-59
2000 – 2009
- 2009
- [j19]Claudio Arbib, Fabrizio Marinelli:
Exact and Asymptotically Exact Solutions for a Class of Assortment Problems. INFORMS J. Comput. 21(1): 13-25 (2009) - [c7]Claudio Arbib, Fabrizio Marinelli, Carlo M. Scoppola:
A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks. CTW 2009: 75-78 - 2008
- [j18]Claudio Arbib, Giovanni Felici:
Recent contributions of OR to network optimization. Eur. J. Oper. Res. 189(3): 1343-1344 (2008) - [c6]Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli:
A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs. CTW 2008: 181-183 - 2007
- [j17]Claudio Arbib, Fabrizio Rossi, Stefano Smriglio:
Annals of OR - Special volume in memory of Mario Lucertini. Ann. Oper. Res. 150(1): 1 (2007) - [j16]Claudio Arbib, Fabrizio Marinelli:
An optimization model for trim loss minimization in an automotive glass plant. Eur. J. Oper. Res. 183(3): 1421-1432 (2007) - 2005
- [j15]Claudio Arbib, Fabrizio Marinelli:
Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application. Eur. J. Oper. Res. 163(3): 617-630 (2005) - 2004
- [j14]Claudio Arbib, Stefano Smriglio, Mara Servilio:
A competitive scheduling problem and its relevance to UMTS channel assignment. Networks 44(2): 132-141 (2004) - 2003
- [c5]Claudio Arbib, Michele Flammini, Fabrizio Marinelli:
Minimum Flow Time Graph Ordering. WG 2003: 23-33 - 2002
- [j13]Claudio Arbib, Michele Flammini:
On the upper chromatic number of (v3, b2)-configurations. Discret. Appl. Math. 120(1-3): 3-12 (2002) - [j12]Claudio Arbib, Raffaele Mosca:
On (P5, diamond)-free graphs. Discret. Math. 250(1-3): 1-22 (2002) - [j11]Claudio Arbib, Fabrizio Marinelli, Fabrizio Rossi, Francesco Di Iorio:
Cutting and Reuse: An Application from Automobile Component Manufacturing. Oper. Res. 50(6): 923-934 (2002) - [j10]Claudio Arbib, Alberto Caprara:
On the stability number of the edge intersection of two graphs. Inf. Process. Lett. 83(3): 173-174 (2002) - 2000
- [j9]Claudio Arbib, Michele Flammini, Enrico Nardelli:
How to Survive While Visiting a Graph. Discret. Appl. Math. 99(1-3): 279-293 (2000) - [j8]Claudio Arbib, Fabrizio Rossi:
An optimization problem arising in the design of multiring systems. Eur. J. Oper. Res. 124(1): 63-76 (2000)
1990 – 1999
- 1999
- [j7]Claudio Arbib, Dario Pacciarelli, Stefano Smriglio:
A Three-dimensional Matching Model for Perishable Production Scheduling. Discret. Appl. Math. 92(1): 1-15 (1999) - [j6]Claudio Arbib:
A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs. Electron. Notes Discret. Math. 3: 2-6 (1999) - 1997
- [j5]Alessandro Agnetis, Claudio Arbib:
Concurrent operations assignment and sequencing for particular assembly problems in flow lines. Ann. Oper. Res. 69: 1-31 (1997) - 1995
- [j4]Alessandro Agnetis, Fernando Nicolò, Claudio Arbib, Mario Lucertini:
Task assignment and subassembly scheduling in flexible assembly lines. IEEE Trans. Robotics Autom. 11(1): 1-20 (1995) - 1992
- [c4]Alessandro Agnetis, Fernando Nicolò, Claudio Arbib, Mario Lucertini:
Task assignment in pipeline assembly systems. ICRA 1992: 1133-1138 - 1990
- [j3]Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi:
Predicting deadlock in store-and-forward networks. Networks 20(7): 861-881 (1990) - [j2]Alessandro Agnetis, Claudio Arbib, Mario Lucertini, Fernando Nicolò:
Part routing in flexible assembly systems. IEEE Trans. Robotics Autom. 6(6): 697-705 (1990) - [c3]Claudio Arbib:
Two Polynomial Problems in PLA Folding. WG 1990: 119-129
1980 – 1989
- 1988
- [j1]Claudio Arbib:
A Polynomial Characterization of Some Graph Partitioning Problems. Inf. Process. Lett. 26(5): 223-230 (1988) - [c2]Claudio Arbib, Giuseppe F. Italiano, Alessandro Panconesi:
Predicting deadlock in Store-and-Forward Networks. FSTTCS 1988: 123-142 - 1986
- [c1]Claudio Arbib, Gianna Cioni:
Meta-Reasoning and Data Structuring for Improving PROLOG Programming Style. AIMSA 1986: 55-61
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
