default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabrizio Marinelli 0001
Person information
- affiliation: Università Politecnica delle Marche, Ancona, Italy
Other persons with the same name
- Fabrizio Marinelli 0002
![[0000-0003-0044-6718]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-0044-6718")
— National Institutes of Health, Bethesda, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j21]Claudio Arbib, Fabrizio Marinelli, Ulrich Pferschy, Fatemeh K. Ranjbar:
One-dimensional stock cutting resilient against singular random defects. Comput. Oper. Res. 157: 106280 (2023)- 2021
- [j20]Fabrizio Marinelli, Andrea Pizzuti, Fabrizio Rossi:
LP-based dual bounds for the maximum quasi-clique problem. Discret. Appl. Math. 296: 118-140 (2021) - [j19]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) - 2020
- [j18]Emanuele Frontoni, Fabrizio Marinelli, Roberto Rosetti, Primo Zingaretti:
Optimal stock control and procurement by reusing of obsolescences in manufacturing. Comput. Ind. Eng. 148: 106697 (2020) - 2018
- [j17]Fabrizio Marinelli, Andrea Pizzuti:
A Sequential Value Correction heuristic for a bi-objective two-dimensional bin-packing. Electron. Notes Discret. Math. 64: 25-34 (2018) - 2017
- [j16]Emanuele Frontoni, Fabrizio Marinelli, Roberto Rosetti, Primo Zingaretti:
Shelf space re-allocation for out of stock reduction. Comput. Ind. Eng. 106: 32-40 (2017) - 2016
- [j15]Fabrizio Marinelli, Angelo Parente:
A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem. Comput. Oper. Res. 69: 68-78 (2016) - [j14]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) - 2014
- [j13]Leo Liberti, Fabrizio Marinelli:
Mathematical programming: Turing completeness and applications to software analysis. J. Comb. Optim. 28(1): 82-104 (2014) - 2011
- [j12]Fabrizio Marinelli, Salvatore Nocella, Fabrizio Rossi, Stefano Smriglio:
A Lagrangian heuristic for satellite range scheduling with resource constraints. Comput. Oper. Res. 38(11): 1572-1583 (2011) - [j11]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) - [j10]Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli:
On LP relaxations for the pattern minimization problem. Networks 57(3): 247-253 (2011) - 2010
- [j9]Leo Liberti, Stéphane Le Roux, Jeremy Leconte, Fabrizio Marinelli:
Mathematical programming based debugging. Electron. Notes Discret. Math. 36: 1311-1318 (2010) - 2009
- [j8]Claudio Arbib, Fabrizio Marinelli:
Exact and Asymptotically Exact Solutions for a Class of Assortment Problems. INFORMS J. Comput. 21(1): 13-25 (2009) - [j7]Leo Liberti, Carlile Lavor, Nelson Maculan, Fabrizio Marinelli:
Double variable neighbourhood search with smoothing for the molecular distance geometry problem. J. Glob. Optim. 43(2-3): 207-218 (2009) - 2008
- [j6]Vittorio Cortellessa, Fabrizio Marinelli, Pasqualina Potena:
An optimization framework for "build-or-buy" decisions in software architecture. Comput. Oper. Res. 35(10): 3090-3106 (2008) - [j5]Vittorio Cortellessa, Ivica Crnkovic, Fabrizio Marinelli, Pasqualina Potena:
Experimenting the Automated Selection of COTS Components Based on Cost and System Requirements. J. Univers. Comput. Sci. 14(8): 1228-1255 (2008) - 2007
- [j4]Fabrizio Marinelli, Maria Elena Nenni, Antonio Sforza:
Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company. Ann. Oper. Res. 150(1): 177-192 (2007) - [j3]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
- [j2]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) - 2002
- [j1]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)
Conference and Workshop Papers
- 2024
- [c12]Fabrizio Marinelli, Andrea Pizzuti:
A Sequential Heuristic for the Efficient Management of a Work Center's Stocking Area. ICORES 2024: 253-260 - 2022
- [c11]Claudio Arbib, Fabrizio Marinelli, Mustafa Ç. Pinar, Andrea Pizzuti:
Assortment and Cut of Defective Stocks by Bilevel Programming. ICORES 2022: 294-301 - 2019
- [c10]Andrea Bartolini, Gabriele Comodi, Fabrizio Marinelli, Andrea Pizzuti, Roberto Rosetti:
A Matheuristic Approach for Resource Scheduling and Design of a Multi-energy System. ICORES 2019: 451-458 - 2018
- [c9]Claudio Arbib, Fabrizio Marinelli, Andrea Pizzuti, Roberto Rosetti:
A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting Problem. ICORES 2018: 31-37 - 2016
- [c8]Emanuele Frontoni, Fabrizio Marinelli, Marina Paolanti, Roberto Rosetti, Primo Zingaretti:
Optimal production planning by reusing components. MED 2016: 1272-1277 - 2013
- [c7]Vittorio Cortellessa, Raffaela Mirandola, Fabrizio Marinelli, Pasqualina Potena:
Quantifying the influence of failure repair/mitigation costs on service-based systems. ISSRE 2013: 90-99 - 2010
- [c6]Eric Goubault, Stéphane Le Roux, Jeremy Leconte, Leo Liberti, Fabrizio Marinelli:
Static Analysis by Abstract Interpretation: A Mathematical Programming Approach. NSAD@SAS 2010: 73-87 - 2009
- [c5]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
- [c4]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
- [c3]Vittorio Cortellessa, Ivica Crnkovic, Fabrizio Marinelli, Pasqualina Potena:
Driving the selection of cots components on the basis of system requirements. ASE 2007: 413-416 - 2006
- [c2]Vittorio Cortellessa, Fabrizio Marinelli, Pasqualina Potena:
Automated Selection of Software Components Based on Cost/Reliability Tradeoff. EWSA 2006: 66-81 - 2003
- [c1]Claudio Arbib, Michele Flammini, Fabrizio Marinelli:
Minimum Flow Time Graph Ordering. WG 2003: 23-33
Parts in Books or Collections
- 2016
- [p1]Pasqualina Potena, Ivica Crnkovic, Fabrizio Marinelli, Vittorio Cortellessa:
Software Architecture Quality of Service Analysis Based on Optimization Models. Intelligent Decision Making in Quality Management 2016: 421-446
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 2024-04-29 21:21 CEST 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:
