Pages that link to "Item:Q733529"

The following pages link to The big cube small cube solution method for multidimensional facility location problems (Q733529):

Displaying 34 items.

• Covering part of a planar network (Q291695) (← links)
• The quintile share ratio in location analysis (Q296717) (← links)
• Location equilibria for a continuous competitive facility location problem under delivered pricing (Q336785) (← links)
• New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function (Q386486) (← links)
• A global optimization procedure for the location of a median line in the three-dimensional space (Q421608) (← links)
• Competitive facility location and design with reactions of competitors already in the market (Q439603) (← links)
• Locating an axis-parallel rectangle on a Manhattan plane (Q458948) (← links)
• A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← 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 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)
• Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
• The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← links)
• A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set (Q1675572) (← links)
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
• A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances (Q1753405) (← links)
• One-dimensional center-based l 1-clustering method (Q1936788) (← links)
• Classical and inverse median location problems under uncertain environment (Q1987593) (← 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)
• Fitting concentric circles to measurements (Q2441575) (← links)
• A branch-and-bound approach for estimating covering functionals of convex bodies (Q2696981) (← links)
• Generating good starting solutions for the p-median problem in the plane (Q2840779) (← links)
• Big segment small segment global optimization algorithm on networks (Q3113501) (← links)
• (Q5016510) (← links)
• (Q6039732) (← links)
• Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights (Q6049306) (← links)
• Multipurpose shopping trips and location (Q6099398) (← links)
• Obnoxious facility location in multiple dimensional space (Q6113555) (← links)
• The obnoxious competitive facility location model (Q6146884) (← links)
• A refinement of the gravity model for competitive facility location (Q6149564) (← links)