Polyhedral methods for the maximum clique problem. - Egon Balas; Sebastián Ceria; Gérard Cornuéjols; Gábor Pataki (Cliques, Coloring, and Satisfiability, 1993)

Solving Mixed 0-1 Programs by a Lift-and-Project Method. - Egon Balas; Sebastián Ceria; Gérard Cornuéjols (SODA, 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)

Combining and Strengthening Gomory Cuts. - Sebastián Ceria; Gérard Cornuéjols; Milind Dawande (IPCO, 1995)

Gomory cuts revisited. - Egon Balas; Sebastián Ceria; Gérard Cornuéjols; N. Natraj (Oper. Res. Lett., 1996)

Solving Integer and Disjunctive Programs by Lift and Project. - Sebastián Ceria; Gábor Pataki (IPCO, 1998)

Cutting planes for integer programs with general integer variables. - Sebastián Ceria; Cécile Cordier; Hugues Marchand; Laurence A. Wolsey (Math. Program., 1998)

A Lagrangian-based heuristic for large-scale set covering problems. - Sebastián Ceria; Paolo Nobili; Antonio Sassano (Math. Program., 1998)

Convex programming for disjunctive convex optimization. - Sebastián Ceria; João Soares (Math. Program., 1999)

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)

Lift-and-project cuts and perfect graphs. - Sebastián Ceria (Math. Program., 2003)

A brief history of lift-and-project. - Sebastián Ceria (Ann. Oper. Res., 2007)