Lázaro Cánovas

According to our database, Lázaro Cánovas authored at least 9 papers between 1998 and 2007.

Collaborative distances:

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

2007

A strengthened formulation for the simple plant location problem with order.

Lázaro Cánovas, Sergio García, Martine Labbé, Alfredo Marín

Oper. Res. Lett., 2007

Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique.

Lázaro Cánovas, Sergio García, Alfredo Marín

Eur. J. Oper. Res., 2007

2006

New formulations for the uncapacitated multiple allocation hub location problem.

Alfredo Marín, Lázaro Cánovas, Mercedes Landete

Eur. J. Oper. Res., 2006

2002

Facet Obtaining Procedures for Set Packing Problems.

Lázaro Cánovas, Mercedes Landete, Alfredo Marín

SIAM J. Discret. Math., 2002

On the convergence of the Weiszfeld algorithm.

Lázaro Cánovas, Roberto Cañavate, Alfredo Marín

Math. Program., 2002

On the facets of the simple plant location packing polytope.

Lázaro Cánovas, Mercedes Landete, Alfredo Marín

Discret. Appl. Math., 2002

2000

New facets for the set packing polytope.

Lázaro Cánovas, Mercedes Landete, Alfredo Marín

Oper. Res. Lett., 2000

Algorithms for the decomposition of a polygon into convex polygons.

José Fernández, Lázaro Cánovas, Blas Pelegrín

Eur. J. Oper. Res., 2000

1998

The Minimum Covering <i>l</i>_<i>pb</i>-Hypersphere Problem.

Blas Pelegrín, Lázaro Cánovas

Comput. Optim. Appl., 1998