Approximate solutions of continuous dispersion problems

DOI10.1007/S10479-005-2039-ZzbMATH Open1114.90066OpenAlexW2057794510MaRDI QIDQ816409FDOQ816409

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

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

zbMATH Keywords

computer experimentsnonlinear programmingmaximin distance designslocation theoryspace-filling designs

Mathematics Subject Classification ID

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

Cites Work

• Design and analysis of computer experiments. With comments and a rejoinder by the authors
• A Modeling Language for Mathematical Programming
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Orthogonal Array-Based Latin Hypercubes
• Exploratory designs for computational experiments
• Title not available (Why is that?)
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• A comparison of \(p\)-dispersion heuristics
• Improving dense packings of equal disks in a square
• Packing equal circles in a square: A deterministic global optimization approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lattice sampling revisited: Monte Carlo variance of means over randomized orthogonal arrays
• Optimal Signal Sets for Non-Gaussian Detectors
• 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
• Title not available (Why is that?)
• 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

Uses Software

• SNOPT
• AMPL
• Decision tree for optimization software

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)