Pages that link to "Item:Q3722261"
From MaRDI portal
The following pages link to An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization (Q3722261):
Displaying 34 items.
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- An interactive algorithm to find the most preferred solution of multi-objective integer programs (Q342783) (← links)
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup (Q420862) (← links)
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem (Q625647) (← links)
- Interactive multiple objective optimization: Survey. I: Continuous case (Q750284) (← links)
- A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
- Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems (Q1075943) (← links)
- A class of practical interactive branch and bound algorithms for multicriteria integer programming (Q1075953) (← links)
- An algorithm for optimizing over the weakly-efficient set (Q1077330) (← links)
- Use of reference points for solving MONLP problems (Q1129974) (← links)
- The design of multiactivity multifacility systems (Q1171982) (← links)
- Using efficient feasible directions in interactive multiple objective linear programming (Q1178731) (← links)
- Complete efficiency and the initialization of algorithms for multiple objective programming (Q1183391) (← links)
- A comparative study of interactive tradeoff cutting plane methods for MOMP (Q1197943) (← links)
- An interactive approach for vector optimization problems (Q1266670) (← links)
- InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem (Q1266716) (← links)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming (Q1296117) (← links)
- An interactive procedure for multiple objective integer linear programming problems (Q1309911) (← links)
- An interactive procedure using domination cones for bicriterion shortest path problems (Q1317170) (← links)
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← links)
- Unified interactive multiple objective programming (Q1333543) (← links)
- An improved interactive hybrid method for the linear multi-objective knapsack problem (Q1374024) (← links)
- Using ELECTRE TRI outranking method to sort MOMILP nondominated solutions. (Q1417513) (← links)
- Generalized polynomial decomposable multiple attribute utility functions for ranking and rating multiple criteria discrete alternatives. (Q1569102) (← links)
- An interactive algorithm for multiple criteria constrained sorting problem (Q1615969) (← links)
- An interactive graphic presentation for multiobjective linear programming. (Q1855057) (← links)
- Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems (Q1869533) (← links)
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
- Using trade-off information in decision-making algorithms (Q1968590) (← links)
- An algorithm for optimizing a linear function over an integer efficient set (Q2378378) (← links)
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895) (← links)
- (Q3826375) (← links)
- (Q4854915) (← links)
- Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration (Q4911457) (← links)
