Results 31 to 40 of about 75 (75)
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
An extension to rapid transit network design problem
Underground train station and alignment location, Rapid transit network design, 90B06, 90C10, 90C35,
Ángel Marín
core +1 more source
Algorithms for minimum flows [PDF]
, 2001 We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n2m) time.
Eleonor Ciurea, Laura Ciupal
core
Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks [PDF]
, 2005 The game-theoretic formulation of the multiobjective multicommodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed.
Maria A. Fonoberova, Dmitrii D. Lozovanu
core +1 more source
A Greedy Randomized Adaptive Search Procedure For The Quadratic Assignment Problem
, 1994 . A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems.
Mauricio G.C. Resende +4 more
core +1 more source
The maximum flow in dynamic networks [PDF]
, 2005 The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon.
Maria A. Fonoberova, Dmitrii D. Lozovanu
core +1 more source
, 1994 . Based on recent convergence results for the affine scaling algorithm for linear programming, we investigate strategies to identify the optimal face of a minimum cost network flow problem.
Mauricio G.C. Resende +3 more
core +1 more source
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving [PDF]
, 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
core
An approach for solving a modification of the extended rapid transit network design problem
Station and link location, Circular line, Line designing, Degree of a node, 90B06, 90B80, 90C10, 90C35,
L. Escudero, S. Muñoz
core +1 more source
Shortest paths on polymatroids and hypergraphic polytopes [PDF]
Base polytopes of polymatroids, also known as generalized permutohedra, are polytopes whose edges are parallel to a vector of the form \(\mathbf{e}_i - \mathbf{e}_j\), where the \(\{\mathbf{e}_i\}_{i\in [n]}\) are the canonical basis vectors of \(\mathbb{
Cardinal, Jean, Steiner, Raphael
core +1 more source