Sebastián Ceria

According to our database, Sebastián Ceria authored at least 12 papers between 1993 and 2007.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2007

A brief history of lift-and-project.

Sebastián Ceria

Ann. Oper. Res., 2007

2003

Lift-and-project cuts and perfect graphs.

Sebastián Ceria

Math. Program., 2003

2001

Octane: A New Heuristic for Pure 0-1 Programs.

Egon Balas, Sebastián Ceria, Milind Dawande, François Margot, Gábor Pataki

Oper. Res., 2001

1999

Convex programming for disjunctive convex optimization.

Sebastián Ceria, João Soares

Math. Program., 1999

1998

A Lagrangian-based heuristic for large-scale set covering problems.

Sebastián Ceria, Paolo Nobili, Antonio Sassano

Math. Program., 1998

Cutting planes for integer programs with general integer variables.

Sebastián Ceria, Cécile Cordier, Hugues Marchand, Laurence A. Wolsey

Math. Program., 1998

Solving Integer and Disjunctive Programs by Lift and Project.

Sebastián Ceria, Gábor Pataki

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1996

Gomory cuts revisited.

Egon Balas, Sebastián Ceria, Gérard Cornuéjols, N. Natraj

Oper. Res. Lett., 1996

1995

Combining and Strengthening Gomory Cuts.

Sebastián Ceria, Gérard Cornuéjols, Milind Dawande

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1993

A lift-and-project cutting plane algorithm for mixed 0-1 programs.

Egon Balas, Sebastián Ceria, Gérard Cornuéjols

Math. Program., 1993

Solving Mixed 0-1 Programs by a Lift-and-Project Method.

Egon Balas, Sebastián Ceria, Gérard Cornuéjols

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Polyhedral methods for the maximum clique problem.

Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki

Proceedings of the Cliques, 1993