Now showing items 1-1 of 1

  • Optimal Set Partitioning, Matchings and Lagrangian Duality 

    Nemhauser, George; Weber, Glenn (2009-07-02)
    We formulate the set partitioning problem as a matching problem with simple side constraints. As a result we obtain a Lagrangian relaxation of the set partitioning problem in which the primal problem is a matching problem. ...