A primal-dual algorithm for a constrained Fermat-Weber problem involving mixed norms
H. Idrissi, O. Lefebvre, C. Michelot (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
H. Idrissi, O. Lefebvre, C. Michelot (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
M. Minoux, J. Y. Serreault (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
R. Mathieu, L. Pittard, G. Anandalingam (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
P. F. Körner (1992)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Leo Liberti (2009)
RAIRO - Operations Research
Similarity:
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts...
Paul Feautrier (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: