Pages that link to "Item:Q427391"

The following pages link to A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391):

Displaying 27 items.

• The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
• Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming (Q343821) (← links)
• Characterizing coherence, correcting incoherence (Q473384) (← links)
• Primal and dual approximation algorithms for convex vector optimization problems (Q475807) (← links)
• A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
• An approximation algorithm for convex multi-objective programming problems (Q548180) (← links)
• A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
• Benson type algorithms for linear vector optimization and applications (Q743969) (← links)
• An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem (Q785628) (← links)
• Approximating the nondominated set of an MOLP by approximately solving its dual problem (Q999127) (← links)
• A graph-based algorithm for the multi-objective optimization of gene regulatory networks (Q1651738) (← links)
• Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
• Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming (Q1737503) (← links)
• The vector linear program solver Bensolve -- notes on theoretical background (Q1753500) (← links)
• A vector linear programming approach for certain global optimization problems (Q1756780) (← links)
• Tractability of convex vector optimization problems in the sense of polyhedral approximations (Q1756800) (← links)
• An a posteriori decision support methodology for solving the multi-criteria supplier selection problem (Q1991156) (← links)
• Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (Q2279398) (← links)
• A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle (Q2397431) (← links)
• A Benson type algorithm for nonconvex multiobjective programming problems (Q2408519) (← links)
• Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions (Q2423818) (← links)
• Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← links)
• Set Optimization—A Rather Short Introduction (Q2805754) (← links)
• PolySCIP (Q2819226) (← links)
• A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem (Q5244299) (← links)
• Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
• Algorithms to Solve Unbounded Convex Vector Optimization Problems (Q6076862) (← links)