Integer equal flows

DOI10.1016/j.orl.2009.03.006zbMath1167.90398OpenAlexW2143306079MaRDI QIDQ833591

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)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the limits of proper learnability of subclasses of DNF formulas
• Network models for vehicle and crew scheduling
• The equal flow problem
• Network simplex algorithm for the general equal flow problem.
• Integer Programming with a Fixed Number of Variables
• Algorithms for the Simple Equal Flow Problem
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• On the Complexity of Timetable and Multicommodity Flow Problems
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
• A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
• Computationally Related Problems

This page was built for publication: Integer equal flows