The following pages link to (Q3730336):
Displayed 14 items.
- Distributed Continuous-Time Algorithms for Nonsmooth Extended Monotropic Optimization Problems (Q4553300) (← links)
- An ε-Relaxation method for generalized separable convex cost network flow problems (Q4645915) (← links)
- Solving the undirected minimum cost flow problem with arbitrary costs (Q4651934) (← links)
- Support prices of activities in linear programming<sup>1</sup>,<sup>2</sup> (Q4733662) (← links)
- Basis characterisation for linear multicommodity network programs (Q4836775) (← links)
- (Q5020878) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- Evenly convex sets, and evenly quasiconvex functions, revisited (Q5121442) (← links)
- Networks and Stability (Q5150303) (← links)
- (Q5317779) (← links)
- Duality in Countably Infinite Monotropic Programs (Q5359500) (← links)
- Inversion of real-valued functions and applications (Q5749867) (← links)
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)
- Combinatorial acyclicity models for potential‐based flows (Q6065854) (← links)