Pages that link to "Item:Q2899069"

The following pages link to A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme (Q2899069):

Displaying 45 items.

• Graphical exploration of the weight space in three-objective mixed integer linear programs (Q320624) (← links)
• A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
• Choquet optimal set in biobjective combinatorial optimization (Q336494) (← links)
• A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391) (← links)
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
• On the effects of combining objectives in multi-objective optimization (Q494690) (← links)
• A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
• An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem (Q785628) (← links)
• SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) (← links)
• Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
• Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems (Q1652447) (← links)
• On nadir points of multiobjective integer programming problems (Q1683328) (← links)
• Multi-objective branch and bound (Q1753506) (← links)
• The search-and-remove algorithm for biobjective mixed-integer linear programming problems (Q1754323) (← 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)
• Finding multi-objective supported efficient spanning trees (Q2028494) (← links)
• Multi-objective integer programming: an improved recursive algorithm (Q2251549) (← links)
• An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems (Q2274869) (← links)
• GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
• Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions (Q2423818) (← links)
• Computing representations using hypervolume scalarizations (Q2669609) (← links)
• A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (Q2815467) (← links)
• PolySCIP (Q2819226) (← links)
• Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems (Q3452793) (← links)
• Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem (Q3649594) (← links)
• Disjunctive Programming for Multiobjective Discrete Optimisation (Q5137948) (← links)
• A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems (Q5326806) (← links)
• Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)
• Optimization of a linear function over an integer efficient set (Q6059580) (← links)
• Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
• Computing efficiently the nondominated subset of a set sum (Q6080591) (← links)
• Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)
• Ordinal optimization through multi-objective reformulation (Q6096566) (← links)
• Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) (← links)
• Optimization of a quadratic programming problem over an Integer efficient set (Q6145182) (← links)
• Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems (Q6162512) (← links)
• Weight set decomposition for weighted rank and rating aggregation: an interpretable and visual decision support tool (Q6194474) (← links)
• The biobjective minimum-cost perfect matching problem and Chinese postman problem (Q6495384) (← links)
• Relaxations and duality for multiobjective integer programming (Q6608043) (← links)
• The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems (Q6614703) (← links)
• Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)
• A fast and robust algorithm for solving biobjective mixed integer programs (Q6616277) (← links)
• An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems (Q6616278) (← links)