Paolo Serafini

Algorithms, 2021

2019

Star partitions on graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2019

2018

An Iterative Scheme to Compute Size Probabilities in Random Graphs and Branching Processes.

[BibT_eX]

[DOI]

Sci. Program., 2018

2016

Constrained domatic bipartition on trees.

[BibT_eX]

[DOI]

Discret. Optim., 2016

The Complexity of Some Pattern Problems in the Logical Analysis of Large Genomic Data Sets.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Biomedical Engineering, 2016

2015

Certificates of optimality for minimum norm biproportional apportionments.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2015

Local search inequalities.

[BibT_eX]

[DOI]

Discret. Optim., 2015

Optimal shift partitioning of pharmacies.

[BibT_eX]

[DOI]

Giovanni Andreatta

Luigi De Giovanni

Comput. Oper. Res., 2015

A Unified Integer Programming Model for Genome Rearrangement Problems.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Biomedical Engineering, 2015

2014

Optimal shift coloring of trees.

[BibT_eX]

[DOI]

Giovanni Andreatta

Luigi De Giovanni

Oper. Res. Lett., 2014

Classifying negative and positive points by optimal box clustering.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Deriving compact extended formulations via LP-based separation techniques.

[BibT_eX]

[DOI]

4OR, 2014

2013

Combinatorial optimization problems with normal random costs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

Exact solution of the robust knapsack problem.

[BibT_eX]

[DOI]

Michele Monaci

Ulrich Pferschy

Comput. Oper. Res., 2013

2012

Certificates of optimality: the third way to biproportional apportionment.

[BibT_eX]

[DOI]

Bruno Simeone

Soc. Choice Welf., 2012

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

[BibT_eX]

[DOI]

Bruno Simeone

Networks, 2012

Network flow methods for electoral systems.

[BibT_eX]

[DOI]

Networks, 2012

Allocation of the EU Parliament seats via integer linear programming and revised quotas.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2012

2011

An effective compact formulation of the max cut problem on sparse graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

A time-indexed LP-based approach for min-sum job-shop problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

Separating negative and positive points with the minimum number of boxes.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2009

2006

Dynamic programming and minimum risk paths.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

Scheduling School Meetings.

[BibT_eX]

[DOI]

Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

2005

Linear programming with variable matrix entries.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

2004

A Column Generation Scheme for Faculty Timetabling.

[BibT_eX]

[DOI]

Andrea Qualizza

Proceedings of the Practice and Theory of Automated Timetabling V, 2004

2003

Asymptotic scheduling.

[BibT_eX]

[DOI]

Math. Program., 2003

2002

Exact algorithms for minimum routing cost trees.

[BibT_eX]

[DOI]

Matteo Fischetti

Networks, 2002

1998

Job Shop Scheduling With Deadlines.

[BibT_eX]

[DOI]

Egon Balas

Alkiviadis Vazacopoulos

J. Comb. Optim., 1998

1996

Scheduling Jobs on Several Machines with the Job Splitting Property.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Oper. Res., 1996

1993

Computing the Throughput of a Network with Dedicated Lines.

[BibT_eX]

[DOI]

Mihalis Yannakakis

Discret. Appl. Math., 1993

1989

A Mathematical Model for Periodic Scheduling Problems.

[BibT_eX]

[DOI]