Deterministic and stochastic global optimization techniques for planar covering with ellipses problems

No abstract is available for this paper.

• Publication year

  2013

• Venue

  European Journal of Operational Research

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ejor.2012.07.020
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Packing circles within ellipses

  2013cited by this paper
• Packing Ellipsoids with Overlap

  2012cited by this paper
• Covering problems in facility location: A review

  2012cited by this paper
• I and J

  2012cited by this paper
• Planar expropriation problem with non-rigid rectangular facilities

  2011cited by this paper
• Maximal covering location problem (MCLP) with fuzzy travel times

  2011cited by this paper
• Global minimization using an Augmented Lagrangian method with variable lower-level constraints

  2010cited by this paper
• Generalized coverage: New developments in covering location models

  2010cited by this paper
• New and improved results for packing identical unitary radius circles within triangles, rectangles and strips

  2010cited by this paper
• Planar maximal covering with ellipses

  2009influential reference
• Minimizing the object dimensions in circle and sphere packing problems

  2008cited by this paper
• Augmented Lagrangian methods under the constant positive linear dependence constraint qualification

  2007cited by this paper
• On Augmented Lagrangian Methods with General Lower-Level Constraints

  2007cited by this paper
• Planar maximal covering location problem under block norm distance measure

  2007cited by this paper
• Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization

  2005cited by this paper
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach

  2005cited by this paper
• A polyhedral branch-and-cut approach to global optimization

  2005cited by this paper
• The gradual covering decay location problem on a network

  2003cited by this paper
• GLOBAL OPTIMIZATION METHODS

  2002cited by this paper
• Fuzzy versions of the covering circle problem

  2002cited by this paper
• Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected Gradients

  2002cited by this paper
• Foundations of Bilevel Programming

  2002cited by this paper
• A Box-Constrained Optimization Algorithm with Negative Curvature Directions and Spectral Projected Gradients

  2001cited by this paper
• A global optimization method, αBB, for general twice-differentiable constrained NLPs—II. Implementation and computational results

  1998cited by this paper
• A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advances

  1998cited by this paper
• A global optimization method, αBB, for process design

  1996cited by this paper
• αBB: A global optimization method for general constrained nonconvex problems

  1995cited by this paper

• Liner hub covering problem with elliptical coverage: Improving the cost performance of hub covering problems

  2025cites this paper
• The influence coverage optimization problem

  2023cites this paper
• An elliptical cover problem in drone delivery network design and its solution algorithms

  2022cites this paper
• Covering problems with polyellipsoids: A location analysis perspective

  2021cites this paper
• New exact algorithms for planar maximum covering location by ellipses problems

  2020cites this paper
• Proceedings of the IX International Workshop on Locational Analysis and Related Problems

  2020cites this paper
• A New Stochastic Search Method for Filled Function

  2020cites this paper
• Minimal Radius Enclosing Polyellipsoids

  2019cites this paper
• O C ] 2 9 O ct 2 01 9 Minimal Radius Enclosing Polyellipsoids

  2019cites this paper
• Discrete Optimization An elliptical cover problem in drone delivery network design and its solution algorithms

  year unknowncites this paper