An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
From MaRDI portal
Publication:3722261
Recommendations
- scientific article; zbMATH DE number 124840
- scientific article; zbMATH DE number 2160606
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- Interactive algorithms for multiple criteria nonlinear programming problems
Cited in
(36)- scientific article; zbMATH DE number 3891122 (Why is no real title available?)
- Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems
- An interactive approach for vector optimization problems
- Using ELECTRE TRI outranking method to sort MOMILP nondominated solutions.
- 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 comparative study of interactive tradeoff cutting plane methods for MOMP
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- scientific article; zbMATH DE number 3902394 (Why is no real title available?)
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
- An algorithm for optimizing a linear function over an integer efficient set
- An improved interactive hybrid method for the linear multi-objective knapsack problem
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Unified interactive multiple objective programming
- Interactive multiple objective optimization: Survey. I: Continuous case
- An interactive procedure for multiple objective integer linear programming problems
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- Complete efficiency and the initialization of algorithms for multiple objective programming
- Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
- An interactive graphic presentation for multiobjective linear programming.
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- An interactive algorithm for multiple criteria constrained sorting problem
- Generalized polynomial decomposable multiple attribute utility functions for ranking and rating multiple criteria discrete alternatives.
- Use of reference points for solving MONLP problems
- Using efficient feasible directions in interactive multiple objective linear programming
- A review of interactive methods for multiobjective integer and mixed-integer programming
- An algorithm for optimizing over the weakly-efficient set
- Using trade-off information in decision-making algorithms
- scientific article; zbMATH DE number 124840 (Why is no real title available?)
- scientific article; zbMATH DE number 817543 (Why is no real title available?)
- The design of multiactivity multifacility systems
- scientific article; zbMATH DE number 4100971 (Why is no real title available?)
- Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration
- An interactive procedure using domination cones for bicriterion shortest path problems
This page was built for publication: An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3722261)
