𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial recognition algorithm for balanced matrices

✍ Scribed by Giacomo Zambelli

Book ID
108167380
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
278 KB
Volume
95
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Balanced 0, ±1 Matrices II. Recognition
Balanced 0, ±1 Matrices II. Recognition Algorithm
✍ Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 232 KB

In this paper we give a polynomial time recognition algorithm for balanced 0, \1 matrices. This algorithm is based on a decomposition theorem proved in a companion paper.

A strongly polynomial algorithm for the
A strongly polynomial algorithm for the uniform balanced network flow problem
✍ Maria Grazia Scutellá 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 565 KB

## Several balanced optimization problems have been analysed in the literature. Here, the balanced network flow problem in the uniform case is studied, and it is shown that it can be solved by the Newton's approach in O(n' log3 n) max-flow computations. The key of the proof is an extension of Rad