An addendum to the hierarchical network design problem

Article Abstract:

The hierarchical network design is investigated. Specifically, a branch chord heuristic procedure based on dynamic programming concepts and alternative methods in the literature are identified as solutions to the NP-hard problem. The problem involves determining a spanning tree with minimum total weight given that links 'between two nodes are weighted by an other cost function than' all the tree edges not on the path.

Operations research, Research, Management science, Network analysis (Planning), Case studies, Mathematical programming, Trees (Graph theory)

---

Some inverse optimization problems under the Hamming distance

Article Abstract:

A study uses hamming distance measurement to solve combinatorial optimization problems.

Analysis, Combinatorial analysis, Mathematical optimization, Distances, Distance measurement

---

An addendum on sensitivity analysis of the optimal assignment

Article Abstract:

A study on sensitivity analysis for linear assignment problem is discussed.

Mathematical models

Similar abstracts:

• Abstracts: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines. Scatter Search in software testing, comparison and collaboration with Estimation of Distribution Algorithms
• Abstracts: Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm. Ensuring population diversity in genetic algorithms: a technical note with application to the cell formation problem
• Abstracts: An interactive reservoir management system for Lake Kariba. An optimal timing model of water reallocation and reservoir construction
• Abstracts: Modelling (s, Q) inventory systems: parametric versus non-parametric approximations for the lead time demand distribution
• Abstracts: Group decision-making using a fuzzy linguistic approach for evaluating the flexibility in a manufacturing system

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