AN ITERATIVE CHEBYSHEV APPROXIMATION METHOD FOR NETWORK DESIGN

[1] AARON MR, 1956, IRE T CIRCUIT THEORY, VCT 3, P224

[2] CARROLL CL, OPERATIONS RESEARCH, V9, P169

[3] THE SEQUENTIAL UNCONSTRAINED MINIMIZATION TECHNIQUE FOR NONLINEAR-PROGRAMMING, A PRIMAL-DUAL METHOD [J]. MANAGEMENT SCIENCE, 1964, 10 (02) : 360 - 366

[4] A RAPIDLY CONVERGENT DESCENT METHOD FOR MINIMIZATION [J]. COMPUTER JOURNAL, 1963, 6 (02) : 163 - &

[5] GRAVES RL, 1963, RECENT ADVANCES M ED

[6] ISHIZAKI Y, 1963 NATL CONV IECE

[7] ISHIZAKI Y, 1966, 4 P ANN ALL C CIRC S

[8] ISHIZAKI Y, 1965, 3 P ALL C CIRC SYST, P786

[9] ISHIZAKI Y, 1964 ICMCI TOK JAP I

[10] SCHEIBE PO, 1965, 3 P ANN ALL C CIRC S

[1] AARON MR, 1956, IRE T CIRCUIT THEORY, VCT 3, P224

[2] CARROLL CL, OPERATIONS RESEARCH, V9, P169

[3] THE SEQUENTIAL UNCONSTRAINED MINIMIZATION TECHNIQUE FOR NONLINEAR-PROGRAMMING, A PRIMAL-DUAL METHOD [J]. MANAGEMENT SCIENCE, 1964, 10 (02) : 360 - 366

[4] A RAPIDLY CONVERGENT DESCENT METHOD FOR MINIMIZATION [J]. COMPUTER JOURNAL, 1963, 6 (02) : 163 - &

[5] GRAVES RL, 1963, RECENT ADVANCES M ED

[6] ISHIZAKI Y, 1963 NATL CONV IECE

[7] ISHIZAKI Y, 1966, 4 P ANN ALL C CIRC S

[8] ISHIZAKI Y, 1965, 3 P ALL C CIRC SYST, P786

[9] ISHIZAKI Y, 1964 ICMCI TOK JAP I

[10] SCHEIBE PO, 1965, 3 P ANN ALL C CIRC S