A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method

Article Abstract:

A branch-and-bound algorithm was created to resolve the quadratic assignment problem. The algorithm, which is based on a dual procedure, entails an actual runtime that is much shorter than other widely used algorithms for QAPLIb test instances of size 16 through 22. The computational complexity of the branch-and-bound algorithm developed is far less than other popular methods.

Research and Development in the Physical, Engineering, and Life Sciences, Mathematics, Research, Quadratic programming, Mathematical programming

---

Robust economic order quantity models

Article Abstract:

The use of the robustness approach in studying the classical economic order quantity model under marked uncertainties of the input data showed that the approach outperforms stochastic optimization. It was established that the robustness approach is definitely a logical choice if the probability distribution is undetermined.

Production Planning & Control, Planning, Production management, Production control

---

Effective algorithm and heuristic for the generalized assignment problem

Article Abstract:

A new Branch-and-Bound algorithm for the generalized assignment problem is presented. A standard subgradient (SM) method, which is used at each node of the decision tree to solve the Lagrangian dual, provides an upper hand.

Algorithm

Similar abstracts:

• Abstracts: A genetic algorithm for service level based vehicle scheduling. Algorithm for minimizing weighted earliness penalty in single-machine problem
• Abstracts: A recursive exact algorithm for weighted two-dimensional cutting. Computational issues in a stochastic finite horizon one product recovery inventory model
• Abstracts: The computational complexity of the relative robust shortest path problem with interval data. A hybrid genetic algorithm for the three-index assignment problem
• Abstracts: The design of a dynamic allocation mechanism for the federal energy assistance program LIHEAP. Supporting triage of children with abdominal pain in the emergency room
• Abstracts: Bounds for nested knapsack problems. Tabu search algorithms for job-shop problems with single transport robot

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