mariannadesantis's repositories
MOMIX
a branch and bound method for multi-objective mixed integer convex optimization problems presented in the paper "SOLVING MULTIOBJECTIVE MIXED INTEGER CONVEX OPTIMIZATION PROBLEMS" by Marianna De Santis, Gabriele Eichfelder, Julia Niebling and Stefan Rocktaeschel - SIAM J. O PTIM . Vol. 30, No. 4, pp. 3122--3145, 2020
DEIA-BB
A branch-and-bound method for multiobjective mixed-integer convex quadratic programs that computes a superset of efficient integer assignments and a coverage of the nondominated set.
Language:MATLABGPL-3.0000
MST-Instances
Minimum Spanning Tree instances used in the manuscript "An oracle-based framework for robust combinatorial optimization"
GPL-3.0000