Pages that link to "Item:Q1244175"

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to Vector maximization with two objective functions (Q1244175):

Displaying 22 items.

Exploring the trade-off between generalization and empirical errors in a one-norm SVM (Q439563) (← links)
SVM classification for imbalanced data sets using a multiobjective optimization framework (Q744712) (← links)
An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
Generating the weakly efficient set of nonconvex multiobjective problems (Q934803) (← links)
Characterizing the nondominated set by separable functions (Q1093551) (← links)
A graphical bicriteria approach to the resource allocation problem (Q1095044) (← links)
Bicriteria linear fractional programming (Q1148820) (← links)
An algorithm for bicriterion linear programming (Q1163481) (← links)
Optimization over the efficient set: Four special cases (Q1321439) (← links)
On a constructive approximation of the efficient outcomes in bicriterion vector optimization (Q1330805) (← links)
Efficient approximate representation of bi-objective tradeoff sets (Q1338659) (← links)
Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1579631) (← links)
Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464) (← links)
On a bicriterion server allocation problem in a multidimensional Erlang loss system (Q2453139) (← links)
Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks (Q2943828) (← links)
A note on bicriterion programming (Q3040940) (← links)
An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895) (← links)
(Q4963438) (← links)
Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)