Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential
From MaRDI portal
Recommendations
Cited in
(7)- Packing trees in communication networks
- An approximation algorithm for the general max-min resource sharing problem
- Approximate max-min resource sharing for structured concave optimization
- Coordination Complexity of Parallel Price-Directive Decomposition
- Faster and simpler approximation algorithms for mixed packing and covering problems
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
- On routing in VLSI design and communication networks
This page was built for publication: Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363183)