An interactive method for bicriteria integer programming

DOI10.1109/21.52550MaRDI QIDQ3479810zbMATH OpenOpenAlexFDO

Authors

Publication date 1990

Published in IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/21.52550

zbMATH Keywords

multiobjective optimizationbicriteria integer programmingbicriteria probleminteractive solution framework

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 3891122
• scientific article; zbMATH DE number 553773
• A class of practical interactive branch and bound algorithms for multicriteria integer programming
• Algorithms for nonlinear integer bicriterion problems
• An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems

Cited in

(14)

• scientific article; zbMATH DE number 3891122 (Why is no real title available?)
• An intelligent algorithm for mixed-integer programming models
• An interactive approach for bi-attribute multi-item auctions
• A simulation based study of modifications to the Zionts-Wallenius algorithm for multiple objective linear programming
• Interactive bicriterion solution method and its application to critical path method problems
• A class of practical interactive branch and bound algorithms for multicriteria integer programming
• scientific article; zbMATH DE number 2000120 (Why is no real title available?)
• An improved algorithm for solving biobjective integer programs
• Interactive bicriterion decision support for a large scale industrial scheduling system
• A review of interactive methods for multiobjective integer and mixed-integer programming
• An interactive algorithm for multi-objective route planning
• An interactive approach for biobjective integer programs under quasiconvex preference functions
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
• Interactive approaches for biobjective problems with progressively changing solution sets

This page was built for publication: An interactive method for bicriteria integer programming

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