Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization

DOI10.1016/j.ejor.2016.05.045zbMath1403.90612MaRDI QIDQ1753511

Laurent Granvilliers, Alexandre Goldsztejn, Christophe Jermann, Benjamin T. Martin

Publication date: 29 May 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.2016.05.045

zbMATH Keywords

nonlinear optimization; constraint propagation; biobjective optimization; interval branch \& bound

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C29: Multi-objective and goal programming

90C30: Nonlinear programming

Uses Software

• RealPaver
• INTOPT_90
• NBI
• gaol
• IbexOpt
• Numerica