Results 11 to 20 of about 790 (89)
On the rank functions of $\mathcal{H}$-matroids [PDF]
Journal of Algebra Combinatorics Discrete Structures and Applications, 2016 The notion of $\mathcal{H}$-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a general model for matroids and the greedy algorithm. They gave a characterization of $\mathcal{H}$-matroids by the greedy algorithm. In this note, we give a characterization of some $\mathcal{H}$-matroids by rank functions.
Sano, Yoshio
openaire +6 more sources
Approximate modularity: Kalton's constant is not smaller than 3 [PDF]
, 2020 Kalton and Roberts [Trans. Amer. Math. Soc., 278 (1983), 803--816] proved that there exists a universal constant $K\leqslant 44.5$ such that for every set algebra $\mathcal{F}$ and every 1-additive function $f\colon \mathcal{F}\to \mathbb R$ there exists
Gnacik, Michal +2 more
core +2 more sources
Packing a bin online to maximize the total number of items [PDF]
, 1996 A bin of capacity 1 and a nite sequence of items of\ud sizes a1; a2; : : : are considered, where the items are given one by one\ud without information about the future.
Faigle, Ulrich, Kern, Walter
core +3 more sources
A linear time algorithm for a variant of the max cut problem in series parallel graphs [PDF]
, 2017 Given a graph $G=(V, E)$, a connected sides cut $(U, V\backslash U)$ or $\delta (U)$ is the set of edges of E linking all vertices of U to all vertices of $V\backslash U$ such that the induced subgraphs $G[U]$ and $G[V\backslash U]$ are connected.
Chaourar, Brahim
core +3 more sources
On some interconnections between combinatorial optimization and extremal graph theory [PDF]
, 2004 The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set.
Cvetković Dragoš M. +2 more
core +1 more source
On stability of a Pareto-optimal solution under perturbations of the parameters for a multicriteria combinatorial partition problem [PDF]
Computer Science Journal of Moldova, 2008 We consider a multicriteria variant for the well-known partition problem. A formula of the stability radius for an efficient solution was obtained. Mathematics Subject Classification 2000: 90C27, 90C29, 90C31.
V.A. Emelichev, E.E. Gurevsky
doaj
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
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
NEW EFFICIENT ALGORITHMS FOR MINIMIZATION OF NON-LINEAR FUNCTIONS
, 2013 In this paper, we suggest two new algorithms for minimization of nonlinear functions. Then the comparative study of the new algorithms with the Newton’s algorithm is established by means of examples.
K. Karthikeyan
semanticscholar +1 more source
Valid inequalities and cutting planes for some polytopes
, 1998 In this paper we consider multidimensional knapsack polytope. Some important concepts and preliminaries are given at the beginning. Then we give a result connected with valid and dominating inequalities for this polytope, and a modular arithmetic ...
S. Stefanov
semanticscholar +1 more source