Sign in

Improving benders decomposition using maximum feasible subsystem (MFS) cut generation strategy.

Georgios K. D. SaharidisMarianthi G. Ierapetritou
Published in: Comput. Chem. Eng. (2010)
Keyphrases
  • benders decomposition
  • mixed integer
  • feasible solution
  • network design problem
  • linear programming
  • search algorithm
  • graph cuts
  • constraint satisfaction
  • exact algorithms