Paolo Serafini

Publication Activity (10 Years)

Years Active: 1989-2021
Publications (10 Years): 10

Top Topics

Optimization Problems

Integer Programming

Top Venues

Discret. Optim.

Oper. Res. Lett.

Soc. Choice Welf.

Comput. Oper. Res.

Publications

Giuseppe Lancia, Paolo Serafini
Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data. Algorithms 14 (8) (2021)
Giovanni Andreatta, Carla De Francesco, Luigi De Giovanni, Paolo Serafini
Star partitions on graphs. Discret. Optim. 33 (2019)
Paolo Serafini
An Iterative Scheme to Compute Size Probabilities in Random Graphs and Branching Processes. Sci. Program. 2018 (2018)
Giuseppe Lancia, Paolo Serafini
The Complexity of Some Pattern Problems in the Logical Analysis of Large Genomic Data Sets. IWBBIO (2016)
Giuseppe Lancia, Paolo Serafini
Deriving compact extended formulations via LP-based separation techniques. Ann. Oper. Res. 240 (1) (2016)
Giovanni Andreatta, Carla De Francesco, Luigi De Giovanni, Paolo Serafini
Constrained domatic bipartition on trees. Discret. Optim. 22 (2016)
Giovanni Andreatta, Luigi De Giovanni, Paolo Serafini
Optimal shift partitioning of pharmacies. Comput. Oper. Res. 55 (2015)
Giuseppe Lancia, Franca Rinaldi, Paolo Serafini
Local search inequalities. Discret. Optim. 16 (2015)
Giuseppe Lancia, Franca Rinaldi, Paolo Serafini
A Unified Integer Programming Model for Genome Rearrangement Problems. IWBBIO (1) (2015)
Paolo Serafini
Certificates of optimality for minimum norm biproportional apportionments. Soc. Choice Welf. 44 (1) (2015)
Paolo Serafini
Classifying negative and positive points by optimal box clustering. Discret. Appl. Math. 165 (2014)
Giovanni Andreatta, Luigi De Giovanni, Paolo Serafini
Optimal shift coloring of trees. Oper. Res. Lett. 42 (4) (2014)
Giuseppe Lancia, Paolo Serafini
Deriving compact extended formulations via LP-based separation techniques. 4OR 12 (3) (2014)
Paolo Serafini
Combinatorial optimization problems with normal random costs. Oper. Res. Lett. 41 (2) (2013)
Michele Monaci, Ulrich Pferschy, Paolo Serafini
Exact solution of the robust knapsack problem. Comput. Oper. Res. 40 (11) (2013)
Paolo Serafini, Bruno Simeone
Certificates of optimality: the third way to biproportional apportionment. Soc. Choice Welf. 38 (2) (2012)
Friedrich Pukelsheim, Federica Ricca, Bruno Simeone, Andrea Scozzari, Paolo Serafini
Network flow methods for electoral systems. Networks 59 (1) (2012)
Paolo Serafini
Allocation of the EU Parliament seats via integer linear programming and revised quotas. Math. Soc. Sci. 63 (2) (2012)
Paolo Serafini, Bruno Simeone
Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment. Networks 59 (2) (2012)
Giuseppe Lancia, Franca Rinaldi, Paolo Serafini
A time-indexed LP-based approach for min-sum job-shop problems. Ann. Oper. Res. 186 (1) (2011)
Giuseppe Lancia, Paolo Serafini
An effective compact formulation of the max cut problem on sparse graphs. Electron. Notes Discret. Math. 37 (2011)
Paolo Serafini
Separating negative and positive points with the minimum number of boxes. CTW (2011)
Giuseppe Lancia, Paolo Serafini
A Set-Covering Approach with Column Generation for Parsimony Haplotyping. INFORMS J. Comput. 21 (1) (2009)
Franca Rinaldi, Paolo Serafini
Scheduling School Meetings. PATAT (2006)
Paolo Serafini
Dynamic programming and minimum risk paths. Eur. J. Oper. Res. 175 (1) (2006)
Paolo Serafini
Linear programming with variable matrix entries. Oper. Res. Lett. 33 (2) (2005)
Andrea Qualizza, Paolo Serafini
A Column Generation Scheme for Faculty Timetabling. PATAT (2004)
Paolo Serafini
Asymptotic scheduling. Math. Program. 98 (1-3) (2003)
Matteo Fischetti, Giuseppe Lancia, Paolo Serafini
Exact algorithms for minimum routing cost trees. Networks 39 (3) (2002)
Egon Balas, Giuseppe Lancia, Paolo Serafini, Alkiviadis Vazacopoulos
Job Shop Scheduling With Deadlines. J. Comb. Optim. 1 (4) (1998)
Paolo Serafini
Scheduling Jobs on Several Machines with the Job Splitting Property. Oper. Res. 44 (4) (1996)
Christos H. Papadimitriou, Paolo Serafini, Mihalis Yannakakis
Computing the Throughput of a Network with Dedicated Lines. Discret. Appl. Math. 42 (2) (1993)
Paolo Serafini, Walter Ukovich
A Mathematical Model for Periodic Scheduling Problems. SIAM J. Discret. Math. 2 (4) (1989)