Results 21 to 30 of about 159,025 (301)
Graph Bisection with Pareto Optimization [PDF]
ACM Journal of Experimental Algorithmics, 2015 We introduce FlowCutter, a novel algorithm to compute a set of edge cuts or node separators that optimize cut size and balance in the Pareto sense. Our core algorithm heuristically solves the balanced connected st -edge-cut problem, where two given nodes s and t must ...
Hamann, Michael, Strasser, Ben
openaire +6 more sources
Singular Continuation: Generating Piece-wise Linear Approximations to Pareto Sets via Global Analysis [PDF]
, 2011 We propose a strategy for approximating Pareto optimal sets based on the global analysis framework proposed by Smale (Dynamical systems, New York, 1973, pp. 531-544). The method highlights and exploits the underlying manifold structure of the Pareto sets,
Alberto Lovison, Debreu G.
core +2 more sources
Pareto Optimal Pension Risk Allocations [PDF]
De Economist, 2022 AbstractWe consider a funded pension system where collective risks, in a simple Black-Scholes financial market, are allocated to the retirement savings of individual participants. In particular, we consider an allocation in such a way that the relative effect on total retirement wealth, that is, the sum of financial wealth and human capital, is the ...
Sander Muns, Bas J. M. Werker
openaire +1 more source
Abstract and Applied Analysis, 2013 In general Banach spaces, we consider a vector optimization problem (SVOP) in which the objective is a set-valued mapping whose graph is the union of finitely many polyhedra or the union of finitely many generalized polyhedra.
Qinghai He, Weili Kong
doaj +1 more source
Stability of Pareto-Optimal Allocations of Resources to Activities [PDF]
Modeling, Identification and Control, 1986 A concept of stability is introduced for the Pareto-optimal solutions of a vector-valued problem of the allocation of resources to activities, and characterized by a property which is independent of uncertainties in the efficiency matrix of the ...
Kåre M. Mjelde
doaj +1 more source
MODIFICATION OF FIREWORKS METHOD FOR MULTIOBJECTIVE OPTIMIZATION BASED ON NON-DOMINATED SORTING
Научный вестник МГТУ ГА, 2019 The article suggests a modification for numerical fireworks method of the single-objective optimization for solving the problem of multiobjective optimization. The method is metaheuristic.
A. V. Panteleev, A. U. Krychkov
doaj +1 more source
Distributed Interval Optimization Over Time-Varying Networks: A Numerical Programming Perspective
IEEE Access, 2023 In this study, we investigate a distributed interval optimization problem involving agents linked by a time-varying network, optimizing interval objective functions under global convex constraints.
Yinghui Wang +3 more
doaj +1 more source
Size versus truthfulness in the House Allocation problem [PDF]
, 2019 We study the House Allocation problem (also known as the Assignment problem), i.e., the problem of allocating a set of objects among a set of agents, where each agent has ordinal preferences (possibly involving ties) over a subset of the objects.
Krysta, Piotr +3 more
core +3 more sources
Pareto Optimal Coalitions of Fixed Size
Journal of Mechanism and Institution Design, 2019 We tackle the problem of partitioning players into groups of fixed size, such as allocating eligible students to shared dormitory rooms. Each student submits preferences over the other individual students.
Ágnes Cseh +2 more
doaj +1 more source
Finding algorithm of optimal subset structure based on the Pareto layers in the knapsack problem
Журнал Белорусского государственного университета: Математика, информатика, 2020 An algorithm is developed for finding the structure of the optimal subset in the knapsack problem based on the proposed multicriteria optimization model.
Sergey V. Chebakov +1 more
doaj +1 more source