Results 41 to 50 of about 95 (88)

Routing problems with loading constraints

, 2010
Vehicle routing, Loading, Two-dimensional packing, Three-dimensional packing, Traveling salesman, Pickup and delivery, 90C27, 90C35,
S. Martello, Silvano Martello, M. Iori, MARTELLO, SILVANO, IORI, MANUEL, Manuel Iori   +5 more
core   +1 more source

CycleExpander to construct Directed Hamiltonian Circuit HexCycleSpanner to tighten Directed Hamiltonian Circuit

, 2022
<p><strong>CycleExpander  to  <em>construct</em>  Directed  Hamiltonian  Circuit <br>HexCycleSpanner  to  <em>tighten</em>  Directed  Hamiltonian  Circuit ...
HALEMANE, KESHAVA PRASAD
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

The shortest-path and bee colony optimization algorithms for traffic control at single intersection with NetworkX application

Demonstratio Mathematica
In 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, Uzelac Ana, Kukić Katarina, Teodorović Dušan   +3 more
doaj   +1 more source

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

On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs [PDF]

, 2006
AMS classifications: 05C69; 90C35 ...
Sotirov, R.; id_orcid, de Klerk, E., de Klerk, E.; id_orcid, Pasechnik, D.V., Sotirov, R., Newman, M.W.   +5 more
core  

Efficient solution methods for covering tree problems

location, covering, tree covering, 90B80, 90C27, 90C35,
T. Boffey
core   +1 more source

Detecting embedded pure network structures in LP problems

Linear Programming, Embedded Networks, Network Optimization, AMS subject classification, 90C05, 90C35, 90C08,
Nalân Gülpinar, Istvan Maros, Gautam Mitra   +2 more
core   +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