Pages that link to "Item:Q2770097"

The following pages link to Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming (Q2770097):

Displaying 26 items.

• Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
• New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
• The impact of cost uncertainty on the location of a distribution center (Q439510) (← links)
• Solving DC programs using the cutting angle method (Q486726) (← links)
• Minsum location extended to gauges and to convex sets (Q495723) (← 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)
• An agent-based framework for modeling and solving location problems (Q610998) (← links)
• Clustering and the perturbed spatial median (Q611736) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• On minimax-regret Huff location models (Q709114) (← links)
• Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches (Q887199) (← links)
• Spatial point process models for location-allocation problems (Q961747) (← links)
• Stabilized column generation (Q1297485) (← links)
• A two-echelon joint continuous-discrete location model (Q1683143) (← links)
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
• A d.c. optimization method for single facility location problems (Q1904649) (← links)
• A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
• The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← links)
• A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
• Generating good starting solutions for the p-median problem in the plane (Q2840779) (← links)
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
• Location Science in Canada (Q6102878) (← links)
• On the rate of convergence of the difference-of-convex algorithm (DCA) (Q6596346) (← links)