scientific article; zbMATH DE number 416862

MaRDI QIDQ3136016zbMATH OpenFDO

Authors Tihomir Hunjak

Publication date 22 September 1993

zbMATH Keywords

compromise efficient solutionmultiple criteria zero-one programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Integer programming (90C10) Boolean programming (90C09)

Recommendations

• Zero-one programming with multiple criteria
• On compromise solutions in multiple objective programming
• Interactive Compromise Programming
• scientific article; zbMATH DE number 3904325
• A combined approach to solve binary multicriteria problems

Cited in

(6)

• On compromise solutions in multiple objective programming
• A combined approach to solve binary multicriteria problems
• An analysis of six greedy selection rules on a class of zero-one integer programming models
• On efficient solutions of 0-1 multi-objective linear programming problems
• Zero-one programming with multiple criteria
• A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation

This page was built for publication:

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