Pages that link to "Item:Q377734"

The following pages link to Finding all nondominated points of multi-objective integer programs (Q377734):

Displaying 44 items.

• The \(L\)-shape search method for triobjective integer programming (Q298165) (← 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)
• An interactive algorithm to find the most preferred solution of multi-objective integer programs (Q342783) (← links)
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← 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 branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• An interactive approximation algorithm for multi-objective integer programs (Q1652656) (← links)
• Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) (← links)
• On nadir points of multiobjective integer programming problems (Q1683328) (← links)
• An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (Q1734819) (← links)
• Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) (← links)
• Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores (Q1753430) (← links)
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs (Q1753507) (← links)
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
• Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
• Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
• Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
• Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
• Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← 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)
• 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)
• Finding nadir points in multi-objective integer programs (Q2350074) (← links)
• Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
• Multiobjective Integer Programming: Synergistic Parallel Approaches (Q3386777) (← links)
• Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches (Q4599312) (← links)
• Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
• Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
• A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs (Q5087716) (← links)
• Disjunctive Programming for Multiobjective Discrete Optimisation (Q5137948) (← links)
• A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs (Q5139635) (← links)
• Exact method based on solution space cut for bi-objective Seru production (Q6059586) (← links)
• A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising (Q6069770) (← links)
• A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
• Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)
• Optimizing a linear function over the nondominated set of multiobjective integer programs (Q6091884) (← links)
• Parallel optimization over the integer efficient set (Q6187313) (← links)