Pages that link to "Item:Q1753500"

The following pages link to The vector linear program solver Bensolve -- notes on theoretical background (Q1753500):

Displaying 24 items.

• Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming (Q343821) (← links)
• A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
• A set optimization approach to zero-sum matrix games with multi-dimensional payoffs (Q1631178) (← links)
• A graph-based algorithm for the multi-objective optimization of gene regulatory networks (Q1651738) (← links)
• Cone distribution functions and quantiles for multivariate random variables (Q1661335) (← 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)
• Locating a semi-obnoxious facility in the special case of Manhattan distances (Q2009180) (← links)
• Computation of quantile sets for bivariate ordered data (Q2076122) (← links)
• Incomplete risk-preference information in portfolio decision analysis (Q2079418) (← links)
• Convex projection and convex multi-objective optimization (Q2141728) (← links)
• A norm minimization-based convex vector optimization algorithm (Q2156397) (← links)
• Efficient allocation of resources to a portfolio of decision making units (Q2184153) (← links)
• Solving polyhedral d.c. optimization problems via concave minimization (Q2200081) (← links)
• The polyhedral projection problem (Q2304906) (← links)
• Multi-criteria decision making via multivariate quantiles (Q2304907) (← links)
• A new exact method for linear bilevel problems with multiple objective functions at the lower level (Q2673580) (← links)
• Inner approximation algorithm for solving linear multiobjective optimization problems (Q5009156) (← links)
• Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver (Q5198001) (← links)
• Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems (Q5883318) (← links)
• Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
• A matheuristic for tri-objective binary integer linear programming (Q6065590) (← links)
• Algorithms to Solve Unbounded Convex Vector Optimization Problems (Q6076862) (← links)
• Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) (← links)