An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
From MaRDI portal
Publication:3722261
DOI10.1287/MNSC.32.1.61zbMATH Open0592.90057OpenAlexW2065319818MaRDI QIDQ3722261FDOQ3722261
Authors: Odile Marcotte, Richard M. Soland 
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
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
Management decision making, including multiple objectives (90B50) Sensitivity, stability, parametric optimization (90C31)
Cited In (36)
- An interactive graphic presentation for multiobjective linear programming.
- Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems
- Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interactive multiple objective optimization: Survey. I: Continuous case
- An interactive algorithm for multiple criteria constrained sorting problem
- An interactive approach for vector optimization problems
- Title not available (Why is that?)
- A comparative study of interactive tradeoff cutting plane methods for MOMP
- An improved interactive hybrid method for the linear multi-objective knapsack problem
- Complete efficiency and the initialization of algorithms for multiple objective programming
- Use of reference points for solving MONLP problems
- Title not available (Why is that?)
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- An algorithm for optimizing over the weakly-efficient set
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
- Unified interactive multiple objective programming
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- A review of interactive methods for multiobjective integer and mixed-integer programming
- Title not available (Why is that?)
- Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems
- Using efficient feasible directions in interactive multiple objective linear programming
- 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 branch and bound algorithm for mixed zero-one multiple objective linear programming
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- An interactive procedure for multiple objective integer linear programming problems
- Using ELECTRE TRI outranking method to sort MOMILP nondominated solutions.
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- Generalized polynomial decomposable multiple attribute utility functions for ranking and rating multiple criteria discrete alternatives.
- Using trade-off information in decision-making algorithms
- The design of multiactivity multifacility systems
- 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 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)
