

RobRecSolver.jl

RobRecSolver is a package written in a Julia programming language developed to test performance of algorithms proposed in Robust recoverable 0-1 optimization problems under polyhedral uncertainty (Mikita Hradovich, Adam Kasperski, Pawel Zielinski) which is available as preprint on arxiv.org. This work will later be referenced as publication. It's is highly desirable to read the it before starting to use this package.

Installing RobRecSolver

If you are familiar with Julia you can quickly install RobRecSolver and CPLEX:

julia> Pkg.add("CPLEX")
julia> Pkg.clone("https://github.com/nikagra/RobRecSolver.jl.git")

Note: You need a working installation of CPLEX Optimizer. See Getting CPLEX Optimizer for more information.

Contents

• Installation Guide
  • Getting Julia
  • Getting CPLEX Optimizer
  • Getting RobRecSolver
  • Updating RobRecSolver
• Reference
  • Problems
    • Incremental Problem
    • Evaluation Problem
    • Recoverable Problem
    • Adversarial Problem
    • Selection Lower Bound
    • Lagrangian Lower Bound
  • Additional Types and functions
  • Utilities
• Experiments
  • Problems
  • Testing Framework

Citing

You can cite the publication by using the following BibTeX snippet:

@article{hradovich2018robust,
  title={Robust recoverable 0-1 optimization problems under polyhedral uncertainty},
  author={Hradovich, Mikita and Kasperski, Adam and Zielinski, Pawel},
  journal={arXiv preprint arXiv:1811.06719},
  year={2018}
}

Acknowledgements

This project was supported by the National Center for Science (Narodowe Centrum Nauki), grant 2017/25/B/ST6/00486.