Pages that link to "Item:Q4377576"
From MaRDI portal
The following pages link to An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems (Q4377576):
Displaying 8 items.
- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions (Q1384428) (← links)
- Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (Q1810926) (← links)
- A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems (Q2468881) (← links)
- A Newton method for convex separable network flow problems (Q3668258) (← links)
- A hybrid algorithm for solving convex separable network flow problems (Q3706799) (← links)
- An ε-Relaxation method for generalized separable convex cost network flow problems (Q4645915) (← links)
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems (Q5436924) (← links)