Alberto Caprara

Transp. Sci., 2019

2016

Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Bilevel Knapsack with Interdiction Constraints.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2016

Theoretical and computational results about optimality-based domain reductions.

[BibT_eX]

[DOI]

Marco Locatelli

Comput. Optim. Appl., 2016

2015

Timetabling and assignment problems in railway planning and integer multicommodity flow.

[BibT_eX]

[DOI]

Networks, 2015

Friendly bin packing instances without Integer Round-up Property.

[BibT_eX]

[DOI]

Mauro Dell'Amico

José Carlos Díaz Díaz

Manuel Iori

Math. Program., 2015

Automatic Dantzig-Wolfe reformulation of mixed integer programs.

[BibT_eX]

[DOI]

Math. Program., 2015

2014

Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2014

A Study on the Computational Complexity of the Bilevel Knapsack Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2014

Delay-Robust Event Scheduling.

[BibT_eX]

[DOI]

Oper. Res., 2014

2013

On integer polytopes with few nonzero vertices.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

Finding cliques of maximum weight on a generalization of permutation graphs.

[BibT_eX]

[DOI]

Optim. Lett., 2013

Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem.

[BibT_eX]

[DOI]

Fabio Furini

Enrico Malaguti

INFORMS J. Comput., 2013

A Lagrangian heuristic for a train-unit assignment problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

A new lower bound for curriculum-based course timetabling.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

A Complexity and Approximability Study of the Bilevel Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

Railway Rolling Stock Planning: Robustness Against Large Disruptions.

[BibT_eX]

[DOI]

Transp. Sci., 2012

A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling.

[BibT_eX]

[DOI]

Transp. Sci., 2012

Variability-Aware Task Allocation for Energy-Efficient Quality of Service Provisioning in Embedded Streaming Multimedia Applications.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2012

An effective branch-and-bound algorithm for convex quadratic integer programming.

[BibT_eX]

[DOI]

Christoph Buchheim

Math. Program., 2012

Models and Algorithms for the Train Unit Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

A Fast Heuristic Algorithm for the Train Unit Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012

2011

A Freight Service Design Problem for a Railway Corridor.

[BibT_eX]

[DOI]

Enrico Malaguti

Transp. Sci., 2011

Solution of the Train Platforming Problem.

[BibT_eX]

[DOI]

Laura Galli

Transp. Sci., 2011

Optimal linear arrangements using betweenness variables.

[BibT_eX]

[DOI]

Math. Program. Comput., 2011

Decorous Lower Bounds for Minimum Linear Arrangement.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2011

Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

An efficient on-line task allocation algorithm for QoS and energy efficiency in multicore multimedia platforms.

[BibT_eX]

[DOI]

Proceedings of the Design, Automation and Test in Europe, 2011

Frontmatter, Table of Contents, Preface, Workshop Organization.

[BibT_eX]

[DOI]

Spyros C. Kontogiannis

Proceedings of the ATMOS 2011, 2011

2010

Non-cyclic train timetabling and comparability graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Global optimization problems and domain reduction strategies.

[BibT_eX]

[DOI]

Marco Locatelli

Math. Program., 2010

New techniques for cost sharing in combinatorial optimization games.

[BibT_eX]

[DOI]

Math. Program., 2010

Solving a real-world train-unit assignment problem.

[BibT_eX]

[DOI]

Math. Program., 2010

Lower Bounds for the Minimum Linear Arrangement of a Graph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

An approximation scheme for the two-stage, two-dimensional knapsack problem.

[BibT_eX]

[DOI]

Discret. Optim., 2010

Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program.

[BibT_eX]

[DOI]

Proceedings of the Complex Systems Design & Management, 2010

A Heuristic Algorithm for the Train-Unit Assignment Problem.

[BibT_eX]

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Variability-tolerant run-time workload allocation for MPSoC energy minimization under real-time constraints.

[BibT_eX]

[DOI]

Proceedings of the 7th Conference on Computing Frontiers, 2010

Robust Train Routing and Online Re-scheduling.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2010, 2010

Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2010, 2010

2009

A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing.

[BibT_eX]

[DOI]

Nikhil Bansal

Maxim Sviridenko

SIAM J. Comput., 2009

Bidimensional packing by bilinear programming.

[BibT_eX]

[DOI]

Math. Program., 2009

A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Robustness in Train Timetabling.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Packing d-Dimensional Bins in d Stages.

[BibT_eX]

[DOI]

Math. Oper. Res., 2008

Constrained 0-1 quadratic programming: Basic approaches and extensions.

[BibT_eX]

[DOI]

André Renato Sales Amaral

Eur. J. Oper. Res., 2008

A New Lower Bound for the Minimum Linear Arrangement of a Graph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

A column generation approach to train timetabling on a corridor.

[BibT_eX]

[DOI]

4OR, 2008

An Application of Network Design with Orientation Constraints.

[BibT_eX]

Emiliano Traversi

Joerg Schweizer

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Recoverable Robustness for Railway Rolling Stock Planning.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2008, 2008

2007

Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study.

[BibT_eX]

[DOI]

Giuseppe Andreello

INFORMS J. Comput., 2007

Chapter 3 Passenger Railway Optimization.

[BibT_eX]

[DOI]

Proceedings of the Transportation, 2007

2006

A branch-and-cut algorithm for multiple sequence alignment.

[BibT_eX]

[DOI]

Math. Program., 2006

Packing into the smallest square: Worst-case analysis of lower bounds.

[BibT_eX]

[DOI]

Discret. Optim., 2006

A Lagrangian heuristic algorithm for a real-world train timetabling problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Improved approximation algorithms for multidimensional bin packing problems.

[BibT_eX]

[DOI]

Nikhil Bansal

Maxim Sviridenko

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

An efficient profile-based algorithm for scratchpad memory partitioning.

[BibT_eX]

[DOI]

Federico Angiolini

Luca Benini

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2005

Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing.

[BibT_eX]

[DOI]

Math. Oper. Res., 2005

Modified subset sum heuristics for bin packing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Laying Out Sparse Graphs with Provably Minimum Bandwidth.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2005

Bidimensional Packing by Bilinear Programming.

[BibT_eX]

[DOI]

Marco Locatelli

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

Worst-case analysis of the subset sum algorithm for bin packing.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

On the two-dimensional Knapsack Problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

Book reviews.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

Packing cuts in undirected graphs.

[BibT_eX]

[DOI]

Alessandro Panconesi

Networks, 2004

On d-threshold graphs and d-dimensional bin packing.

[BibT_eX]

[DOI]

Networks, 2004

1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap.

[BibT_eX]

[DOI]

J. Comput. Biol., 2004

Knapsack problems: A book review.

[BibT_eX]

[DOI]

4OR, 2004

2003

Models and algorithms for a staff scheduling problem.

[BibT_eX]

[DOI]

Math. Program., 2003

On the separation of split cuts and related inequalities.

[BibT_eX]

[DOI]

Math. Program., 2003

Packing cycles in undirected graphs.

[BibT_eX]

[DOI]

Alessandro Panconesi

J. Algorithms, 2003

The Reversal Median Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2003

A 3/4-Approximation Algorithm for Multiple Subset Sum.

[BibT_eX]

[DOI]

J. Heuristics, 2003

Polynomial-time algorithm for on-chip scratchpad memory partitioning.

[BibT_eX]

[DOI]

Federico Angiolini

Luca Benini

Proceedings of the International Conference on Compilers, 2003

2002

Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2002

Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals.

[BibT_eX]

[DOI]

J. Comb. Optim., 2002

Wavelength rerouting in optical networks, or the Venetian Routing problem.

[BibT_eX]

[DOI]

J. Algorithms, 2002

Packing triangles in bounded degree graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

On the stability number of the edge intersection of two graphs.

[BibT_eX]

[DOI]

Claudio Arbib

Inf. Process. Lett., 2002

Modeling and Solving the Train Timetabling Problem.

[BibT_eX]

[DOI]

Oper. Res., 2002

On bandwidth-2 graphs.

[BibT_eX]

[DOI]

Federico Malucelli

Daniele Pretolani

Discret. Appl. Math., 2002

Structural alignment of large-size proteins via lagrangian relaxation.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual International Conference on Computational Biology, 2002

An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

Packing 2-Dimensional Bins in Harmony.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics.

[BibT_eX]

Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

Optimal and Near - Optimal Solutions for 3D Structure Comparisons.

[BibT_eX]

[DOI]

Proceedings of the 1st International Symposium on 3D Data Processing Visualization and Transmission (3DPVT 2002), 2002

2001

Sorting Permutations by Reversals Through Branch-and-Price.

[BibT_eX]

[DOI]

See-Kiong Ng

INFORMS J. Comput., 2001

Lower bounds and algorithms for the 2-dimensional vector packing problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

On the Practical Solution of the Reversal Median Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

Approximation Schemes for Ordered Vector Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

Solution of Real-World Train Timetabling Problems.

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Hawaii International Conference on System Sciences (HICSS-34), 2001

Packing Cycles and Cuts in Undirected Graphs.

[BibT_eX]

[DOI]

Alessandro Panconesi

Proceedings of the Algorithms, 2001

2000

The Multiple Subset Sum Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2000

On the separation of maximally violated mod- k cuts.

[BibT_eX]

[DOI]

Math. Program., 2000

A PTAS for the Multiple Subset Sum Problem with different knapsack capacities.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Approximation algorithms for knapsack problems with cardinality constraints.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

Algorithms for the Set Covering Problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2000

Fast practical solution of sorting by reversals.

[BibT_eX]

[DOI]

See-Kiong Ng

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Sorting Permutations by Reversals and Eulerian Cycle Decompositions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals.

[BibT_eX]

[DOI]

J. Comb. Optim., 1999

A Heuristic Method for the Set Covering Problem.

[BibT_eX]

[DOI]

Oper. Res., 1999

Exact Solution of the Quadratic Knapsack Problem.

[BibT_eX]

[DOI]

David Pisinger

INFORMS J. Comput., 1999

Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

Formulations and hardness of multiple sorting by reversals.

[BibT_eX]

[DOI]

Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

On the Separation of Maximally Violated mod-k Cuts.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1998

Improving a Family of Approximation Algorithms to Edge Color Multigraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Modeling and Solving the Crew Rostering Problem.

[BibT_eX]

[DOI]

Oper. Res., 1998

Properties of some ILP Formulations of a Class of Partitioning Problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

A column-generation based branch-and-bound algorithm for sorting by reversals.

[BibT_eX]

[DOI]

See-Kiong Ng

Proceedings of the Mathematical Support for Molecular Biology, 1998

1997

Algorithms for railway crew management.

[BibT_eX]

[DOI]

Math. Program., 1997

Sorting by reversals is difficult.

[BibT_eX]

[DOI]

Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

1996

{0, 1/2}-Chvátal-Gomory cuts.

[BibT_eX]

[DOI]

Math. Program., 1996

A Heuristic Algorithm for the Set Covering Problem.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design.

[BibT_eX]

[DOI]