Integer Equal Flows

Meyers, C A; Schulz, A S

doi:10.1016/j.orl.2009.03.006

Integer Equal Flows

Journal Article · Wed Jan 07 04:00:00 EST 2009 · Operations Research Letters

DOI:https://doi.org/10.1016/j.orl.2009.03.006· OSTI ID:964100

Meyers, C A; Schulz, A S

The integer equal flow problem is an NP-hard network flow problem, in which all arcs in given sets R{sub 1}, ..., R{sub {ell}} must carry equal flow. We show this problem is effectively inapproximable, even if the cardinality of each set R{sub k} is two. When {ell} is fixed, it is solvable in polynomial time.

Research Organization:: Lawrence Livermore National Laboratory (LLNL), Livermore, CA

Sponsoring Organization:: USDOE

DOE Contract Number:: W-7405-ENG-48

OSTI ID:: 964100

Report Number(s):: LLNL-JRNL-410584

Journal Information:: Operations Research Letters, Journal Name: Operations Research Letters Vol. 37; ISSN ORLED5; ISSN 0167-6377

Country of Publication:: United States

Language:: English

References (12)

A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem Shepardson, Fred; Marsten, Roy E. Management Science, Vol. 26, Issue 3 https://doi.org/10.1287/mnsc.26.3.274	journal	March 1980
A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure Glockner, Gregory D.; Nemhauser, George L. Operations Research, Vol. 48, Issue 2 https://doi.org/10.1287/opre.48.2.233.12384	journal	April 2000
On the Complexity of Timetable and Multicommodity Flow Problems Even, S.; Itai, A.; Shamir, A. SIAM Journal on Computing, Vol. 5, Issue 4 https://doi.org/10.1137/0205048	journal	December 1976
Computationally Related Problems Sahni, Sartaj SIAM Journal on Computing, Vol. 3, Issue 4 https://doi.org/10.1137/0203021	journal	December 1974
Algorithms for the Simple Equal Flow Problem Ahuja, Ravindra K.; Orlin, James B.; Sechi, Giovanni M. Management Science, Vol. 45, Issue 10 https://doi.org/10.1287/mnsc.45.10.1440	journal	October 1999
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms Fremuth-Paeger, Christian; Jungnickel, Dieter Networks, Vol. 33, Issue 1 https://doi.org/10.1002/(SICI)1097-0037(199901)33:1<1::AID-NET1>3.0.CO;2-M	journal	January 1999
Network models for vehicle and crew scheduling Carraresi, P.; Gallo, G. European Journal of Operational Research, Vol. 16, Issue 2 https://doi.org/10.1016/0377-2217(84)90068-7	journal	May 1984
Integer Programming with a Fixed Number of Variables Lenstra, H. W. Mathematics of Operations Research, Vol. 8, Issue 4 https://doi.org/10.1287/moor.8.4.538	journal	November 1983
Network simplex algorithm for the general equal flow problem Calvete, Herminia I. European Journal of Operational Research, Vol. 150, Issue 3 https://doi.org/10.1016/S0377-2217(02)00505-2	journal	November 2003
On the Limits of Proper Learnability of Subclasses of DNF Formulas Pillaipakkamnatt, Krishnan; Raghavan, Vijay Machine Learning, Vol. 25, Issue 2/3, p. 237-263 https://doi.org/10.1023/A:1026455409889	journal	January 1996
The equal flow problem Ali, Agha Iqbal; Kennington, Jeff; Shetty, Bala European Journal of Operational Research, Vol. 36, Issue 1 https://doi.org/10.1016/0377-2217(88)90012-4	journal	July 1988
A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows Larsson, T.; Liu, Z. Optimization, Vol. 40, Issue 3 https://doi.org/10.1080/02331939708844312	journal	January 1997

Similar Records

Approximation algorithms for network design problems on bounded subsets

Conference · Fri Dec 30 23:00:00 EST 1994 · OSTI ID:36130

Multiplicative equations over commuting matrices

Conference · Mon Dec 30 23:00:00 EST 1996 · OSTI ID:416835

Matrix interdiction problem

Conference · Thu Dec 31 23:00:00 EST 2009 · OSTI ID:985896

Related Subjects

99 GENERAL AND MISCELLANEOUS
CALCULATION METHODS
NETWORK ANALYSIS
POLYNOMIALS

Integer Equal Flows

Citation Formats

References (12)

Similar Records

Related Subjects