Login / Signup

A cutting plane method for solving minimax problems in the complex plane.

Rembert Reemtsen
Published in: Numer. Algorithms (1992)
Keyphrases
  • solving problems
  • optimization problems
  • cutting plane method
  • np hard
  • dynamic programming
  • combinatorial optimization
  • linear programming problems