Paolo Serafini

Orcid: 0000-0002-0094-6520

According to our database1, Paolo Serafini authored at least 32 papers between 1989 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data.
Algorithms, 2021

2019
Star partitions on graphs.
Discret. Optim., 2019

2018
An Iterative Scheme to Compute Size Probabilities in Random Graphs and Branching Processes.
Sci. Program., 2018

2016
Constrained domatic bipartition on trees.
Discret. Optim., 2016

The Complexity of Some Pattern Problems in the Logical Analysis of Large Genomic Data Sets.
Proceedings of the Bioinformatics and Biomedical Engineering, 2016

2015
Certificates of optimality for minimum norm biproportional apportionments.
Soc. Choice Welf., 2015

Local search inequalities.
Discret. Optim., 2015

Optimal shift partitioning of pharmacies.
Comput. Oper. Res., 2015

A Unified Integer Programming Model for Genome Rearrangement Problems.
Proceedings of the Bioinformatics and Biomedical Engineering, 2015

2014
Optimal shift coloring of trees.
Oper. Res. Lett., 2014

Classifying negative and positive points by optimal box clustering.
Discret. Appl. Math., 2014

Deriving compact extended formulations via LP-based separation techniques.
4OR, 2014

2013
Combinatorial optimization problems with normal random costs.
Oper. Res. Lett., 2013

Exact solution of the robust knapsack problem.
Comput. Oper. Res., 2013

2012
Certificates of optimality: the third way to biproportional apportionment.
Soc. Choice Welf., 2012

Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment.
Networks, 2012

Network flow methods for electoral systems.
Networks, 2012

Allocation of the EU Parliament seats via integer linear programming and revised quotas.
Math. Soc. Sci., 2012

2011
An effective compact formulation of the max cut problem on sparse graphs.
Electron. Notes Discret. Math., 2011

A time-indexed LP-based approach for min-sum job-shop problems.
Ann. Oper. Res., 2011

Separating negative and positive points with the minimum number of boxes.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2009
A Set-Covering Approach with Column Generation for Parsimony Haplotyping.
INFORMS J. Comput., 2009

2006
Dynamic programming and minimum risk paths.
Eur. J. Oper. Res., 2006

Scheduling School Meetings.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

2005
Linear programming with variable matrix entries.
Oper. Res. Lett., 2005

2004
A Column Generation Scheme for Faculty Timetabling.
Proceedings of the Practice and Theory of Automated Timetabling V, 2004

2003
Asymptotic scheduling.
Math. Program., 2003

2002
Exact algorithms for minimum routing cost trees.
Networks, 2002

1998
Job Shop Scheduling With Deadlines.
J. Comb. Optim., 1998

1996
Scheduling Jobs on Several Machines with the Job Splitting Property.
Oper. Res., 1996

1993
Computing the Throughput of a Network with Dedicated Lines.
Discret. Appl. Math., 1993

1989
A Mathematical Model for Periodic Scheduling Problems.
SIAM J. Discret. Math., 1989


  Loading...