An optimal algorithm for solving the 1-median problems on weighted 4-cactus graphs

Article Abstract:

The median problem is analyzed in terms of weighted 4-cactus graphs. Such graphs are less restricted in terms of their network structure than are trees.

Graphic methods

---

The lower and upper forcing geodetic numbers of block-cactus graphs

Article Abstract:

A study uses the graph theory to examine variation in geodetic numbers in block-cactus graphs.

China, Usage, Graph theory

---

K L-list t colouring of graphs

Article Abstract:

A heuristic algorithm was developed to resolve a problem, which is NP-complete, related to k L-list t colouring of graphs. The algorithm employs a backtracking approach that allows direct reassignment of the vertices causing the problem. An implementation of the algorithm was undertaken involving assigning of trains to available tracks in railway stations.

Research, Scheduling (Management), Heuristic programming

Similar abstracts:

• Abstracts: A memetic algorithm for the total tardiness single machine scheduling problem. Algorithmic approach to the satisfactory graph partitioning problem
• Abstracts: A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints. Restricting weights in value efficiency analysis
• Abstracts: A dynamic programming algorithm for the local access telecommunication network expansion problem. The assembly of printed circuit boards: a case with multiple machines and multiple board types
• Abstracts: Hong Kong food shoppers begin to challenge wet-market custom. Are tourist doldrums over in Hong Kong?
• Abstracts: Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem. Warehouse design and control: framework and literature review

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