Pages that link to "Item:Q4022698"
From MaRDI portal
The following pages link to An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons (Q4022698):
Displaying 16 items.
- Quadratic cost flow and the conjugate gradient method (Q707094) (← links)
- A method of network programming in problems of nonlinear optimization (Q1042678) (← links)
- Performance evaluation of independent superbasic sets on nonlinear replicated networks (Q1068689) (← links)
- An algorithm for solving quadratic network flow problems (Q1175149) (← links)
- Algorithms for network piecewise-linear programs: A comparative study (Q1278601) (← links)
- A method for convex curve approximation (Q1278603) (← links)
- Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs (Q1297626) (← links)
- A faster version of the ASG algorithm (Q1343522) (← links)
- A global convergent algorithm for flows in a two-dimensional network (Q1877129) (← links)
- (Q3139149) (← links)
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs (Q3745647) (← links)
- Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP (Q3751389) (← links)
- A comparison of phase and nonphase network flow algorithms (Q3833846) (← links)
- Computational development of a lagrangian dual approach for quadratic networks (Q3977272) (← links)
- Analytic efficient solution set for bi-criteria quadratic network programs (Q4378939) (← links)
- (Q5317779) (← links)