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

DOI10.1002/nav.3800370305zbMath0693.90085OpenAlexW2171477831MaRDI QIDQ3468895

Yasemin Aksoy

Publication date: 1990

Published in: Naval Research Logistics (NRL) (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) Mixed integer programming (90C11) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50)

Related Items (10)

On a constructive approximation of the efficient outcomes in bicriterion vector optimization ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ An improved algorithm for solving biobjective integer programs ⋮ Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ Bicriteria integer quadratic programming problems ⋮ Fathoming rules for biobjective mixed integer linear programs: review and extensions ⋮ Unnamed Item ⋮ Comparative studies in interactive multiple objective mathematical programming ⋮ An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound

Cites Work

• Unnamed Item
• On efficient sets in vector maximum problems - A brief survey
• Vector maximization with two objective functions
• Existence of efficient solutions for vector maximization problems
• Proper efficiency and the theory of vector maximization
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Applied Bi-objective programs
• A branch and bound algorithm for solving a class of nonlinear integer programming problems
• A Survey of Methods for Pure Nonlinear Integer Programming
• An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
• Solving Bicriterion Mathematical Programs

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