The problem of the optimal biobjective spanning time

Article Abstract:

The EfficientBiobjective ST procedure for developing efficient biobjective spanning trees is derived. The procedure involves two phases, namely, the determination of the efficient spanning trees located on the border of the convex hull of the solution set followed by the use of a branch&bound technique to determine the remaining efficient spanning trees. Computational results for the procedure are discussed.

Analysis, Trees (Graph theory)

---

A discretizing algorithm for location problems

Article Abstract:

The development of an algorithm for problems involving the Planar Location Theory is examined. The analysis focuses on the single-facility location problem, which assumes that a service facility's location must meet total demand by a collectivity. Since a general formulation leads to various problems, degree of freedom is relaxed for the globalizing function and the problem's distance measures.

Models, Algorithms, Industrial locations, Industrial location, Nonlinear programming

---

The multiscenario lot size problem with concave costs

Article Abstract:

A solution method based on a multiobjective branch and bound approach is proposed for addressing the issue of the dynamic single-facility single-item lot size problem. The computational results on several randomly generated problems are reported.

Management dynamics, Inventory Control, Management, Company business management, Optimization theory, Economic lot size, Mathematical programming

Similar abstracts:

• Abstracts: The effect of lot sizing rules on order variability. Solving the competitive discretionary service facility location problem
• Abstracts: The role of e-marketplaces in supply chain management. The role of learning and technical capabilities in predicting adoption of B2B technologies
• Abstracts: A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem. A note of the approximation of the asymmetric traveling salesman problem
• Abstracts: Linear assignment procedures. A branch-and-bound algorithm for the singly constrained assignment problem. Solving the k-cardinality assignment problem by transformation
• Abstracts: The price of popularity. In the mood for sci-fi. Film: still rumbling

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