Pages that link to "Item:Q1086129"

The following pages link to Solving general continuous single facility location problems by cutting planes (Q1086129):

Displaying 13 items.

• A generalized Weber problem with different gauges for different regions (Q278331) (← links)
• Minimal containment under homothetics: a simple cutting plane approach (Q535290) (← links)
• Asymmetric distances, semidirected networks and majority in Fermat-Weber problems (Q1026590) (← links)
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm (Q1090621) (← links)
• A discretizing algorithm for location problems (Q1129969) (← links)
• Use of reference points for solving MONLP problems (Q1129974) (← links)
• GBSSS: The generalized big square small square method for planar single- facility location (Q1196029) (← links)
• When facilities coincide: Exact optimality conditions in multifacility location (Q1209505) (← links)
• Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
• A geometrical solution for quadratic bicriteria location models (Q1296369) (← links)
• Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems (Q1367722) (← links)
• Dominating sets for convex functions with some applications (Q1389077) (← links)
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions (Q5506731) (← links)