On generalized minimum spanning trees

Article Abstract:

Issues are presented concerning the correction of inaccuracies which appeared in Technical Report IS-MG 2000/01 by C. Feremans, C. Labbe and M. Laporte entitled "Polyhedral analysis of the generalized minimum spanning tree problem".

Operations Research, Research, Management science, Correction Notice

---

Upper bounds and algorithms for the maximum cardinality bin packing problem

Article Abstract:

Upper bounds that exploit the structure of the cardinality bin packing (CBP), and algorithmic approaches yielding fast and practical solution to a CBP problem are developed. Several upper bounds embedded in an enumeration algorithm indicate that it typically identifies an optimal solution within very low computing times.

Algorithms, Algorithm, Mathematical optimization, Optimization theory

---

Locating median cycles in networks

Article Abstract:

The routing cost and the assigned visited vertices cost can be determined in the median cycle problem using a simple cycle that connects the subsets of vertices of graph containing the two costs. The mixed integer linear model is suggested for problems arising in the circular-shaped transportation and telecommunication infrastructure.

Models, Infrastructure (Economics), Logistics, Business logistics

Similar abstracts:

• Abstracts: A memetic algorithm for the total tardiness single machine scheduling problem. Algorithmic approach to the satisfactory graph partitioning problem
• Abstracts: Mixed-integer generation algorithms and the probabilistic maximum satisfiability problem. Two linear approximation algorithms for the subset-sum problem
• Abstracts: Only the best 'enfant cuisine' for the British bib-wearing set. Top 'pester' publishing booms
• Abstracts: Constructive and composite heuristic solutions to the P//sigmaCi scheduling problem. A heuristic for single machine scheduling with early and tardy costs
• Abstracts: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. Multicommodity flow models for spanning trees with hop constraints

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