A combinatorial arc tolerance analysis for network flow problems
From MaRDI portal
Publication:930771
DOI10.1155/JAMDS.2005.83zbMATH Open1213.90075OpenAlexW2031263706MaRDI QIDQ930771FDOQ930771
Authors: P. T. Sokkalingam, Prabha Sharma 
Publication date: 1 July 2008
Published in: Journal of Applied Mathematics and Decision Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/117015
Recommendations
- On the analysis of optimization problems in arc-dependent networks
- Network design and flow problems with cross-arc costs
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
- Maximum flow in a network with an underestimated arc capacity
- A combinatorial interior point method for network flow problems
- scientific article; zbMATH DE number 3876893
- Note on independence of arcs in antiparallel for network flow problems
- scientific article; zbMATH DE number 2101425
- Invariant sets of arcs in network flow problems
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cited In (5)
- Title not available (Why is that?)
- Extending single tolerances to set tolerances
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model
This page was built for publication: A combinatorial arc tolerance analysis for network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930771)
