Results 21 to 30 of about 789 (94)
EURO Journal on Computational Optimization, 2018 An instance of a balanced optimization problem with vector costs consists of a ground set X, a cost-vector for every element of X, and a system of feasible subsets over X.
AnnetteM.C. Ficker +2 more
doaj +1 more source
M^♮-convexity and ultramodularity on integer lattice
, 2015 Ultramodular functions defined on a subset of a finite dimensional Euclidean space is a class of functions that generalizes the scalar convexity. On the other hand, M -convex functions defined on a subset of integer lattice form a class of integrally ...
Sumbul Azeem, R. Farooq
semanticscholar +1 more source
Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks [PDF]
Computer Science Journal of Moldova, 2005 The game-theoretic formulation of the multiobjective multicommodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
Robust combinatorial optimization under budgeted–ellipsoidal uncertainty
EURO Journal on Computational Optimization, 2018 In the field of robust optimization, uncertain data are modeled by uncertainty sets which contain all relevant outcomes of the uncertain problem parameters. The complexity of the related robust problem depends strongly on the shape of the chosen set. Two
Jannis Kurtz
doaj +1 more source
On stability in game problems of finding Nash set [PDF]
Computer Science Journal of Moldova, 2005 A finite game of several players in the case of linear payoff functions is considered. Stability of the problem of finding the set of Nash equilibrium situations is investigated.
Sergey E. Bukhtoyarov, Kirill G. Kuzmin
doaj
A greedy algorithm for interval greedoids
Open Mathematics, 2018 We show that the greedy algorithm provided in this paper works for interval greedoids with positive weights under some conditions, and also characterize an exchangeable system to be an interval greedoid with the assistance of the greedy algorithm.
Mao Hua
doaj +1 more source
Improved integral simplex using decomposition for the set partitioning problem
EURO Journal on Computational Optimization, 2018 Integral simplex using decomposition (ISUD) is a method that efficiently solves set partitioning problems. It is an iterative method that starts from a known integer solution and moves through a sequence of integer solutions, decreasing the cost at each ...
Abdelouahab Zaghrouti +2 more
doaj +1 more source
Low-Degree Spanning Trees of Small Weight [PDF]
, 1996 The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation algorithm ...
Balaji Raghavachari +3 more
core +6 more sources
An exact approach for the multi-constraint graph partitioning problem
EURO Journal on Computational Optimization, 2020 In this work, a multi-constraint graph partitioning problem is introduced. The input is an undirected graph with costs on the edges and multiple weights on the nodes. The problem calls for a partition of the node set into a fixed number of clusters, such
Diego Recalde, Ramiro Torres, Polo Vaca
doaj +1 more source
PANDA: a software for polyhedral transformations
EURO Journal on Computational Optimization, 2015 In this paper, we present the software Parallel AdjaceNcy Decomposition Algorithm (PANDA), an efficient implementation of the vertex and facet enumeration problem for polyhedra. The software is based on the double description method. Special features are
Stefan Lörwald, Gerhard Reinelt
doaj +1 more source