Buscar
Mostrando ítems 1-10 de 709
An enumerative procedure for identifying maximal coversAn enumerative procedure for identifying maximal covers
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 2003)
A Note On Certain Maximal Curves
(Taylor & Francis IncPhiladelphia, 2017)
An enumerative procedure for identifying maximal coversAn enumerative procedure for identifying maximal covers
(2009-02-20)
In this paper we present an enumerative procedure for identifying all maximalcovers from the set of covers implied by a 0-1 knapsack constraint. The inequalitiesinduced by these maximal covers are not dominated by the ...
An enumerative procedure for identifying maximal coversAn enumerative procedure for identifying maximal covers
(2009-02-20)
In this paper we present an enumerative procedure for identifying all maximalcovers from the set of covers implied by a 0-1 knapsack constraint. The inequalitiesinduced by these maximal covers are not dominated by the ...
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015-05-01)
This paper presents a hybrid algorithm that combines a metaheuristic and an exact method to solve the Probabilistic Maximal Covering Location-Allocation Problem. A linear programming formulation for the problem presents ...
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015)
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015)