Login / Signup

A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem.

Mengfan MaZiyang MenAndré RossiYi ZhouMingyu Xiao
Published in: Comput. Oper. Res. (2023)
Keyphrases
  • integer linear programming formulation
  • quadratic assignment problem
  • prize collecting
  • undirected graph
  • multicast routing
  • lower bound