Network reduction for the acyclic constrained shortest path problem

Article Abstract:

A method for reducing acyclic networks with knapsack constraints is discussed. The method is applicable for acylic network with each arc having time and length as attributes. It is based on identification and removal of arcs and nodes that render a path infeasible which the method accomplishes by doubly traversing the network. The model has a modest computational requirements enhancing its usage in the solution of constrained shortest path problem.

Methods, Transportation, Path analysis

---

Lower bounds for the quadratic semi-assignment problem

Article Abstract:

Two methods for improving the lower bounds for the Quadratic Semi-Assignment Problem (QSAP) are derived. A graph partition technique is first applied to decompose the problem into polynomially solvable subproblems. Langrangean decomposition is then used to improve the results of the subproblems. Applications of the method show good performance. An L-I reduction process is also presented for the determination of a new lower bounding technique.

Combinatorial optimization

---

A directed hypergraph model for random time dependent shortest paths

Article Abstract:

Routing problems in dynamic networks are considered.

Similar abstracts:

• Abstracts: A self-organizing neural network approach for the single AGV routing problem
• Abstracts: Waiting for the new India. Harvesting India's reforms. India looks east
• Abstracts: Stopping the school bus. Good scores, or else. How Dubya did at school
• Abstracts: Beware of the watchdog. Only connect. Delayed gratification
• Abstracts: Beat bronchitis this winter. Don't suffer from sinus problems. Smart new ways to beat depression

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.