Pages that link to "Item:Q2379522"

The following pages link to \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems (Q2379522):

Displaying 22 items.

• The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
• A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
• A graph-based algorithm for the multi-objective optimization of gene regulatory networks (Q1651738) (← links)
• A hybrid approach for biobjective optimization (Q1662163) (← 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)
• 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)
• Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← 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)
• Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
• A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (Q2815467) (← links)
• Multiobjective Integer Programming: Synergistic Parallel Approaches (Q3386777) (← links)
• Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
• An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (Q5247677) (← links)
• Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)
• A simple, efficient and versatile objective space algorithm for multiobjective integer programming (Q6616283) (← links)