Integer equal flows

DOI10.1016/J.ORL.2009.03.006MaRDI QIDQ833591zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational complexitynetwork optimizationapproximabilityequal flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

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

Cites work

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

Cited in

(7)

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

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)