Paolo Serafini - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2021

Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of DataGiuseppe Lancia, Paolo Serafini. algorithms, 14(8):235, 2021. [doi]

2019

Star partitions on graphsGiovanni Andreatta, Carla De Francesco, Luigi De Giovanni, Paolo Serafini. disopt, 33:1-18, 2019. [doi]

2018

An Iterative Scheme to Compute Size Probabilities in Random Graphs and Branching ProcessesPaolo Serafini. sp, 2018, 2018. [doi]

2016

Constrained domatic bipartition on treesGiovanni Andreatta, Carla De Francesco, Luigi De Giovanni, Paolo Serafini. disopt, 22:372-388, 2016. [doi]

The Complexity of Some Pattern Problems in the Logical Analysis of Large Genomic Data SetsGiuseppe Lancia, Paolo Serafini. iwbbio 2016: 3-12 [doi]

Deriving compact extended formulations via LP-based separation techniquesGiuseppe Lancia, Paolo Serafini. anor, 240(1):321-350, 2016. [doi]

2015

2014

Optimal shift coloring of treesGiovanni Andreatta, Luigi De Giovanni, Paolo Serafini. orl, 42(4):251-256, 2014. [doi]

Deriving compact extended formulations via LP-based separation techniquesGiuseppe Lancia, Paolo Serafini. 4or, 12(3):201-234, 2014. [doi]

Classifying negative and positive points by optimal box clusteringPaolo Serafini. DAM, 165:270-282, 2014. [doi]

2013

Exact solution of the robust knapsack problemMichele Monaci, Ulrich Pferschy, Paolo Serafini. cor, 40(11):2625-2631, 2013. [doi]

Combinatorial optimization problems with normal random costsPaolo Serafini. orl, 41(2):126-133, 2013. [doi]

2012

2011

An effective compact formulation of the max cut problem on sparse graphsGiuseppe Lancia, Paolo Serafini. endm, 37:111-116, 2011. [doi]

A time-indexed LP-based approach for min-sum job-shop problemsGiuseppe Lancia, Franca Rinaldi, Paolo Serafini. anor, 186(1):175-198, 2011. [doi]

Separating negative and positive points with the minimum number of boxesPaolo Serafini. colognetwente 2011: 12-15 [doi]

2009

A Set-Covering Approach with Column Generation for Parsimony HaplotypingGiuseppe Lancia, Paolo Serafini. informs, 21(1):151-166, 2009. [doi]

2006

Scheduling School MeetingsFranca Rinaldi, Paolo Serafini. patat 2007: 280-293 [doi]

Dynamic programming and minimum risk pathsPaolo Serafini. eor, 175(1):224-237, 2006. [doi]

2005

Linear programming with variable matrix entriesPaolo Serafini. orl, 33(2):165-170, 2005. [doi]

2004

A Column Generation Scheme for Faculty TimetablingAndrea Qualizza, Paolo Serafini. patat 2005: 161-173 [doi]

2003

Asymptotic schedulingPaolo Serafini. mp, 98(1-3):431-444, 2003. [doi]

2002

Exact algorithms for minimum routing cost treesMatteo Fischetti, Giuseppe Lancia, Paolo Serafini. networks, 39(3):161-173, 2002. [doi]

1998

Job Shop Scheduling With DeadlinesEgon Balas, Giuseppe Lancia, Paolo Serafini, Alkis Vazacopoulos. jco, 1(4):329-353, 1998.

1996

Scheduling Jobs on Several Machines with the Job Splitting PropertyPaolo Serafini. ior, 44(4):617-628, 1996. [doi]

1993

Computing the Throughput of a Network with Dedicated LinesChristos H. Papadimitriou, Paolo Serafini, Mihalis Yannakakis. DAM, 42(2):271-278, 1993. [doi]

1989

A Mathematical Model for Periodic Scheduling ProblemsPaolo Serafini, Walter Ukovich. siamdm, 2(4):550-581, 1989.

Sign in or sign up to see more results.

runs on WebDSL