Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
Optimal solution of set covering/partitioning problems using dual heuristics
Management Science
An interior point algorithm to solve computationally difficult set covering problems
Mathematical Programming: Series A and B - Special issue on interior point methods for linear programming: theory and practice
An exact algorithm for the maximum stable set problem
Computational Optimization and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph
INFORMS Journal on Computing
A probabilistic heuristic for a computationally difficult set covering problem
Operations Research Letters
Set covering approach for reconstruction of sibling relationships
Optimization Methods & Software - Systems Analysis, Optimization and Data Mining in Biomedicine
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Computational experience with general cutting planes for the Set Covering problem
Operations Research Letters
Solving large Steiner Triple Covering Problems
Operations Research Letters
| Hi-index | 0.00 |
We propose a new branch-and-bound algorithm to solve hard instances of set covering problems arising from Steiner triple systems.