@article {1435,
	title = {Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem},
	journal = {INFORMS Journal on Computing},
	volume = {30},
	year = {2018},
	pages = {43-56},
	abstract = {<p>We investigate the maximum induced matching problem (MIM), which is the problem of finding an induced matching having the largest cardinality on an undirected graph. The problem is known to be NP-hard for general graphs. We first propose a vertex-based integer programming formulation for MIM, which is more compact compared to an edge-based formulation found in the literature. We also introduce the maximum weight induced matching problem (MWIM), which generalizes MIM so that vertices and edges have weights. We adapt the edge-based formulation to MWIM, and propose a quadratic programming formulation of MWIM based on our vertex-based formulation. We then linearize our quadratic programming formulation, and devise a Benders decomposition algorithm that exploits a special structure of the linearized formulation. We also propose valid inequalities and formulation tightening procedures to improve the efficiency of our approach. Our computational tests on a large suite of randomly generated graphs show that our vertex-based formulation and decomposition approach significantly improve the solvability of MIM and MWIM, especially on dense graphs. The online appendix and data are available at https://doi.org/10.1287/ijoc.2017.0764.</p>},
	doi = {10.1287/ijoc.2017.0764},
	url = {https://doi.org/10.1287/ijoc.2017.0764},
	author = {Ahat, Bet{\"u}l and Ekim, Tinaz and Z C Ta{\c s}k{\i}n}
}
@article {671,
	title = {An Integer Programming-Based Search Technique for Error-Prone Substructures of LDPC Codes},
	journal = {AEU - International Journal of Electronics and Communications},
	volume = {68},
	year = {2014},
	pages = {1097-1105},
	doi = {10.1016/j.aeue.2014.05.012},
	author = {Abdullah Sar{\i}duman and Ali Emre Pusane and Z C Ta{\c s}k{\i}n}
}
@article {TaskinEkim2012,
	title = {Integer Programming Formulations for the Minimum Weighted Maximal Matching Problem},
	journal = {Optimization Letters},
	volume = {6(6)},
	year = {2012},
	pages = {1161-1171},
	doi = {http://dx.doi.org/10.1007/s11590-011-0351-x},
	author = {Z C Ta{\c s}k{\i}n and Ekim, Tinaz}
}
