Lázaro Cánovas

Available identifiers

Publication	Date of Publication	Type
A practical algorithm for decomposing polygonal domains into convex polygons by diagonals	2009-02-17	Paper
A strengthened formulation for the simple plant location problem with order	2007-08-27	Paper
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique	2007-02-12	Paper
New formulations for the uncapacitated multiple allocation hub location problem	2006-03-24	Paper
Facet Obtaining Procedures for Set Packing Problems	2004-01-08	Paper
On the facets of the simple plant location packing polytope	2002-12-02	Paper
On the convergence of the Weiszfeld algorithm	2002-01-01	Paper
Algorithms for the decomposition of a polygon into convex polygons	2001-12-05	Paper
Extreme points of discrete location polyhedra	2001-10-10	Paper
A new assignment rule to improve seed points algorithms for the continuous $k$-center problem	2001-02-22	Paper
DECOPOL -- Codes for decomposing a polygon into convex subpolygons	2000-11-21	Paper
New facets for the set packing polytope	2000-01-01	Paper
The minimum covering $l_{pb}$-hypersphere problem	1998-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q4383642	1998-07-27	Paper
An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in $\mathbb{R}^ n$ with $l_{2b}$-norms	1998-05-06	Paper
New heuristic algorithms for the rectangular $p$-cover problem	1995-07-31	Paper

This page was built for person: Lázaro Cánovas