An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
From MaRDI portal
Publication:3468895
DOI10.1002/nav.3800370305zbMath0693.90085MaRDI QIDQ3468895
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
interactive algorithms; interactive branch-and-bound algorithm; bicriterion nonconvex programming; interactive multiple objective decision making
65K05: Numerical mathematical programming methods
90C11: Mixed integer programming
90C30: Nonlinear programming
90C31: Sensitivity, stability, parametric optimization
90B50: Management decision making, including multiple objectives
Related Items
A review of interactive methods for multiobjective integer and mixed-integer programming, Comparative studies in interactive multiple objective mathematical programming, On a constructive approximation of the efficient outcomes in bicriterion vector optimization, An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound, Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic, Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem, An improved algorithm for solving biobjective integer programs, Bicriteria integer quadratic programming problems, Unnamed Item
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