SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Operations Research

Volumn 50, Issue 2, 2002, Pages 260-276

Simplex and interior point specialized algorithms for solving nonoriented multicommodity flow problems

(2) Chardaire, P a Lisser, A a

a UNIVERSITY OF EAST ANGLIA (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; LINEAR PROGRAMMING; PROBLEM SOLVING;

SIMPLEX ALGORITHMS;

TELECOMMUNICATION NETWORKS;

EID: 0036508254 PISSN: 0030364X EISSN: None Source Type: Journal
DOI: 10.1287/opre.50.2.260.436 Document Type: Article

Times cited : (19)

References (40)

1
- 0000110392
- An implementation of Karmarkar's algorithm for linear programming
- (1989) Math. Programming , vol.44 , pp. 297-335
- Adler, I.¹ Karmakar, N.² Resende, M.³ Veiga, G.⁴

2
- 0004115996
- Prentice-Hall, Englewood Cliffs, NJ
- (1992) Network Flows
- Ahuja, R.¹ Magnanti, T.² Odin, J.³

3
- 0002931515
- Computational comparison of the network simplex method with the affine scaling method
- (1991) Oper. Res. , vol.28 , pp. 26-43
- Armacost, A.¹ Mehrotra, S.²

4
- 43949150075
- Implementation and behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- (1994) Discrete Appl. Math. , vol.49 , Issue.1-3 , pp. 3-23
- Baln, O.¹ Goffin, J.-L.² Vial, J.-P.³ Du Merle, O.⁴

5
- 0040501585
- A cutting plane method from analytic centers for stochastic programming
- (1995) Math. Programming , vol.69 , Issue.1 , pp. 45-73

6
- 0009577199
- Primal-dual interior point method for multicommodity network flows with side constraints and comparison with alternative methods
- J. Dolezal, J. Fidler, eds. Chapman & Hall, Boca Raton, FL
- (1995) System Modelling and Optimization
- Castro, J.¹ Nabona, N.²

7
- 0009567016
- A primal simplex specialization for solving non-oriented multicommodity flow problems
- (1996) Investigacion Operativa , vol.5 , Issue.2-3 , pp. 117-152
- Chardaire, P.¹ Lisser, A.²

8
- 0026237664
- Using distributed topology update and preplanned configurations to achieve trunk network survivability
- (1991) IEEE Trans. Reliability , vol.40 , pp. 404-416
- Coan, B.A.¹ Leland, W.E.² Vecchi, M.P.³ Wu, L.T.⁴

9
- 0000039065
- The decomposition algorithm for linear programming
- (1961) Econometrica , vol.29 , pp. 767-778
- Dantzig, G.B.¹ Wolfe, P.²

10
- 0022995176
- A polynomial Newton method for linear programming
- (1986) Algorithmica , vol.1 , pp. 425-453
- De Ghellinck, G.¹ Vial, J.-P.²

11
- 0009577356
- Ph.D. thesis, HEC-Section of Management Studies, University of Geneva, Switzerland
- (1995) Points intérieurs et plans coupants: Mise en oeuvre et développement d'une méthode pour l'optimisation convexe et la programmation linéaire structurée de grande taille
- Du Merle, O.¹

12
- 0003424568
- Prentice-Hall, Englewood Cliffs, NJ
- (1993) Linear Optimization and Extensions
- Fang, S.C.¹ Puthenpura, S.²

13
- 0027632196
- A primal partitioning solution for the arc-chain formulation of a multicommodity flow problem
- (1993) Oper. Res. , vol.41 , Issue.4 , pp. 669-693
- Farvolden, J.M.¹ Powell, W.B.² Lustig, I.J.³

14
- 0003505353
- Wiley-Interscience, John Wiley & Sons, Inc., New York
- (1992) Network Models in Optimization and Their Applications in Practice
- Glover, F.¹ Klingman, D.² Phillips, N.V.³

15
- 0009577802
- Technical report, GERAD, McGill University, Montreal, Canada
- (1994) Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Goffin, J.-L.¹ Gondzio, J.² Sarkissian, R.³ Vial, J.-P.⁴

16
- 0000949338
- Decomposition and nondifferentiable optimization with the projective algorithm
- (1992) Management Sci. , vol.37 , Issue.12 , pp. 393-409
- Haurie, A.¹ Vial, J.-P.²

17
- 0024755290
- Finding minimum-cost circulations by canceling negative cycles
- (1989) J. ACM , vol.36 , Issue.4 , pp. 873-886
- Goldberg, A.V.¹ Tarjan, R.E.²

18
- 0020722515
- An efficient implementation of the network simplex method
- (1986) Math. Programming , vol.26 , pp. 83-111
- Grigoriadis, M.-D.¹

19
- 0009603863
- Technical report 93-112, Delft University of Technology, Faculty of Technical Mathematics and Informatics, Delft, The Netherlands
- (1993) A family of polynomial affine scaling algorithms for positive semi-definite linear complementarity problems
- Jansen, B.¹ Roos, C.² Terlaky, T.³

20
- 0009619462
- Technical report 93-36, Delft University of Technology, Faculty of Technical Mathematics and Informatics, Delft, The Netherlands
- (1993) A polynomial primal-dual Dikin-type algorithm for linear programming

21
- 84986985608
- On shortest path and sorting
- Boston, Boston, MA
- (1972) Proc. of Annual Conf. of ACM , pp. 510
- Johnson, E.¹

22
- 85037009219
- Computational and complexity results for an interior point algorithm for multicommodity flow problem
- Technical report TR-21/93, Departimento di Informatica, Università di Pisa, Italy. Extended abstract
- (1993) NETFLOW'93
- Kamath, A.¹ Karmarkar, N.² Ramakrishnan, K.³

23
- 51249181779
- A new polynomial time algorithm for linear programming
- (1984) Combinatorica , vol.4 , pp. 373-395
- Karmarkar, N.¹

24
- 0004127781
- Wiley-Interscience, John Wiley & Sons, Inc., New York
- (1980) Algorithms for Network Programming
- Kennington, J.L.¹ Helgason, R.V.²

25
- 85037021477
- Private communication
- (1998)
- Lemarechal, C.¹

26
- 85037014095
- Working paper, University of East Anglia, Norwich, NR4 7TJ, U.K.
- (1992) The theory of interior point algorithms for linear programming
- Ling, P.D.¹

27
- 0012043661
- Technical report NT/PAA/ATR/ORI/4491, France Telecom/CNET, France
- (1995) Joint optimal synthesis of base and reserve telecommunication networks
- Lisser, A.¹ Sarkissian, R.² Vial, J.-P.³

28
- 0004258219
- Technical report NT/PAA/ATR/ORI/4230, France Telecom/CNET, France
- (1995) Survivability in telecommunication networks

29
- 85037010708
- Unpublished paper
- (1993) Solving multicommodity flow problems with a primal embedded network simplex algorithm
- McBride, R.D.¹ Mamer, J.W.²

30
- 0003907589
- Wiley-Interscience, John Wiley & Sons, Inc., New York
- (1986) Mathematical Programming: Theory and Algorithms
- Minoux, M.¹

31
- 0004160242
- Prentice-Hall, Englewood Cliffs, NJ
- (1992) Network Programming
- Murty, K.¹

32
- 0022134586
- On the simplex algorithm for networks and generalized networks
- (1985) Math. Programming Stud. , vol.24 , pp. 166-178
- Odin, J.B.¹

33
- 0027554501
- A faster strongly polynomial minimum cost flow algorithm
- (1993) Oper. Res. , vol.41 , Issue.2 , pp. 338-350

34
- 0001563661
- Interior point algorithms for network flow problems
- J. Beasley, ed. Oxford University Press, Oxford, U.K.
- (1996) Advances in Linear and Integer Programming , pp. 145-186
- Resende, M.G.C.¹ Pardalos, P.²

35
- 0001024483
- An efficient implementation of a network interior point method
- D. S. Johnson, C. C. McGeoch, eds. American Mathematical Society. Providence, RI
- (1993) Network Flows and Matching: First DIMACS Implementation Challenge , vol.12 , pp. 299-348
- Veiga, G.¹

36
- 0001157796
- An implementation of the dual affine scaling algorithm for minimum cost flow on bipartite uncapaciated networks
- (1993) SIAM J. Optim. , vol.3 , pp. 516-537

37
- 0003477772
- Wiley Interscience, John Wiley & Sons, Inc., New York
- (1984) Network Flows and Monotropic Optimization
- Rockafellar, R.¹

38
- 0024303447
- Affine scaling for linear programs with free variables
- (1989) Math. Programming , vol.43 , pp. 31-44
- Vanderbei, R.J.¹

39
- 0000890375
- Algorithm 232, heapsort
- (1964) Comm. ACM , vol.7 , Issue.6 , pp. 347-348
- Williams, J.W.J.¹

40
- 84971922797
- Interior methods for constrained optimization
- A. Iserles, ed. 1992. Cambridge University Press, Cambridge, U.K.
- (1992) Acta Numerica , pp. 341-407
- Wright, M.H.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.