A service points location problem with Min-Max distance optimality criterion
Oto Hudec, Karel Zimmermann (1993)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Multifacility location problems on a sphere.”
A service points location problem with Min-Max distance optimality criterion
Global optimization for sum of linear ratios problem using new pruning technique.
Jiao, Hongwei, Feng, Qigao, Shen, Peiping, Guo, Yunrui (2008)
Mathematical Problems in Engineering
Similarity:
A new global optimization algorithm for solving generalized geometric programming.
Liu, San-Yang, Wang, Chun-Feng, Liu, Li-Xia (2010)
Mathematical Problems in Engineering
Similarity:
A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization)
Marek Smietanski (2008)
Open Mathematics
Similarity:
An algorithm for univariate optimization using a linear lower bounding function is extended to a nonsmooth case by using the generalized gradient instead of the derivative. A convergence theorem is proved under the condition of semismoothness. This approach gives a globally superlinear convergence of algorithm, which is a generalized Newton-type method.
A contribution to methods of Exterior Penalty Functions for Nonlinear Programming
Aleksandar Zečević (1995)
The Yugoslav Journal of Operations Research
Similarity:
Nonlinear iterative methods and parallel computation
Fridrich Sloboda (1976)
Aplikace matematiky
Similarity:
A Modified Step-Length Algorithm in Nonlinear Programming
Nada I. Žuranović-Miličić (2000)
The Yugoslav Journal of Operations Research
Similarity:
Primal-dual approximation algorithms for a packing-covering pair of problems
Sofia Kovaleva, Frits C. R. Spieksma (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We consider a special packing-covering pair of problems. The packing problem is a natural generalization of finding a (weighted) maximum independent set in an interval graph, the covering problem generalizes the problem of finding a (weighted) minimum clique cover in an interval graph. The problem pair involves weights and capacities; we consider the case of unit weights and the case of unit capacities. In each case we describe a simple algorithm that outputs a solution to the packing...