Biobjective optimization over the efficient set of multiobjective integer programming problem

DOI10.3934/jimo.2019102zbMath1474.90400OpenAlexW2978691447MaRDI QIDQ2031318

Yasmine Cherfaoui, Mustapha Moulaï

Publication date: 9 June 2021

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2019102

zbMATH Keywords

integer programmingmultiobjective programmingbranch-and-cut

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29)

Related Items (1)

Holistic fleet optimization incorporating system design considerations

Cites Work

• Optimization over the efficient set: overview
• An exact method for a discrete multiobjective linear fractional optimization
• Generating all maximal efficient faces for multiple objective linear programs
• Optimizing a linear function over an efficient set
• Optimizing a linear fractional function over the integer efficient set
• Fathoming rules for biobjective mixed integer linear programs: review and extensions
• A new method for optimizing a linear function over the efficient set of a multiobjective integer program
• An algorithm for optimizing a linear function over an integer efficient set
• Optimizing a linear function over an integer efficient set
• Finding all efficient extreme points for multiple objective linear programs
• A revised simplex method for linear multiple objective programs
• Optimization over the efficient set

This page was built for publication: Biobjective optimization over the efficient set of multiobjective integer programming problem