A Two-Phase Heuristic for Set Covering

International Journal of Mathematics in Operational Research - Switzerland
doi 10.1504/ijmor.2018.10013170
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Inderscience Publishers

Related search

Comparison of GA Based Heuristic and GRASP Based Heuristic for Total Covering Problem

iBusiness
2010English

A Heuristic Approach for Minimum Set Cover Problem

International Journal of Advanced Research in Artificial Intelligence
2015English

A New Heuristic Algorithm for the Planar Minimum Covering Circle Problem

Production and Manufacturing Research
IndustrialManufacturing Engineering
2014English

A Finite Set Covering Theorem III

Bulletin of the Australian Mathematical Society
Mathematics
1972English

A Two-Phase Constructive Heuristic for Minimum Energy Broadcasting in Wireless Ad Hoc Networks

International Journal of Computer Network and Information Security
2010English

Colour Transversal Vertex Covering Set

International Journal of Scientific and Innovative Mathematical Research
2016English

A Tabu-Search Based Heuristic for the Hub Covering Problem Over Incomplete Hub Networks

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

An Adaptive Level Set Approach for Incompressible Two-Phase Flows

Journal of Computational Physics
Numerical AnalysisApplied MathematicsSimulationComputer Science ApplicationsModelingComputational MathematicsAstronomyPhysics
1999English

A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering. Revision,

1992English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy