Pages that link to "Item:Q1406960"

The following pages link to Computation of ideal and Nadir values and implications for their use in MCDM methods. (Q1406960):

Displaying 37 items.

• On the use of the \(L_{p}\) distance in reference point-based approaches for multiobjective optimization (Q256671) (← links)
• Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics (Q301311) (← links)
• Biobjective robust optimization over the efficient set for Pareto set reduction (Q322934) (← links)
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
• Characterizing coherence, correcting incoherence (Q473384) (← links)
• A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
• Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
• Application of a hybrid intelligent decision support model in logistics outsourcing (Q883583) (← links)
• Variable preference modeling with ideal-symmetric convex cones (Q960117) (← links)
• NAUTILUS method: an interactive technique in multiobjective optimization based on the Nadir point (Q976332) (← links)
• An exact method for computing the nadir values in multiple objective linear programming (Q1027447) (← links)
• Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
• On nadir points of multiobjective integer programming problems (Q1683328) (← links)
• Multi-objective branch and bound (Q1753506) (← links)
• A new method for optimizing a linear function over the efficient set of a multiobjective integer program (Q1753509) (← links)
• Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy (Q1785231) (← links)
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011) (← links)
• Incorporating preferential weights as a benchmark into a sequential reference point method (Q2030713) (← links)
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← links)
• Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming (Q2257085) (← links)
• Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming (Q2267661) (← links)
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
• Finding nadir points in multi-objective integer programs (Q2350074) (← links)
• Computing the nadir point for multiobjective discrete optimization problems (Q2350075) (← links)
• A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm (Q2350076) (← links)
• \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems (Q2379522) (← links)
• A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times (Q2432854) (← links)
• On the number of non-dominated points of a multicriteria optimization problem (Q2446874) (← links)
• Heuristic for a new multiobjective scheduling problem (Q2463826) (← links)
• Interactive decision support in radiation therapy treatment planning (Q2481567) (← links)
• Best compromise solution for a new multiobjective scheduling problem (Q2489291) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
• The Need for and Possible Methods of Objective Ranking (Q3058459) (← links)
• Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem (Q3649594) (← links)
• Advanced network connectivity features and zonal requirements in covering location problems (Q6047840) (← links)
• Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)