The Minimum Covering lpb-Hypersphere Problem. - Blas Pelegrín; Lázaro Cánovas (Comput. Optim. Appl., 1998)

Algorithms for the decomposition of a polygon into convex polygons. - José Fernández 001; Lázaro Cánovas; Blas Pelegrín (Eur. J. Oper. Res., 2000)

New facets for the set packing polytope. - Lázaro Cánovas; Mercedes Landete; Alfredo Marín 001 (Oper. Res. Lett., 2000)

On the facets of the simple plant location packing polytope. - Lázaro Cánovas; Mercedes Landete; Alfredo Marín 001 (Discret. Appl. Math., 2002)

On the convergence of the Weiszfeld algorithm. - Lázaro Cánovas; Roberto Cañavate; Alfredo Marín 001 (Math. Program., 2002)

Facet Obtaining Procedures for Set Packing Problems. - Lázaro Cánovas; Mercedes Landete; Alfredo Marín 001 (SIAM J. Discret. Math., 2002)

New formulations for the uncapacitated multiple allocation hub location problem. - Alfredo Marín 001; Lázaro Cánovas; Mercedes Landete (Eur. J. Oper. Res., 2006)

Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. - Lázaro Cánovas; Sergio García 001; Alfredo Marín 001 (Eur. J. Oper. Res., 2007)

A strengthened formulation for the simple plant location problem with order. - Lázaro Cánovas; Sergio García 001; Martine Labbé; Alfredo Marín 001 (Oper. Res. Lett., 2007)