Results 41 to 50 of about 307 (69)
Approximating the Minimum Equivalent Digraph
, 2002 The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard.
Balaji Raghavachari +7 more
core +1 more source
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
The generalized minimum spanning tree problem [PDF]
, 2000 We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard.
Kern, W., Pop, P.C., Still, G.J.
core +2 more sources
A Linear Programming Approach to Weak Reversibility and Linear Conjugacy of Chemical Reaction Networks [PDF]
, 1995 15 páginas, 2 figuras.-- The final publication is available at www.springerlink.comA numerically effective procedure for determining weakly reversible chemical reaction networks that are linearly conjugate to a known reaction network is proposed in ...
Ivanov, AA +4 more
core +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
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
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving [PDF]
Computer Science Journal of Moldova, 2005 The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
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