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

DOI10.1080/09720502.2005.10700420zbMath1149.90430OpenAlexW2027108423MaRDI QIDQ5756398

Masahiro Matsuzawa, Makoto Horiike, Kakuzo Iwamura

Publication date: 4 September 2007

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

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• A genetic algorithm for the set covering problem
• Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed
• A genetic algorithm for chance constrained programming
• A computational study of a genetic algorithm to solve the set covering problem
• 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: Benchmark data set with service programs to approximately solve the set covering problem