Integer equal flows

DOI10.1016/J.ORL.2009.03.006zbMATH Open1167.90398OpenAlexW2143306079MaRDI QIDQ833591FDOQ833591

Authors: Carol A. Meyers, Andreas S. Schulz 

Publication date: 14 August 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/54777

Recommendations

• Vector flows and integer flows
• Integer flows and orientations
• scientific article; zbMATH DE number 4097107
• Counting integer flows in networks
• The equal flow problem
• Integer flows and cycle covers
• Flows equivalences.
• Integer flows and subgraph covers
• scientific article; zbMATH DE number 978847
• scientific article; zbMATH DE number 2090007

zbMATH Keywords

computational complexitynetwork optimizationapproximabilityequal flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• Integer Programming with a Fixed Number of Variables
• On the Complexity of Timetable and Multicommodity Flow Problems
• Network simplex algorithm for the general equal flow problem.
• A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
• Computationally Related Problems
• Algorithms for the simple equal flow problem
• Network models for vehicle and crew scheduling
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• Title not available (Why is that?)
• On the limits of proper learnability of subclasses of DNF formulas
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
• The equal flow problem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Algorithms and complexity for the almost equal maximum flow problem
• Robust transshipment problem under consistent flow constraints
• Integrality in the multinetwork min‐cost equal‐flow problem
• Level-planar drawings with few slopes
• Algorithms and complexity for the almost equal maximum flow problem
• Robust minimum cost flow problem under consistent flow constraints
• Towards a theory of mixing graphs: a characterization of perfect mixability

This page was built for publication: Integer equal flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833591)