Approximate solutions of continuous dispersion problems
From MaRDI portal
Publication:816409
DOI10.1007/s10479-005-2039-zzbMath1114.90066OpenAlexW2057794510MaRDI QIDQ816409
Michael W. Trosset, Artan Dimnaku, 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
location theorynonlinear programmingcomputer experimentsmaximin distance designsspace-filling designs
Related Items
Computational experiments with heuristics for two nature reserve site selection problems, Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems, Space-filling Latin hypercube designs for computer experiments, Repulsion-based p-dispersion with distance constraints in non-convex polygons
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Exploratory designs for computational experiments
- Lattice sampling revisited: Monte Carlo variance of means over randomized orthogonal arrays
- A comparison of \(p\)-dispersion heuristics
- Improving dense packings of equal disks in a square
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Packing equal circles in a square: A deterministic global optimization approach
- 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
- Optimal Signal Sets for Non-Gaussian Detectors
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
