Some new algorithms for location problems on networks

Article Abstract:

A new algorithm for the one center, the one median and the one absolute center problem was proven to be better than the existing method, both in computational time and in memory requirements. The new algorithm for the one median problem can also be employed in one absolute median problem. Since the new algorithms have a smaller memory requirement, they enable problems to be solved faster and allow larger problems to be solved on the same machine.

Management-Problem Solving, Management, Human resource management, Problem solving, Industrial locations, Industrial location

---

Projection algorithms for linear programming

Article Abstract:

A general projection approach in solving the feasibility problem of linear programming is presented, based on the nearest-point projection of geometric convexity. N.Z. Shor's method of space dilation is used to develop polynomial-time ellipsoidal algorithms with improved termination criteria in case of infeasibility. Various techniques from nonlinear programming can also be applied using this approach.

Convex programming

---

Linear programming approaches for multicategory support vector machines

Article Abstract:

A study suggesting linear programming methods for multicategory support vector machines is presented.

Japan

Similar abstracts:

• Abstracts: A simple SLP algorithm for solving a class of nonlinear programs. A review of warehouse models
• Abstracts: Resource allocation via dynamic programming in activity networks. Asymptotic analysis of dichotomous search with search and travel costs
• Abstracts: Coordination versus globalization: the multinational's dilemma. Managing subsidiary companies: a survey of managing directors
• Abstracts: Dynamic patent licensing. Price signals quality: the case of perfectly inelastic demand. The licensing of patents under asymmetric information
• Abstracts: A one-vendor multi-buyer integrated inventory model. Periodic review stochastic inventory problem with forecast updates: worst-case bounds for the myopic solution

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