Pages that link to "Item:Q429651"

The following pages link to A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651):

Displaying 46 items.

• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• On the representation of the search region in multi-objective optimization (Q319674) (← links)
• A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
• An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019) (← links)
• Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
• A review of multiobjective programming and its application in quantitative psychology (Q645494) (← links)
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← 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)
• Guided moth-flame optimiser for multi-objective optimization problems (Q828882) (← links)
• A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
• Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
• A box decomposition algorithm to compute the hypervolume indicator (Q1652179) (← links)
• Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
• Multi-objective branch and bound (Q1753506) (← links)
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
• Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization (Q1753511) (← 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)
• An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
• Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects (Q2040606) (← links)
• Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← 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)
• 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)
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← 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)
• Multi-modal cargo logistics distribution problem: decomposition of the stochastic risk-averse models (Q2668704) (← 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)
• Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem (Q3649594) (← links)
• MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS (Q5036170) (← links)
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
• Monomial Tropical Cones for Multicriteria Optimization (Q5112824) (← links)
• Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming (Q5131728) (← links)
• Disjunctive Programming for Multiobjective Discrete Optimisation (Q5137948) (← links)
• Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
• A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs (Q5139635) (← links)
• Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)
• Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
• Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)