Approximate solutions of continuous dispersion problems

DOI10.1007/S10479-005-2039-ZMaRDI QIDQ816409zbMATH OpenOpenAlexFDO

Authors Artan Dimnaku, Michael W. Trosset, Rex K. Kincaid

Publication date 9 March 2006

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-005-2039-z

zbMATH Keywords

computer experimentsnonlinear programmingmaximin distance designslocation theoryspace-filling designs

Mathematics Subject Classification ID

Nonlinear programming (90C30) Continuous location (90B85)

Recommendations

• Solving the Continuous p-Dispersion Problem Using Non-linear Programming
• The discrete p-dispersion problem
• scientific article; zbMATH DE number 36716
• Approximation algorithms for dispersion problems
• Heuristic and Special Case Algorithms for Dispersion Problems

Cites work

• scientific article; zbMATH DE number 1209388 (Why is no real title available?)
• scientific article; zbMATH DE number 734886 (Why is no real title available?)
• scientific article; zbMATH DE number 775913 (Why is no real title available?)
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• A Modeling Language for Mathematical Programming
• A comparison of \(p\)-dispersion heuristics
• Design and analysis of computer experiments. With comments and a rejoinder by the authors
• Exploratory designs for computational experiments
• Improving dense packings of equal disks in a square
• Lattice sampling revisited: Monte Carlo variance of means over randomized orthogonal arrays
• Optimal Signal Sets for Non-Gaussian Detectors
• Orthogonal Array-Based Latin Hypercubes
• Packing equal circles in a square: A deterministic global optimization approach
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Solving the Continuous p-Dispersion Problem Using Non-linear Programming

Cited in

(9)

• The repeated p-dispersion problem
• Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
• MILP models for the selection of a small set of well-distributed points
• Approximation algorithms for dispersion problems
• Computational experiments with heuristics for two nature reserve site selection problems
• scientific article; zbMATH DE number 7027558 (Why is no real title available?)
• Space-filling Latin hypercube designs for computer experiments
• Continuous approximation formulas for location problems
• Repulsion-based p-dispersion with distance constraints in non-convex polygons

Describes a project that uses

Uses Software

• Decision tree for optimization software
• AMPL
• SNOPT

This page was built for publication: Approximate solutions of continuous dispersion problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816409)