Lázaro Cánovas

From MaRDI portal
(Redirected from Lázaro Cánovas)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
Top
2009-02-17Paper
A strengthened formulation for the simple plant location problem with order
Operations Research Letters
2007-08-27Paper
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
European Journal of Operational Research
2007-02-12Paper
New formulations for the uncapacitated multiple allocation hub location problem
European Journal of Operational Research
2006-03-24Paper
Facet Obtaining Procedures for Set Packing Problems
SIAM Journal on Discrete Mathematics
2004-01-08Paper
On the facets of the simple plant location packing polytope
Discrete Applied Mathematics
2002-12-02Paper
On the convergence of the Weiszfeld algorithm
Mathematical Programming. Series A. Series B
2002-01-01Paper
Algorithms for the decomposition of a polygon into convex polygons
European Journal of Operational Research
2001-12-05Paper
Extreme points of discrete location polyhedra
Top
2001-10-10Paper
A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
European Journal of Operational Research
2001-02-22Paper
DECOPOL -- Codes for decomposing a polygon into convex subpolygons
European Journal of Operational Research
2000-11-21Paper
New facets for the set packing polytope
Operations Research Letters
2000-01-01Paper
The minimum covering \(l_{pb}\)-hypersphere problem
Computational Optimization and Applications
1998-07-29Paper
scientific article; zbMATH DE number 1138448 (Why is no real title available?)1998-07-27Paper
An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms
Top
1998-05-06Paper
New heuristic algorithms for the rectangular p-cover problem
RAIRO - Operations Research
1995-07-31Paper


Research outcomes over time


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