Experiments with dynamic programming algorithms for nonseparable problems

Article Abstract:

Dynamic programming algorithms for solving nonseparable objective function problems based on the C programming language are evaluated. The study considered the classical variance minimization and nonlinear fractional knapsack problems. This is aimed at enhancing C's exclusionary rules when used in conventional parametric Lagrangian search methodologies. The inclusion of the exclusionary rules are shown to significantly enhance the line search procedure.

Research, Programming languages, Mathematical optimization

---

A heuristic for finding embedded network structure in mathematical programmes

Article Abstract:

A heuristic for determining network structures in particular subsets of mathematical programmes is evaluated. The heuristic is based on an intuitive determination of mathematical programme applicability to network flow problem conversion. The heuristic is shown to be effective in identifying structures. Use of the heuristic for determining a general network structure means that larger and higher level networks can also be determined.

Computer networks, Evaluation, Heuristic programming, Information networks

---

The tree longest detour problem in a biconnected graph

Article Abstract:

An efficient algorithm that takes O(m alpha(m, n)) time for finding a detour-critical edge in a shortest path tree is proposed. A special data structure, called transmuter is applied in the algorithm.

Analysis, Algorithm, Graph theory

Similar abstracts:

• Abstracts: A survey of algorithms for the generalized assignment problem. The capacitated distribution and waste disposal problem
• Abstracts: Implied constraints and LP duals of general nonlinear programming problems. Optimal partitions for shop floor control in semiconductor wafer fabrication
• Abstracts: Help with working in Europe. How architects can gain control of the process. Learning through design
• Abstracts: Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
• Abstracts: The linear balancing flow problem. An experimental evaluation of the efficacy of four multi-objective linear programming algorithms

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