Similar Search Results

The complexity of computing the Muirhead-Dalton distance

Deineko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard J. - In: Mathematical social sciences 57 (2009) 2, pp. 282-284

Persistent link: https://www.econbiz.de/10003835391

The minimum weighted covering location problem with distance constraints

Berman, Oded; Huang, Rongbing - In: Computers & operations research : and their … 35 (2008) 2, pp. 356-372

Persistent link: https://www.econbiz.de/10003668345

Locating a semi-obnoxious facility with expropriation

Berman, Oded; Wang, Qian - In: Computers & operations research : and their … 35 (2008) 2, pp. 392-403

Persistent link: https://www.econbiz.de/10003668362

Exploiting Fitness Distance Correlation of Set Covering Problems

Finger, Markus; Stutzle, Thomas; Ramalhinho Dias … - 2002

The set covering problem is an NP-hard combinatorial optimization problem that arises in applications ranging from crew scheduling in airlines to driver scheduling in public mass transport. In this paper we analyze search space characteristics of a widely used set of benchmark instances through...

Persistent link: https://www.econbiz.de/10014116698