Cited in
(18)- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- SNDlib
- DSJM
- KeTCindy
- Pycao
- SIROCCO
- AmplNLWriter
- GEKKO
- strIPlib
- Structure-based decomposition for pattern-detection for railway timetables
- Adaptive-Cutsel-MILP
- Mathematical software -- ICMS 2016. 5th international conference, Berlin, Germany, July 11--14, 2016. Proceedings
- Embedding of complete graphs in broken Chimera graphs
- Computational aspects of relaxation complexity: possibilities and limitations
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
- relaxation_complexity
- Learning to sparsify travelling salesman problem instances
This page was built for software: PySCIPOpt
