Three methods for robust grading

DOI10.1016/j.ejor.2018.06.019zbMath1403.90521OpenAlexW2808960269WikidataQ129638605 ScholiaQ129638605MaRDI QIDQ1991142

Samuel Burer, Veronica Piccialli

Publication date: 30 October 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.06.019

zbMATH Keywords

branch-and-boundrobust optimizationhigher educationmixed-integer linear programminggrading

Mathematics Subject Classification ID

Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Nonconvex, lower semicontinuous piecewise linear optimization
• Robust optimization - a comprehensive survey
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• Theory and Applications of Robust Optimization
• Robust Optimization of Large-Scale Systems