A branch-and-bound algorithm for the mini-max spanning forest problem

Article Abstract:

A branch-and-bound algorithm has been found to be an excellent solution to the maximum cost of trees problem. The formulation of solutions to a series of small test problems was facilitated by the presentation of three lower bounds for the mini-max spanning forest problem with other possible solutions generated by using the branch-and-cut method. The method may be applied to problems with more than two roots and or two vertices location problems.

Operations Research

---

An improved algorithm to determine lower bounds for fixed spectrum frequency assignment problem

Article Abstract:

Frequencies have to be assigned to transmitters whenever a radio network is established or modified, which are ideally done in a way that minimises interference in the network. Lower bounds are necessary to establish the effectiveness of the heuristic algorithms used for the task, and to assess the quality of the assignments obtained a technique for generating lower bounds is presented.

Algorithms, Spectrum analysis, Spectroscopy, Algorithm

---

A branch and bound algorithm for the robust spanning tree problem with interval data

Article Abstract:

The robust spanning tree problem, which can be used to model in mathematical terms some telecommunications problems, is examined and described by a branch and bound algorithm. Some added new elements extend the previous results. The computational results are improved by using some new reduction rules and they prove that the method is very competitive.

Similar abstracts:

• Abstracts: Linear assignment procedures. A branch-and-bound algorithm for the singly constrained assignment problem. Solving the k-cardinality assignment problem by transformation
• Abstracts: Approximation algorithms for the oriented two-dimensional bin packing problem. A note on exact algorithms for the identical parallel machine scheduling problem
• Abstracts: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem
• Abstracts: Incomplete information and multiple machine queueing problems
• Abstracts: Activity consolidation to improve responsiveness. Optimal policies for the sizing and timing of software maintenance projects

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