EEasy with difficulty objective functions for Max cutEasy with difficulty objective functions for Max cutde S. Thomas McCormickMateriasAlgorithmsApproximation theoryEdiciones (1)Easy with difficulty objective functions for Max cut (2002)Indian Institute of Management · inglésMás obras de S. Thomas McCormickInteger programming and combinatorial optimizationVer todas las obras de S. Thomas McCormick →
