Opening a web site at which one can get a benchmark input data set to solve the set covering problem

DOI10.1080/09720529.2005.10698047zbMath1111.68318OpenAlexW2046746363MaRDI QIDQ3379149

Norio Okada, Yozo Deguchi, Kakuzo Iwamura

Publication date: 6 April 2006

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

genetic algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Unnamed Item
• Unnamed Item
• A genetic algorithm for chance constrained programming
• A computational study of a genetic algorithm to solve the set covering problem
• 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: Opening a web site at which one can get a benchmark input data set to solve the set covering problem