Results 1 to 10 of about 339 (75)
Variantes del problema del cartero mixto que se pueden resolver usando programación lineal
Revista de Matemática: Teoría y Aplicaciones, 2012 Dada una gráfica mixta y conexa con costos en sus aristas y arcos, el problema del cartero mixto consiste en encontrar un circuito cerrado de la gráfica mixta que recorra sus aristas y arcos a costo mínimo. Se sabe que este problema es NP-duro.
Francisco Javier Zaragoza Martínez +1 more
doaj +2 more sources
RAIRO Oper. Res., 2021 This paper considers an exact bi-objective approach for simultaneously minimizing the total cost of flow routing and the network bottleneck when link qualities and flow weights are relevant.
L. Pinto +2 more
semanticscholar +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 +6 more sources
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
Coloring by tabu branch and bound
Cliques, Coloring, and Satisfiability, 1993 We give an adaptive depth procedure for coloring a graph that combines elements of tabu search and branch and bound. The resulting tabu branch and bound method can execute searches of varying degrees of exhaustiveness at different stages and in different
F. Glover, Mark Parker, J. Ryan
semanticscholar +1 more source
Why Optimal States Recruit Fewer Reactions in Metabolic Networks [PDF]
, 2012 The metabolic network of a living cell involves several hundreds or thousands of interconnected biochemical reactions. Previous research has shown that under realistic conditions only a fraction of these reactions is concurrently active in any given cell.
Lee, Joo Sang +2 more
core +1 more source
A Parametric Network Approach for Concepts Hierarchy Generation in Text Corpus
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 The article presents a preflow approach for the parametric maximum flow problem, derived from the rules of constructing concepts hierarchy in text corpus.
Sângeorzan L. S. +2 more
doaj +1 more source
New upper bounds on the probability of events based on graph structures
, 2007 We present upper bounds for the probability of the union of events based on the individual probabilities and joint probabilities of pairs. The bounds generalize Hunter’s upper bound and can be interpreted as objective function values corresponding to ...
B. Vizvári
semanticscholar +1 more source
The time-varying shortest path problem with fuzzy transit costs and speedup
Acta Universitatis Sapientiae: Mathematica, 2016 In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost.
Rezapour Hassan, Shirdel Gholamhassan
doaj +1 more source
Low-Degree Spanning Trees of Small Weight [PDF]
, 1996 The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation algorithm ...
Balaji Raghavachari +3 more
core +6 more sources