Results 31 to 40 of about 339 (75)
The heptagon-wheel cocycle in the Kontsevich graph complex [PDF]
, 2017 The real vector space of non-oriented graphs is known to carry a differential graded Lie algebra structure. Cocycles in the Kontsevich graph complex, expressed using formal sums of graphs on $n$ vertices and $2n-2$ edges, induce -- under the orientation ...
Buring, Ricardo +2 more
core +2 more sources
Robust flows with adaptive mitigation
EURO Journal on Computational Optimization, 2021 We consider an adjustable robust optimization problem arising in the area of supply chains: given sets of suppliers and demand nodes, we wish to find a flow that is robust with respect to failures of the suppliers.
Heiner Ackermann +2 more
doaj
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
Pebbling in Semi-2-Trees [PDF]
, 2017 Graph pebbling is a network model for transporting discrete resources that are consumed in transit. Deciding whether a given configuration on a particular graph can reach a specified target is ${\sf NP}$-complete, even for diameter two graphs, and ...
Alcón, Liliana +2 more
core +3 more sources
Veterinary Dermatology, Volume 36, Issue 1, Page 74-82, February 2025.Background — Anal sac impaction is common in dogs and manual expression may be effective, yet recurrence remains a problem. To facilitate physiological emptying of the sacs, it is important to maintain a bulky stool consistency. Objectives — The study evaluated if supplementation with ProGlan, a complementary feed containing Bacillus velezensis C‐3102 ...
Marta Salichs +2 more
wiley +1 more source
Lower and upper bounds of shortest paths in reachability graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 57, Page 3023-3036, 2004., 2004 We prove the following property for safe marked graphs, safe conflict‐free Petri nets, and live and safe extended free‐choice Petri nets. We prove the following three results. If the Petri net is a marked graph, then the length of the shortest path is at most (|T| − 1) · |T|/2.
P. K. Mishra
wiley +1 more source
Method for solving a convex integer programming problem
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 44, Page 2829-2834, 2003., 2003 We consider a convex integer program which is a nonlinear version of the assignment problem. This problem is reformulated as an equivalent problem. An algorithm for solving the original problem is suggested which is based on solving the simple assignment problem via some of known algorithms.
Stefan M. Stefanov
wiley +1 more source
Optimum matchings in weighted bipartite graphs [PDF]
, 2014 Given an integer weighted bipartite graph $\{G=(U\sqcup V, E), w:E\rightarrow \mathbb{Z}\}$ we consider the problems of finding all the edges that occur in some minimum weight matching of maximum cardinality and enumerating all the minimum weight perfect
C. Vargas, Carlos E. Valencia, Marcos
core
Network flow optimization for restoration of images
Journal of Applied Mathematics, Volume 2, Issue 4, Page 199-218, 2002., 2002 The network flow optimization approach is offered for restoration of gray‐scale and color images corrupted by noise. The Ising models are used as a statistical background of the proposed method. We present the new multiresolution network flow minimum cut algorithm, which is especially efficient in identification of the maximum a posteriori (MAP ...
Boris A. Zalesky
wiley +1 more source
Demonstratio MathematicaIn this article, we study the application of NetworkX, a Python library for dealing with traffic networks, to the problem of signal optimization at a single intersection.
Jovanović Aleksandar +3 more
doaj +1 more source