Algorithms for construction of optimal and suboptimal solutions in network optimization problems
zbMATH Open1198.90381MaRDI QIDQ3396142FDOQ3396142
Authors: L. A. Pilipchuk, Andreĭ Stepanovich Pilipchuk, Y. H. Pesheva 
Publication date: 16 September 2009
Recommendations
- scientific article; zbMATH DE number 44551
- Linear-fractional programming: Problems of optimization of inhomogeneous flows in the generalized networks
- A method of network programming in problems of nonlinear optimization
- scientific article; zbMATH DE number 892021
- Optimal flows in dynamic networks and algorithms for their finding
networkdual methoddirect methodunderdetermined systemspanning treesparse linear systemcharacteristic vectorpseudo-planbasis of a solution space of a homogeneous linear systemdecomposition of a systemfundamental system of cyclesnetwork supportoptimality and suboptimality plan
Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10)
Cited In (8)
- Title not available (Why is that?)
- Algorithms for a multi-level network optimization problem
- Algorithms for a network design problem with crossing supermodular demands
- Network optimization: algorithms and applications
- Identification of the sensors configuration and flows control
- Algorithms for the non-bifurcated network design problem
- Title not available (Why is that?)
- An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
This page was built for publication: Algorithms for construction of optimal and suboptimal solutions in network optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396142)
