Decomposition approaches for two-stage robust binary optimization | Zendy

Ayşe N. Arslan | Zendy; Boris Detienne | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Decomposition approaches for two-stage robust binary optimization

Author(s) -

Ayşe N. Arslan,

Boris Detienne

Publication year - 2019

Publication title -

hal (le centre pour la communication scientifique directe)

Language(s) - Uncategorized

Resource type - Conference proceedings

Subject(s) - mathematical optimization , polyhedron , convex hull , relaxation (psychology) , intersection (aeronautics) , binary number , feasible region , set (abstract data type) , optimization problem , cutting plane method , computer science , benchmark (surveying) , hull , mathematics , function (biology) , decomposition method (queueing theory) , relaxation technique , convex optimization , regular polygon , integer programming , combinatorics , discrete mathematics , arithmetic , biology , alternative medicine , aerospace engineering , pathology , engineering , psychology , social psychology , geometry , geodesy , evolutionary biology , programming language , medicine , marine engineering , geography

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research