A global optimization procedure for the location of a median line in the three-dimensional space
From MaRDI portal
Publication:421608
DOI10.1016/j.ejor.2011.05.030zbMath1237.90258OpenAlexW1997298747MaRDI QIDQ421608
Rafael Blanquero, Daniel Scholz, Emilio Carrizosa, Anita Schöbel
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/107475
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85) Nonconvex programming, global optimization (90C26)
Related Items (2)
A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Locating a median line with partial coverage distance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- The big cube small cube solution method for multidimensional facility location problems
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- Continuous location problems and big triangle small triangle: Constructing better bounds
- Linear facility location. Solving extensions of the basic problem
- GBSSS: The generalized big square small square method for planar single- facility location
- Locating lines and hyperplanes. Theory and algorithms
- Continuous location of dimensional structures.
- Properties of three-dimensional median line location models
- Locating Objects in the Plane Using Global Optimization Techniques
- Linear Facility Location in Three Dimensions—Models and Solution Methods
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Minisum and Minimax Location Problems Revisited
- Fitting hyperplanes by minimizing orthogonal deviations
- Convex analysis and global optimization
This page was built for publication: A global optimization procedure for the location of a median line in the three-dimensional space