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

DOI10.1080/09720529.2005.10698047zbMATH Open1111.68318OpenAlexW2046746363MaRDI QIDQ3379149FDOQ3379149

Authors: Kakuzo Iwamura, Norio Okada, Yozo Deguchi 

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

Recommendations

• Benchmark data set with service programs to approximately solve the set covering problem
• scientific article; zbMATH DE number 1910920
• A Genetic Algorithm for the Set Covering Problem
• An algorithm for set covering problem
• An improved genetic algorithm for the set covering problem

zbMATH Keywords

genetic algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• A genetic algorithm for chance constrained programming
• Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
• Set Covering by an All Integer Algorithm
• A computational study of a genetic algorithm to solve the set covering problem

Cited In (1)

• Benchmark data set with service programs to approximately solve the set covering problem

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

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