Pages that link to "Item:Q1753509"

The following pages link to A new method for optimizing a linear function over the efficient set of a multiobjective integer program (Q1753509):

Displaying 28 items.

• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
• An improved algorithm to compute the \(\omega\)-primality (Q1996743) (← links)
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
• Biobjective optimization over the efficient set of multiobjective integer programming problem (Q2031318) (← links)
• An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program (Q2119757) (← links)
• Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
• Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (Q2286918) (← links)
• GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
• Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
• Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
• Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program (Q5009153) (← 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)
• Solving Multiobjective Mixed Integer Convex Optimization Problems (Q5131967) (← 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)
• Holistic fleet optimization incorporating system design considerations (Q6057031) (← links)
• Optimal hierarchical clustering on a graph (Q6065857) (← links)
• OOESAlgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming (Q6067899) (← links)
• A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
• Optimizing a linear function over the nondominated set of multiobjective integer programs (Q6091884) (← links)
• Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides (Q6145049) (← links)
• Optimization of a quadratic programming problem over an Integer efficient set (Q6145182) (← links)
• Parallel optimization over the integer efficient set (Q6187313) (← links)
• An exact method for solving the integer sum of linear ratios problem (Q6198512) (← links)