New heuristic algorithms for the rectangular -cover problem
B. Pelegrín, L. Cánovas (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
B. Pelegrín, L. Cánovas (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
José Moreno, Casiano Rodríguez, Natividad Jiménez (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Zvi Drezner (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Y. Crama, J. Van De Klundert (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
R. Tadei, F. Della Croce, G. Menga (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Laurent Alfandari (2007)
RAIRO - Operations Research
Similarity:
The soft-capacitated facility location problem, where each facility is composed of a variable number of fixed-capacity production units, has been recently studied in several papers, especially in the metric case. In this paper, we only consider the general problem where connection costs do not systematically satisfy the triangle inequality property. We show that an adaptation of the set covering greedy heuristic, where the subproblem is approximately solved by a fully polynomial-time...
Amitava Dutta, Howard J. Siegel, Andrew B. Whinston (1983)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A. Aiello, E. Burattini, A. Massarotti, F. Ventriglia (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
M. Minoux, E. Pinson (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: