Login / Signup
Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem.
Betül Ahat
Tínaz Ekim
Z. Caner Taskin
Published in:
INFORMS J. Comput. (2018)
Keyphrases
</>
benders decomposition
integer programming formulations
mixed integer
network design problem
exact algorithms
integer programming
lower bound
linear program
approximation algorithms
objective function
optimal solution
lp relaxation