scientific article; zbMATH DE number 4106856

MaRDI QIDQ3831014zbMATH OpenFDO

Authors Christoph Peter-Orth

Publication date 1987

zbMATH Keywords

0-1 matrix1-widthchess queen graphincidence matrixSteiner triple system

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Triple systems (05B07) Combinatorial aspects of packing and covering (05B40) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Solving hard set covering problems
• The set covering problem: Complexity, algorithms, experiments
• Solving set covering problems of large dimension
• An approach to the solution of the set-covering problem
• Solving large set covering problems on a personal computer
• Problems and algorithms for covering arrays via set covers
• Solving the set cover problem on a supercomputer
• Algorithms for the set covering problem
• On capacitated set cover problems
• Algorithms for large scale set covering problems

Cited in

(11)

• Computational experience with approximation algorithms for the set covering problem
• A novel decomposition approach to set covering problems by exploiting special structures
• Solving large Steiner Triple Covering Problems
• Exact cover problem in Milton Babbitt's all-partition array
• scientific article; zbMATH DE number 5990470 (Why is no real title available?)
• scientific article; zbMATH DE number 5773533 (Why is no real title available?)
• scientific article; zbMATH DE number 89390 (Why is no real title available?)
• scientific article; zbMATH DE number 6815827 (Why is no real title available?)
• Benchmark data set with service programs to approximately solve the set covering problem
• A biased random-key genetic algorithm for the Steiner triple covering problem
• Solution techniques for the large set covering problem

This page was built for publication:

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