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

DOI10.1080/09720502.2003.10700340MaRDI QIDQ4469109zbMATH OpenOpenAlexFDO

Authors Norio Okada, Kakuzo Iwamura, Yozo Deguchi

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)

Cites work

• A genetic algorithm for chance constrained programming
• Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
• Set Covering by an All Integer Algorithm
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4469109)