Network simplex algorithm for the general equal flow problem

Article Abstract:

The general equal flow problem is a minimum cost network flow problem which has additional side constraints requiring the flow of arcs in given sets of arcs to take on the same value. This model is applied to approach water resource system management problems by involving policy restrictions, which require some arcs to carry the same amount of flow.

Administration of Air and Water Resource and Solid Waste Management Programs, Water Resources & Power, Management, Water resources, Company business management, Aquatic resources

---

New variants of the criss-cross method for linearly constrained convex quadratic programming

Article Abstract:

In the article, S. Zhang's new and more flexible criss-cross type algorithms are generalized for linearly constrained convex primal-dual quadratic programming problems. The criss-cross type algorithm is different from the one described in Klafszky and Terlaky.

Practice, Zhang, S.

---

Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm

Article Abstract:

Zonotope algorithms to examine weighted max-cut problem in binary variables are presented.

Switzerland, Usage

Similar abstracts:

• 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: A linear approximation model for the parameter design problem. Heuristic methods for gang-rip saw arbor designs
• Abstracts: Research all the time. A piece of a rock. The sporting life
• Abstracts: Modelling resource availability in general hospitals: design and implementation of a decision support model

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