Pages that link to "Item:Q1821683"

The following pages link to Approximation of solutions for location problems (Q1821683):

Displaying 15 items.

• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
• On approximate efficiency in multiobjective programming (Q857826) (← links)
• The complementary convex structure in global optimization (Q1187368) (← links)
• Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization (Q1187370) (← links)
• Weber problems with alternative transportation systems (Q1278584) (← links)
• Coradiant-valued maps and approximate solutions in variable ordering structures (Q1734112) (← links)
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
• A d.c. optimization method for single facility location problems (Q1904649) (← links)
• DC programming: overview. (Q1969457) (← links)
• Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization (Q2399486) (← links)
• General models in min-max continuous location: Theory and solution techniques (Q2564174) (← links)
• <i>ε</i>Variational inequalities for vector approximation problems (Q2785385) (← links)
• Un algorithme pour résoudre une famille de problèmes de localisation multisources (Q3713510) (← links)
• LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION (Q4548044) (← links)
• ∊-Variational inequalities in partially ordered spaces (Q4893703) (← links)