Source sink flows with capacity installation in batches
From MaRDI portal
Publication:1130180
DOI10.1016/S0166-218X(98)00024-9zbMATH Open0908.90117MaRDI QIDQ1130180FDOQ1130180
Authors: Sunil Chopra, Itzhak Gilboa, S. Trilochan Sastry 
Publication date: 20 August 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Recommendations
- scientific article; zbMATH DE number 3970464
- Dynamic flows with time-dependent capacities
- scientific article; zbMATH DE number 515935
- Bottleneck flows in unit capacity networks
- Uniform flow distribution over the sink arcs in a network
- Flows in Undirected Unit Capacity Networks
- Dynamic flows with supply and demand in networks with several source and sink nodes
- scientific article; zbMATH DE number 3976731
- Flow in Planar Graphs with Multiple Sources and Sinks
- Finite capacity flow control in a multi-stage/multi-product environment
Cites Work
- Network flows. Theory, algorithms, and applications.
- Graph theory
- Title not available (Why is that?)
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Minimum cost capacity installation for multicommodity network flows
- Facets and algorithms for capacitated lot sizing
- Shortest paths, single origin‐destination network design, and associated polyhedra
Cited In (18)
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- One and two facility network design revisited
- Title not available (Why is that?)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
- Graphs and algorithms in communication networks on seven league boots
- On dependent randomized rounding algorithms
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- Approximation algorithms for buy-at-bulk geometric network design
- Robust network design: formulations, valid inequalities, and computations
- A partitioning algorithm for the network loading problem
- 0-1 reformulations of the multicommodity capacitated network design problem
- Towards optimizing the deployment of optical access networks
- Metric inequalities and the network loading problem
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- On cut-based inequalities for capacitated network design polyhedra
- Exact approaches to the single-source network loading problem
This page was built for publication: Source sink flows with capacity installation in batches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130180)
