Pages that link to "Item:Q872117"

The following pages link to A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117):

Displaying 33 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics (Q301311) (← links)
• On the representation of the search region in multi-objective optimization (Q319674) (← links)
• A multi-criteria approach for hospital capacity analysis (Q323555) (← links)
• A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
• Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
• On the quality of discrete representations in multiple objective programming (Q374696) (← links)
• Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
• Generating equidistant representations in biobjective programming (Q429518) (← links)
• Optimization of a linear function over the set of stochastic efficient solutions (Q744262) (← links)
• Multi-objective integer programming: a general approach for generating all non-dominated solutions (Q1042091) (← links)
• A multiple objective methodology for sugarcane harvest management with varying maturation periods (Q1615948) (← links)
• Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
• Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
• An improved algorithm to compute the \(\omega\)-primality (Q1996743) (← links)
• An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
• New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
• Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
• Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems (Q2256164) (← links)
• Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization (Q2297563) (← links)
• A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem (Q2337383) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• An algorithm for optimizing a linear function over an integer efficient set (Q2378378) (← links)
• Computing representations using hypervolume scalarizations (Q2669609) (← links)
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
• A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level (Q2821098) (← links)
• The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program (Q2865174) (← links)
• Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming (Q3598043) (← links)
• An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function (Q3621972) (← links)
• Optimization Over Stochastic Integer Efficient Set (Q4596155) (← links)
• A linear fractional optimization over an integer efficient set (Q5247690) (← links)
• Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)