A computational study of a genetic algorithm to solve the set covering problem

DOI10.1080/09720502.2003.10700340zbMath1122.90432OpenAlexW2326956046MaRDI QIDQ4469109

Yozo Deguchi, Kakuzo Iwamura, Norio Okada

Publication date: 14 June 2004

Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720502.2003.10700340

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Benchmark data set with service programs to approximately solve the set covering problem ⋮ Opening a web site at which one can get a benchmark input data set to solve the set covering problem

Cites Work

• Unnamed Item
• Unnamed Item
• Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed
• A genetic algorithm for chance constrained programming
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
• Set Covering by an All Integer Algorithm

This page was built for publication: A computational study of a genetic algorithm to solve the set covering problem