An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
From MaRDI portal
Publication:3722261
DOI10.1287/mnsc.32.1.61zbMath0592.90057OpenAlexW2065319818MaRDI QIDQ3722261
Richard M. Soland, Odile Marcotte
Publication date: 1986
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.32.1.61
Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50)
Related Items
A class of practical interactive branch and bound algorithms for multicriteria integer programming ⋮ An algorithm for optimizing over the weakly-efficient set ⋮ Unified interactive multiple objective programming ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ An algorithm for optimizing a linear function over an integer efficient set ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ An interactive algorithm to find the most preferred solution of multi-objective integer programs ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ An improved interactive hybrid method for the linear multi-objective knapsack problem ⋮ Use of reference points for solving MONLP problems ⋮ Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem ⋮ A mathematical programming approach to the computation of the omega invariant of a numerical semigroup ⋮ Using ELECTRE TRI outranking method to sort MOMILP nondominated solutions. ⋮ The design of multiactivity multifacility systems ⋮ Using efficient feasible directions in interactive multiple objective linear programming ⋮ Complete efficiency and the initialization of algorithms for multiple objective programming ⋮ Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration ⋮ A comparative study of interactive tradeoff cutting plane methods for MOMP ⋮ Interactive multiple objective optimization: Survey. I: Continuous case ⋮ An interactive approach for vector optimization problems ⋮ Generalized polynomial decomposable multiple attribute utility functions for ranking and rating multiple criteria discrete alternatives. ⋮ A branch and bound algorithm for mixed zero-one multiple objective linear programming ⋮ An interactive graphic presentation for multiobjective linear programming. ⋮ An interactive procedure for multiple objective integer linear programming problems ⋮ An interactive procedure using domination cones for bicriterion shortest path problems ⋮ A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
