A combined approach to solve binary multicriteria problems

DOI10.1002/NAV.3800290202MaRDI QIDQ3321854zbMATH OpenOpenAlexFDO

Authors Gabriel Bitran, Jorge Rivera

Publication date 1982

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800290202

zbMATH Keywords

computational resultsefficient points in zero-one multiple criteria problemsfacility locationimplicit enumeration algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Boolean programming (90C09) Sensitivity, stability, parametric optimization (90C31) Applications of mathematical programming (90C90)

Recommendations

• Zero-one programming with multiple criteria
• scientific article; zbMATH DE number 416862
• scientific article; zbMATH DE number 3891122
• scientific article; zbMATH DE number 3904325
• Facility location problem on a network under multiple criteria—fuzzy set theoretic approach

Cited in

(15)

• Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems
• An algorithm for the bi-criterion integer programming problem
• Drilling strategies for frontier areas
• Facility siting and integer-friendly programming
• Fathoming rules for biobjective mixed integer linear programs: review and extensions
• The search-and-remove algorithm for biobjective mixed-integer linear programming problems
• A multiplicative best-worst method for multi-criteria decision making
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• scientific article; zbMATH DE number 416862 (Why is no real title available?)
• A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method
• An algorithm for a multicriteria optimization problem and its application to a facility location problem
• A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising
• Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
• A review of interactive methods for multiobjective integer and mixed-integer programming
• Bound sets for biobjective combinatorial optimization problems

This page was built for publication: A combined approach to solve binary multicriteria problems

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