TY - INPR
A1 - Engau, Alexander
A1 - Hamacher, Horst W.
T1 - Semi-Simultaneous Flows and Binary Constrained (Integer) Linear Programs
N2 - Linear and integer programs are considered whose coefficient matrices can be partitioned into K consecutive ones matrices. Mimicking the special case of K=1 which is well-known to be equivalent to a network flow problem we show that these programs can be transformed to a generalized network flow problem which we call semi-simultaneous (se-sim) network flow problem. Feasibility conditions for se-sim flows are established and methods for finding initial feasible se-sim flows are derived. Optimal se-sim flows are characterized by a generalization of the negative cycle theorem for the minimum cost flow problem. The issue of improving a given flow is addressed both from a theoretical and practical point of view. The paper concludes with a summary and some suggestions for possible future work in this area.
T3 - Report in Wirtschaftsmathematik (WIMA Report) - 99
KW - network flows
KW - consecutive ones matrix
KW - linear programming
KW - integer programming
Y1 - 2006
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1753
UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-14361
ER -