An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming

DOI10.1002/NAV.3800370305MaRDI QIDQ3468895zbMATH OpenOpenAlexFDO

Authors Yasemin Aksoy

Publication date 1990

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

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

zbMATH Keywords

interactive algorithmsinteractive branch-and-bound algorithmbicriterion nonconvex programminginteractive multiple objective decision making

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Management decision making, including multiple objectives (90B50) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Mixed integer programming (90C11)

Recommendations

• An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
• A class of practical interactive branch and bound algorithms for multicriteria integer programming
• scientific article; zbMATH DE number 3902394
• Interactive algorithms for multiple criteria nonlinear programming problems
• Algorithms for nonlinear integer bicriterion problems

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• A Survey of Methods for Pure Nonlinear Integer Programming
• A branch and bound algorithm for solving a class of nonlinear integer programming problems
• An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Applied Bi-objective programs
• Existence of efficient solutions for vector maximization problems
• On efficient sets in vector maximum problems - A brief survey
• Proper efficiency and the theory of vector maximization
• Solving Bicriterion Mathematical Programs
• Vector maximization with two objective functions

Cited in

(16)

• An improved algorithm for solving biobjective integer programs
• scientific article; zbMATH DE number 553773 (Why is no real title available?)
• On a constructive approximation of the efficient outcomes in bicriterion vector optimization
• scientific article; zbMATH DE number 3902394 (Why is no real title available?)
• scientific article; zbMATH DE number 124840 (Why is no real title available?)
• Comparative studies in interactive multiple objective mathematical programming
• Bicriteria integer quadratic programming problems
• An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
• A review of interactive methods for multiobjective integer and mixed-integer programming
• Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
• Fathoming rules for biobjective mixed integer linear programs: review and extensions
• Interactive bicriterion solution method and its application to critical path method problems
• Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
• An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
• A class of practical interactive branch and bound algorithms for multicriteria integer programming
• An interactive approach for biobjective integer programs under quasiconvex preference functions

This page was built for publication: An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming

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