Pages that link to "Item:Q1827646"

The following pages link to A method for finding the set of non-dominated vectors for multiple objective integer linear programs (Q1827646):

Displaying 50 items.

• The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
• 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)
• A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
• Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
• Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
• An interior proximal method in vector optimization (Q635150) (← links)
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
• An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
• SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) (← links)
• A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
• Multi-objective integer programming: a general approach for generating all non-dominated solutions (Q1042091) (← links)
• Effective algorithm to construct the set of nondominated alternatives of decomposable objects (Q1097176) (← links)
• A reduction algorithm for integer multiple objective linear programs (Q1278795) (← links)
• A multiple objective methodology for sugarcane harvest management with varying maturation periods (Q1615948) (← links)
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
• Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs (Q1753507) (← links)
• A new method for optimizing a linear function over the efficient set of a multiobjective integer program (Q1753509) (← links)
• Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming (Q1758882) (← links)
• Multiobjective integer nonlinear fractional programming problem: a cutting plane approach (Q1937858) (← links)
• Optimising a nonlinear utility function in multi-objective integer programming (Q1955541) (← 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)
• An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program (Q2119757) (← links)
• Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
• Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
• Multi-objective integer programming: an improved recursive algorithm (Q2251549) (← links)
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← links)
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems (Q2256164) (← links)
• An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems (Q2274869) (← links)
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (Q2286918) (← links)
• Empirical study of exact algorithms for the multi-objective spanning tree (Q2301151) (← links)
• An extension of the non-inferior set estimation algorithm for many objectives (Q2301933) (← links)
• GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← 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)
• Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
• Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs (Q2672116) (← links)
• Branch-and-bound and objective branching with three or more objectives (Q2676405) (← 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)
• A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme (Q2899069) (← links)
• Identifying efficient solutions in multiple objective integer monotone programs (Q2907857) (← links)