Login / Signup

Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint.

Mohamed HaouariSafa Bhar LayebHanif D. Sherali
Published in: Electron. Notes Discret. Math. (2010)
Keyphrases
  • prize collecting
  • travel time
  • mixed integer programming
  • scheduling problem
  • upper bound
  • feasible solution