An optimal method for solving the (generalized) multi-Weber problem

Article Abstract:

THe classical single Weber problem in Euclidean space is finding the one location which minimizes the summed distance from some number of fixed points with known locations. Linear programming can be used to provide an optimal solution to the multi-Weber and generalized multi-Weber problem when all feasible elemets are enumerated. The method is limited to small and moderately sized cases because of the preparation step.

Research, Linear programming, Usage, Euclidean geometry

---

A global optimization algorithm for the three-dimensional packing problem

Article Abstract:

A novel model for resolving the three-dimensional packing problem is presented. The algorithm used is based on a geometrical model and is demonstrated valid under test conditions.

Operations research, Management science, Models

---

Similar abstracts:

• Abstracts: An efficient transformation of the generalized vehicle routing problem. On a cutting plane heuristic for the stable roommates problem and its applications
• Abstracts: Lower-bounding procedures for the 2-dimensional cell suppression problem. A new relaxation method for the generalized minimum spanning tree problem
• Abstracts: An enumerative framework for a class of nonlinear integer programming problems. Algorithms for graph partitioning problems by means of eigenspace relaxations
• Abstracts: Operational research models in action, the result of international cooperation - a potpourri. The application of operational research to European air traffic flow management - understanding the context
• Abstracts: Probability distributions of costs, revenue and profit over a warranty cycle. Optimal policies under risk for changing software systems based on customer satisfaction

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