Pages that link to "Item:Q3637414"
From MaRDI portal
The following pages link to The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems (Q3637414):
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)
- 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)
- Locating a competitive facility in the plane with a robustness criterion (Q421609) (← 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)
- The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution (Q512989) (← links)
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams (Q512990) (← links)
- Maximizing the minimum cover probability by emergency facilities (Q512997) (← 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)
- On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
- Geometric fit of a point set by generalized circles (Q652655) (← links)
- Theoretical rate of convergence for interval inclusion functions (Q695339) (← links)
- On minimax-regret Huff location models (Q709114) (← links)
- Solving scheduling and location problems in the plane simultaneously (Q732883) (← links)
- The big cube small cube solution method for multidimensional facility location problems (Q733529) (← links)
- Equitable service by a facility: minimizing the Gini coefficient (Q833549) (← links)
- Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
- Equity models in planar location (Q871686) (← links)
- Location of a facility minimizing nuisance to or from a planar network (Q947950) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- Optimizing the location of a production firm (Q993460) (← 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)
- Location with acceleration-deceleration distance (Q1027601) (← links)
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems (Q1027999) (← links)
- Constructing a DC decomposition for ordered median problems (Q1037351) (← links)
- Continuous location problems and big triangle small triangle: Constructing better bounds (Q1037367) (← links)
- The planar multifacility collection depots location problem (Q1628125) (← 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)
- Facility dependent distance decay in competitive location (Q2031201) (← links)
- Directional approach to gradual cover: the continuous case (Q2033708) (← links)
- Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location (Q2128766) (← links)
- Extensions to the Weber problem (Q2147049) (← links)
- Gradual cover competitive facility location (Q2197154) (← links)
- The obnoxious facilities planar \(p\)-median problem (Q2241906) (← links)
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
- Solving the ordered one-median problem in the plane (Q2378373) (← links)
- Voronoi diagrams with overlapping regions (Q2393120) (← links)
- Locating a minisum annulus: a new partial coverage distance model (Q2408523) (← links)
- A directional approach to gradual cover (Q2421326) (← links)
- Geometric branch-and-bound methods for constrained global optimization problems (Q2434637) (← links)
