Bregman Proximal Relaxation of Large-Scale 0–1 Problems
Computational Optimization and Applications
An efficient heuristic approach to solve the unate covering problem
DATE '00 Proceedings of the conference on Design, automation and test in Europe
On some difficult linear programs coming from set partitioning
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
Exploiting Fitness Distance Correlation of Set Covering Problems
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
The Optimal Diversity Management Problem
Operations Research
A Heuristic Method for Selecting Support Features from Large Datasets
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Machine Vision and Applications
Heuristics for the variable sized bin-packing problem
Computers and Operations Research
Efficient RNAi-based gene family knockdown via set cover optimization
Artificial Intelligence in Medicine
A mixed integer linear program and tabu search approach for the complementary edge covering problem
Advances in Engineering Software
New ideas for applying ant colony optimization to the set covering problem
Computers and Industrial Engineering
FPGA implementation of a Greedy algorithm for set covering
RTC'05 Proceedings of the 14th IEEE-NPSS conference on Real time
Survey: Covering problems in facility location: A review
Computers and Industrial Engineering
Computational experience with general cutting planes for the Set Covering problem
Operations Research Letters
| Hi-index | 0.00 |