Pages that link to "Item:Q1196029"
From MaRDI portal
The following pages link to GBSSS: The generalized big square small square method for planar single- facility location (Q1196029):
Displaying 50 items.
- Covering part of a planar network (Q291695) (← links)
- The quintile share ratio in location analysis (Q296717) (← links)
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
- New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
- Continuous location of an assembly station (Q356516) (← links)
- A global optimization procedure for the location of a median line in the three-dimensional space (Q421608) (← links)
- Approximating generalized distance functions on weighted triangulated surfaces with applications (Q425342) (← links)
- Competitive facility location and design with reactions of competitors already in the market (Q439603) (← links)
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
- Single-facility huff location problems on networks (Q490213) (← links)
- Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams (Q512990) (← 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)
- Geometric fit of a point set by generalized circles (Q652655) (← links)
- Theoretical rate of convergence for interval inclusion functions (Q695339) (← links)
- Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria. (Q703293) (← links)
- The big cube small cube solution method for multidimensional facility location problems (Q733529) (← links)
- Estimating the circle closest to a set of points by maximum likelihood using the BHHH algorithm (Q818084) (← links)
- An efficient solution method for Weber problems with barriers based on genetic algorithms (Q856193) (← links)
- Solving the semi-desirable facility location problem using bi-objective particle swarm (Q856268) (← links)
- Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
- Competitive facility location model with concave demand (Q877034) (← links)
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure (Q883194) (← links)
- Location of a facility minimizing nuisance to or from a planar network (Q947950) (← links)
- An interactive solution approach for a bi-objective semi-desirable location problem (Q960111) (← links)
- A general global optimization approach for solving location problems in the plane (Q995943) (← 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)
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems (Q1026590) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- Efficient solution approaches for a discrete multi-facility competitive interaction model (Q1026599) (← links)
- Location with acceleration-deceleration distance (Q1027601) (← links)
- On a branch-and-bound approach for a Huff-like Stackelberg location problem (Q1027988) (← 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)
- 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)
- A multiobjective programming model for locating treatment sites and routing hazardous wastes (Q1291659) (← links)
- Dominating sets for convex functions with some applications (Q1389077) (← links)
- Algebraic properties of location problems with one circular barrier. (Q1420408) (← links)
- The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← links)
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
- Undesirable facility location with minimal covering objectives (Q1806769) (← links)
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation (Q1869670) (← links)
