Now showing items 1-1 of 1

    • Analysis of Lagrangian lower bounds for a graph partitioning problem 

      Adil, G. K.; Ghosh, J. B. (Institute for Operations Research and the Management Sciences (INFORMS), 1999)
      Recently, Ahmadi and Tang (1991) demonstrated how various manufacturing problems can be modeled and solved as graph partitioning problems. They use Lagrangian relaxation of two different mixed integer programming formulations ...