Shortest path and maximum flow problems in networks with additive losses and gains
type: Item
instance of: scholarly article
title: Shortest path and maximum flow problems in networks with additive losses and gains
zbMATH Open document ID: 1230.90045
published in: Theoretical Computer Science
publication date: 2011-02-02T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5843649
zbMATH Keywords: extended networks
zbMATH Keywords: lossy and gainy arcs
zbMATH Keywords: max-flow problems
zbMATH Keywords: shortest path problems
zbMATH Keywords: NP-hard problems
zbMATH Keywords: unit-loss networks
author: Franz J. Brandenburg
author: Mao-Cheng Cai
describes a project that uses: LEDA
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.11.019
OpenAlex ID: W2000383711
cites work: Q3056948
cites work: Q4258216
cites work: Q4414484
cites work: Negative-cycle detection algorithms
cites work: Q3619797
cites work: Q3844775
cites work: Fast and simple approximation schemes for generalized flow.
cites work: Q5514188
cites work: Q4198056
cites work: Combinatorial Algorithms for the Generalized Circulation Problem
cites work: Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
cites work: A polynomial dual simplex algorithm fot the generalized circulation problem.
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: A new polynomial-time algorithm for linear programming
cites work: New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: Polynomial algorithms in linear programming
cites work: Q4130999
cites work: Q4702188
cites work: Combinatorial approximation algorithms for generalized flow problems
cites work: Q3707420
cites work: A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
cites work: On Unapproximable Versions of $NP$-Complete Problems
DOI: 10.1016/J.TCS.2010.11.019
Recommended article: Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
Recommended article: Q3538737
Recommended article: Q4726020
Recommended article: Q4895157
Recommended article: A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)
Recommended article: The problem of maximum flow with minimum attainable cost in a network
Recommended article: Maximum network flows with concave gains
Recommended article: Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
Recommended article: The multiroute maximum flow problem revisited
Recommended article: Randomized shortest paths with net flows and capacity constraints
description: scientific article; zbMATH DE number 5843649