A branch and bound method for multi-objective Boolean problems

DOI10.1016/0377-2217(84)90056-0MaRDI QIDQ593985zbMATH OpenOpenAlexFDO

Authors D. J. White

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0377-2217(84)90056-0

zbMATH Keywords

branch and bound methodportfolio selection

Mathematics Subject Classification ID

Boolean programming (90C09) Sensitivity, stability, parametric optimization (90C31)

Cites work

• An Imbedding Approach to Additive Value Zero-One Problems
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• Kernels of Preference Structures
• Multiobjective programming and penalty functions

Cited in

(5)

• Multiobjective programming and penalty functions
• Zero-one programming with multiple criteria
• Vector maximisation and lagrange multipliers
• A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising
• A review of interactive methods for multiobjective integer and mixed-integer programming

This page was built for publication: A branch and bound method for multi-objective Boolean problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q593985)