Ceria Sebastin

Sebastin Ceria

Information about the author Sebastin Ceria will soon be added to the site.
Found 6 papers in total
A brief history of lift-and-project
2007
This paper is one in a special issue of Annals of Operations Research devoted to the...
Octane: A new heuristic for pure 0–1 programs
2001
We propose a new heuristic for pure 0–1 programs, which finds feasible integer...
Cutting planes for integer programs with general integer variables
1998
We investigate the use of cutting planes for integer programs with general integer...
A Lagrangian-based heuristic for large-scale set covering problems
1998
We present a new Lagrangian-based heuristic for solving large-scale set-covering...
Mixed 0–1 programming by lift-and-project in a branch-and-cut framework
1996
We investigate the computational issues that need to be addressed when incorporating...
A lift-and-project cutting plane algorithm for mixed 0-1 programming problems
1993
The authors propose a cutting plane algorithm for mixed 0-1 programs based on a family...
Papers per page: