Upper and lower bounding procedures for minumum rooted k-subtree problem

Article Abstract:

The minimum rooted k-subtree problem is explained and procedures for developing a lower bound are set out, with computational results analyzed.

Algebra, K-theory, K theory

---

A heuristic algorithm for the mini-max spanning forest problem

Article Abstract:

A heuristic algorithm is developed for the mini-max spanning forest problem for undirected graphs. The problem is considered as a generalization of the minimum spanning tree problem. Evidence is given that the problem is NP-hard. The heuristic algorithm can provide an approximate solution and can provide an upper bound for relative errors. A number of numerical experiments are conducted to test the performance of the algorithm.

Usage, Heuristic programming, Graph theory, Trees (Graph theory)

---

Some exact algorithms for the knapsack sharing problem

Article Abstract:

Two algorithms, a branch-and-bound algorithm and a binary search algorithm, were evaluated in terms of solving the knapsack sharing problem (KSP). Computational experiments and implementation of the two algorithms were undertaken to assess their behavior. Of the two algorithms developed, the binary search algorithm was able to solve KSPs ranging up to 20000 variables in less than 60 seconds.

Combinatorial optimization, Binary searching

Similar abstracts:

• Abstracts: A comparison of procedures for estimating the parent probability distribution from a given set of fractiles. Estimating the demand distributions of single-period items having frequent stockouts
• Abstracts: Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects
• Abstracts: Passengers end up paying the price for Northwest's cost-saving moves. Business-jet flights take off in Hong Kong, Beijing and Macau
• 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.