OpenAlex
On solving multi objective Set Covering Problem with imprecise linear fractional objectives
Work
Year: 2015
Type: article
Abstract: The Set Covering problem is one the of most important NP-complete 0-1 integer programming problems because it serves as a model for many real world problems like the crew scheduling problem, facility ... more
Cites: 21
Cited by: 7
Related to: 10
FWCI: 0.573
Citation percentile (by year/subfield): 81.57
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: green