Code and Data Repository for Exact and Approximate Schemes for Robust Optimization Problems with Decision-Dependent Information Discovery

This software aims to solve Robust Optimization problems with Decision-Dependent Information Discovery. It implements the exact algorithms and approximate formulations described in Exact and Approximate Scheme for Robust Optimization Problems with Decision Dependent Information Discovery to solve instances of the Sensor Placement Orienteering Problem and the Robust Shortest Path Problem with and without Decision-Dependent Information Discovery. The repository contains two project: the project in "project_1" folder solves the Sensor Placement Orienteering Problem using the exact algorithm and the K-Adaptability approximation, and the Robust Shortest Path Problem using the exact algorithm, while the project in "project_2" folder solves the Robust Shortest Path Problem using the K-Adaptability approximation.