A minimax assignment problem in treelike communication networks

Article Abstract:

A branch and bound procedure for solving the quadratic assignment problem, otherwise known as minimax assignment problem on tree networks, is introduced. The problem involves the minimization of the maximum intermediate traffic by optimizing the message routing pattern and the embedding of the communication centers. Depending on whether the solution is based on the single-path of fractional model, it is NP-complete even for the case of paths, cycles, doublestars and stars of branch length three.

Branch and bound algorithms, Telecommunications traffic, Communications traffic

---

On finding a biconnected spanning planar subgraph with applications to the facilities layout problem

Article Abstract:

The biconnected spanning planar subgraph (BSPS) problem is proven to be NP-complete. The problem, which is related to the maximal planarization problem, involves finding a planar and biconnected spanning subgraph of a general biconnected graph and may be used to characterize a special case of the facility layout problems. Consequently, a heuristic based on the depth-first search tree method is developed.

---

Heuristics for biquadratic assignment problems and their computational comparison

Article Abstract:

Heuristic methods for biquadratic assignment problems (BiQAP) are discussed. These include pair exchange algorithms, variants of simulated annealing and taboo search. These methods were translated into C codes for testing on BiQAP instances with known solutions. Results show that the third version of simulated annealing provides the lowest value of relative error compared to the other heuristics.

Models, Analysis, Mathematical optimization, Optimization theory, Heuristic programming

Similar abstracts:

• Abstracts: South Korea begins dismantling barriers to foreign role in construction industry. Store collapse in Seoul underscores need for drastic reform of building industry
• Abstracts: Minimax regret solution to linear programming problems with an interval objective function. An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set
• Abstracts: The changing process of internationalisation in the European Union. Towards a taxonomy of international retail alliances
• Abstracts: Time Telecom IPO raises stakes in crowded cellular sector. Malaysia's TRI may be best connection to tangled telecommunications sector
• Abstracts: Scheduling projects to maximize net present value - the case of time-dependent, contingent cash flows. Scheduling programs with repetitive projects: a comparison of a simulated annealing, a genetic and a pair-wise swap algorithm

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