Results 11 to 20 of about 814 (113)
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
MINIMUM COST NETWORK FLOWS: PROBLEMS, ALGORITHMS, AND SOFTWARE
, 2013 : We present a wide range of problems concerning minimum cost network flows, and give an overview of the classic linear single-commodity Minimum Cost Network Flow Problem (MCNFP) and some other closely related problems, either tractable or intractable ...
Angelo Sifaleras
semanticscholar +1 more source
A note on operators of deletion and contraction for antichains
International Journal of Mathematics and Mathematical Sciences, Volume 31, Issue 12, Page 725-729, 2002., 2002 The operators of deletion and contraction for clutters are generalized to those for antichains of finite bounded posets. A generalization of the result by Seymour (1976), describing the relationship between the operators of deletion, contraction, and the blocker map, is considered as a comparison in the lattice of antichains of a poset.
Andrey O. Matveev
wiley +1 more source
International Journal of Mathematics and Mathematical Sciences, Volume 26, Issue 10, Page 581-588, 2001., 2001 Antichains of a finite bounded poset are assigned antichains playing a role analogous to that played by blockers in the Boolean lattice of all subsets of a finite set. Some properties of lattices of generalized blockers are discussed.
Andrey O. Matveev
wiley +1 more source
AN ANNOTATED BIBLIOGRAPHY OF COMBINED ROUTING AND LOADING PROBLEMS
, 2013 : Transportation problems involving routing and loading at the same time are currently a hot topic in combinatorial optimization. The interest of researchers and practitioners is motivated by the intrinsic difficulty of this research area, which combines
M. Iori, S. Martello
semanticscholar +1 more source
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem [PDF]
, 2008 Particle Swarm Optimization is an evolutionary method inspired by the social behaviour of individuals inside swarms in nature. Solutions of the problem are modelled as members of the swarm which fly in the solution space.
AS Tanenbaum +19 more
core +2 more sources
Block-diagonal semidefinite programming hierarchies for 0/1 programming [PDF]
, 2007 Lovasz and Schrijver, and later Lasserre, proposed hierarchies of semidefinite programming relaxations for general 0/1 linear programming problems. In this paper these two constructions are revisited and two new, block-diagonal hierarchies are proposed ...
Balas +18 more
core +4 more sources
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