A polynomial solvable-class of Quadratic Semi-Assignment Problems

Article Abstract:

A particular type of Quadratic Semi-Assignment Problem (QSAP) which models a large number of real-life applications and is defined on convex bipartite graphs is shown to be solvable in polynomial time. The concept is based on a simple transformation into a network flow problem whose size is linearly dependent on the size of the original QSAP. This type of problems is applicable for practical situations such as the Schedule Synchronization Problem and other transportation problems.

Scheduling (Management)

---

A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming

Article Abstract:

The recurrence formulas formulated in Gomez and Pediera were used to devise a null-space method for computing the search direction when a general inertia-controlling strategy. It is shown that at each iteration, only one triangular system has to be solved for determining the search direction. This method takes advantage of previously developed recurrence formulas for updating the search direction when the working set changes.

Methods, Search theory

---

Robust autoregressive estimates using quadratic programming

Article Abstract:

The quadratic programming method was found to be effective in containing the effects of outliers in bounded influence estimators. This was effected by using bounded 'position' weights for the bound influence estimates. The additive effects of outliers are further controlled by with the use of the QPBI estimator, which provides a measure of control over bias, lending better predictive qualities for autoregressive estimators.

Operations Research, Management science, Models, Estimation theory

Similar abstracts:

• Abstracts: Coal blending optimization under uncertainty. On solving a variation of the assignment problem. Goal programming and data envelopment analysis (GoDEA) for target-based multi-level planning: allocating central grants to the Greek local authorities
• Abstracts: Marco Polo: fact or fiction? One sign, two systems
• Abstracts: Limits on the analytic hierarchy process from its consistency index. The Analytic Hierarchy Process in an uncertain environment: a simulation approach
• Abstracts: A framework for an interactive project scheduling system under limited resources. Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation

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