The following pages link to Lázaro Cánovas (Q170035):
Displaying 17 items.
- New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique (Q864018) (← links)
- A practical algorithm for decomposing polygonal domains into convex polygons by diagonals (Q1001364) (← links)
- (Q1291594) (redirect page) (← links)
- DECOPOL -- Codes for decomposing a polygon into convex subpolygons (Q1291595) (← links)
- A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem (Q1291662) (← links)
- An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms (Q1367876) (← links)
- The minimum covering \(l_{pb}\)-hypersphere problem (Q1383828) (← links)
- On the convergence of the Weiszfeld algorithm (Q1396220) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- Algorithms for the decomposition of a polygon into convex polygons (Q1969864) (← links)
- A strengthened formulation for the simple plant location problem with order (Q2643785) (← links)
- (Q4383642) (← links)
- Facet Obtaining Procedures for Set Packing Problems (Q4443075) (← links)
- New heuristic algorithms for the rectangular $p$-cover problem (Q4837962) (← links)
- New facets for the set packing polytope (Q5929145) (← links)
- Extreme points of discrete location polyhedra (Q5945254) (← links)
