Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem

DOI10.1287/opre.47.5.785zbMath0982.90041OpenAlexW2157507931MaRDI QIDQ4950824

Jay B. Ghosh, Gajendra Kumar Adil

Publication date: 27 April 2000

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/25215

zbMATH Keywords

Lagrangian relaxationmixed integer programminggraph partitioning problems

Mathematics Subject Classification ID

Applications of graph theory (05C90) Mixed integer programming (90C11) Combinatorial optimization (90C27)

This page was built for publication: Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem