Pages that link to "Item:Q3705190"
From MaRDI portal
The following pages link to The Minisum and Minimax Location Problems Revisited (Q3705190):
Displayed 50 items.
- A generalized Weber problem with different gauges for different regions (Q278331) (← links)
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
- A global optimization procedure for the location of a median line in the three-dimensional space (Q421608) (← links)
- Locating a competitive facility in the plane with a robustness criterion (Q421609) (← links)
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
- Single-facility huff location problems on networks (Q490213) (← links)
- A BSSS algorithm for the location problem with minimum square error (Q606175) (← links)
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods (Q609566) (← links)
- The multicriteria big cube small cube method (Q611015) (← links)
- Theoretical rate of convergence for interval inclusion functions (Q695339) (← links)
- On minimax-regret Huff location models (Q709114) (← links)
- The big cube small cube solution method for multidimensional facility location problems (Q733529) (← links)
- The continuous center set of a network (Q757234) (← links)
- An efficient solution method for Weber problems with barriers based on genetic algorithms (Q856193) (← links)
- Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
- On the ordered anti-Weber problem for any norm in \(\mathbb R^2\) (Q969512) (← links)
- A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems (Q1001365) (← links)
- A robust and efficient algorithm for planar competitive location problems (Q1026588) (← links)
- Location of retail facilities under conditions of uncertainty (Q1026589) (← links)
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems (Q1027999) (← links)
- Continuous location problems and big triangle small triangle: Constructing better bounds (Q1037367) (← links)
- Solving general continuous single facility location problems by cutting planes (Q1086129) (← links)
- A discretizing algorithm for location problems (Q1129969) (← links)
- The problem of locating facilities causing airborne pollution revisited (Q1182144) (← links)
- GBSSS: The generalized big square small square method for planar single- facility location (Q1196029) (← links)
- A branch-and-bound algorithm for the location of facilities causing atmospheric pollution (Q1197644) (← links)
- Weber problems with alternative transportation systems (Q1278584) (← links)
- Semi-obnoxious location models: A global optimization approach (Q1291602) (← links)
- Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
- Stabilized column generation (Q1297485) (← links)
- A maximum \(L_p\) distance problem (Q1378646) (← links)
- Dominating sets for convex functions with some applications (Q1389077) (← links)
- Algebraic properties of location problems with one circular barrier. (Q1420408) (← links)
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation (Q1869670) (← links)
- Constrained location of competitive facilities in the plane (Q1885947) (← links)
- Robust fitting of circle arcs (Q1932849) (← links)
- A continuous location model for siting a non-noxious undesirable facility within a geographical region (Q1969855) (← links)
- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem (Q2301135) (← links)
- On heuristic bi-criterion methods for semi-obnoxious facility location (Q2340496) (← links)
- Geometric branch-and-bound methods for constrained global optimization problems (Q2434637) (← links)
- A BSSS algorithm for the single facility location problem in two regions with different norms (Q2482820) (← links)
- Noncooperative facility location games (Q2643786) (← links)
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems (Q2687444) (← links)
- An aggregate homotopy method for solving unconstrained minimax problems (Q5009167) (← links)
- A convex Hull algorithm for solving a location problem (Q5501876) (← links)
- On the circle closest to a set of points (Q5959387) (← links)
- (Q6039732) (← links)
- Solving a minisum single facility location problem in three regions with different norms (Q6157224) (← links)