default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaolo Serafini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j28]Giuseppe Lancia
, Paolo Serafini:
Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data. Algorithms 14(8): 235 (2021)
2010 – 2019
- 2019
- [j27]Giovanni Andreatta, Carla De Francesco, Luigi De Giovanni, Paolo Serafini:
Star partitions on graphs. Discret. Optim. 33: 1-18 (2019) - 2018
- [j26]Paolo Serafini:
An Iterative Scheme to Compute Size Probabilities in Random Graphs and Branching Processes. Sci. Program. 2018: 3791075:1-3791075:6 (2018) - 2016
- [j25]Giuseppe Lancia, Paolo Serafini:
Deriving compact extended formulations via LP-based separation techniques. Ann. Oper. Res. 240(1): 321-350 (2016) - [j24]Giovanni Andreatta, Carla De Francesco, Luigi De Giovanni, Paolo Serafini:
Constrained domatic bipartition on trees. Discret. Optim. 22: 372-388 (2016) - [c5]Giuseppe Lancia, Paolo Serafini:
The Complexity of Some Pattern Problems in the Logical Analysis of Large Genomic Data Sets. IWBBIO 2016: 3-12 - 2015
- [j23]Giovanni Andreatta, Luigi De Giovanni, Paolo Serafini:
Optimal shift partitioning of pharmacies. Comput. Oper. Res. 55: 88-98 (2015) - [j22]Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
Local search inequalities. Discret. Optim. 16: 76-89 (2015) - [j21]Paolo Serafini:
Certificates of optimality for minimum norm biproportional apportionments. Soc. Choice Welf. 44(1): 1-12 (2015) - [c4]Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
A Unified Integer Programming Model for Genome Rearrangement Problems. IWBBIO (1) 2015: 491-502 - 2014
- [j20]Giuseppe Lancia, Paolo Serafini:
Deriving compact extended formulations via LP-based separation techniques. 4OR 12(3): 201-234 (2014) - [j19]Paolo Serafini:
Classifying negative and positive points by optimal box clustering. Discret. Appl. Math. 165: 270-282 (2014) - [j18]Giovanni Andreatta, Luigi De Giovanni, Paolo Serafini:
Optimal shift coloring of trees. Oper. Res. Lett. 42(4): 251-256 (2014) - 2013
- [j17]Michele Monaci, Ulrich Pferschy, Paolo Serafini:
Exact solution of the robust knapsack problem. Comput. Oper. Res. 40(11): 2625-2631 (2013) - [j16]Paolo Serafini:
Combinatorial optimization problems with normal random costs. Oper. Res. Lett. 41(2): 126-133 (2013) - 2012
- [j15]Paolo Serafini:
Allocation of the EU Parliament seats via integer linear programming and revised quotas. Math. Soc. Sci. 63(2): 107-113 (2012) - [j14]Friedrich Pukelsheim, Federica Ricca, Bruno Simeone, Andrea Scozzari, Paolo Serafini:
Network flow methods for electoral systems. Networks 59(1): 73-88 (2012) - [j13]Paolo Serafini, Bruno Simeone:
Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment. Networks 59(2): 191-208 (2012) - [j12]Paolo Serafini, Bruno Simeone:
Certificates of optimality: the third way to biproportional apportionment. Soc. Choice Welf. 38(2): 247-268 (2012) - 2011
- [j11]Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
A time-indexed LP-based approach for min-sum job-shop problems. Ann. Oper. Res. 186(1): 175-198 (2011) - [j10]Giuseppe Lancia, Paolo Serafini:
An effective compact formulation of the max cut problem on sparse graphs. Electron. Notes Discret. Math. 37: 111-116 (2011) - [c3]Paolo Serafini:
Separating negative and positive points with the minimum number of boxes. CTW 2011: 12-15
2000 – 2009
- 2009
- [j9]Giuseppe Lancia, Paolo Serafini:
A Set-Covering Approach with Column Generation for Parsimony Haplotyping. INFORMS J. Comput. 21(1): 151-166 (2009) - 2006
- [j8]Paolo Serafini:
Dynamic programming and minimum risk paths. Eur. J. Oper. Res. 175(1): 224-237 (2006) - [c2]Franca Rinaldi, Paolo Serafini:
Scheduling School Meetings. PATAT 2006: 280-293 - 2005
- [j7]Paolo Serafini:
Linear programming with variable matrix entries. Oper. Res. Lett. 33(2): 165-170 (2005) - 2004
- [c1]Andrea Qualizza, Paolo Serafini:
A Column Generation Scheme for Faculty Timetabling. PATAT 2004: 161-173 - 2003
- [j6]Paolo Serafini:
Asymptotic scheduling. Math. Program. 98(1-3): 431-444 (2003) - 2002
- [j5]Matteo Fischetti, Giuseppe Lancia, Paolo Serafini:
Exact algorithms for minimum routing cost trees. Networks 39(3): 161-173 (2002)
1990 – 1999
- 1998
- [j4]Egon Balas, Giuseppe Lancia, Paolo Serafini, Alkiviadis Vazacopoulos:
Job Shop Scheduling With Deadlines. J. Comb. Optim. 1(4): 329-353 (1998) - 1996
- [j3]Paolo Serafini:
Scheduling Jobs on Several Machines with the Job Splitting Property. Oper. Res. 44(4): 617-628 (1996) - 1993
- [j2]Christos H. Papadimitriou, Paolo Serafini, Mihalis Yannakakis:
Computing the Throughput of a Network with Dedicated Lines. Discret. Appl. Math. 42(2): 271-278 (1993)
1980 – 1989
- 1989
- [j1]Paolo Serafini, Walter Ukovich:
A Mathematical Model for Periodic Scheduling Problems. SIAM J. Discret. Math. 2(4): 550-581 (1989)
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-08-05 20:22 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:
