Login / Signup

Preemptive and non-preemptive generalized min sum set cover.

Sungjin ImMaxim SviridenkoRuben van der Zwaan
Published in: Math. Program. (2014)
Keyphrases
  • set cover
  • scheduling problem
  • lower bound
  • np hard
  • min sum
  • approximation algorithms
  • greedy algorithm
  • special case
  • linear programming
  • neural network
  • greedy heuristic