Computing Optimal Morse Matchings
  Morse matchings capture the essential structural information of discrete Morse functions. We show that computing optimal Morse matchings is NP-hard and give an integer programming formulation for the problem. Then we present polyhedral results for the corresponding polytope and report on computational results. 
Michael Joswig and Marc E. Pfetsch