Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
Author(s) -
Ayşe N. Arslan,
Boris Detienne
Publication year - 2021
Publication title -
informs journal on computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.403
H-Index - 80
eISSN - 1526-5528
pISSN - 1091-9856
DOI - 10.1287/ijoc.2021.1061
Subject(s) - binary number , mathematical optimization , relaxation (psychology) , computer science , class (philosophy) , optimization problem , lagrangian relaxation , completeness (order theory) , robust optimization , mathematics , algorithm , artificial intelligence , psychology , social psychology , mathematical analysis , arithmetic
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom