×
  • A branch-and-cut method for 0-1 mixed convex programming

    Stubbs R. A.

Click on cover to enlarge.
0 - 1Hours to read