Results 11 to 20 of about 789 (94)
The polytope of all triangulations of a point configuration
Documenta Mathematica, 1996 We study the convex hull P A of the 0-1 incidence vectors of all triangulations of a point con guration A. This was called the universal polytope in [4]. The a ne span of P A is described in terms of the cocircuits of the oriented matroid of A.
J. D. Loera +3 more
semanticscholar +1 more source
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
Mobility offer allocations in corporate settings
EURO Journal on Computational Optimization, 2021 Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use ...
Sebastian Knopp +2 more
doaj +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
Extended blocker, deletion, and contraction maps on antichains
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 10, Page 607-616, 2003., 2003 Families of maps on the lattice of all antichains of a finite bounded poset that extend the blocker, deletion, and contraction maps on clutters are considered. Influence of the parameters of the maps is investigated. Order‐theoretic extensions of some principal relations for the set‐theoretic blocker, deletion, and contraction maps on clutters are ...
Andrey O. Matveev
wiley +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
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
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
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