Pages that link to "Item:Q2379880"

The following pages link to A discussion of scalarization techniques for multiple objective integer programming (Q2379880):

Displaying 45 items.

• The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
• An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019) (← links)
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
• A review of multiobjective programming and its application in quantitative psychology (Q645494) (← links)
• SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) (← links)
• Constrained optimization using multiple objective programming (Q878220) (← links)
• Multi-objective integer programming: a general approach for generating all non-dominated solutions (Q1042091) (← links)
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
• Dominance for multi-objective robust optimization concepts (Q1622793) (← links)
• Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage (Q1652674) (← links)
• Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) (← links)
• Min-ordering and max-ordering scalarization methods for multi-objective robust optimization (Q1713738) (← links)
• A new conceptual framework for the therapy by optimized multidimensional pulses of therapeutic activity. The case of multiple myeloma model (Q1714202) (← links)
• An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (Q1734819) (← links)
• Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market (Q1744521) (← links)
• Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← 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)
• An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem (Q1761771) (← links)
• A multiple criteria ranking method based on game cross-evaluation approach (Q1761932) (← links)
• Dynamic multiple criteria decision making in changeable spaces: from habitual domains to innovation dynamics (Q1761934) (← links)
• Optimising a nonlinear utility function in multi-objective integer programming (Q1955541) (← links)
• Efficiency status of a feasible solution in the multi-objective integer linear programming problems: a DEA methodology (Q2009674) (← links)
• Efficient fair principal component analysis (Q2102413) (← links)
• Bi-objective design-for-control of water distribution networks with global bounds (Q2138314) (← links)
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
• A data-driven approach for supply chain network design under uncertainty with consideration of social concerns (Q2173127) (← links)
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← links)
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems (Q2256164) (← links)
• Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization (Q2297563) (← links)
• Clustering and portfolio selection problems: a unified framework (Q2297578) (← links)
• GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
• Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches (Q4599312) (← links)
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
• Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
• Optimization of a linear function over an integer efficient set (Q6059580) (← links)
• Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
• Aggregation with dependencies: capacities and fuzzy integrals (Q6079437) (← links)
• Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests (Q6080592) (← links)
• Optimization of a quadratic programming problem over an Integer efficient set (Q6145182) (← links)
• Relaxations and duality for multiobjective integer programming (Q6608043) (← links)
• On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem (Q6616276) (← links)
• A simple, efficient and versatile objective space algorithm for multiobjective integer programming (Q6616283) (← links)