DISKETTE SUBDIRECTORIES.
- Published in:
- Annals of Operations Research, 1988, v. 13, n. 1-4, p. 431
- Publication type:
- Article
Works matching IS 02545330 AND DT 1988 AND VI 13 AND IP 1-4
Results: 11
1
2
LIST OF SUBROUTINES.
- Published in:
- Annals of Operations Research, 1988, v. 13, n. 1-4, p. 425
- Publication type:
- Article
3
LIST OF ALGORITHMS.
- Published in:
- Annals of Operations Research, 1988, v. 13, n. 1-4, p. 423
- Publication type:
- Article
4
A HYBRID ALGORITHM FOR FINDING THE kTH SMALLEST OF n ELEMENTS IN O(n) TIME.
- Published in:
- Annals of Operations Research, 1988, v. 13, n. 1-4, p. 401, doi. 10.1007/BF02288326
- By:
- Publication type:
- Article
5
ALGORITHMS FOR FINDING OPTIMUM TREES: DESCRIPTION, USE AND EVALUATION.
- Published in:
- Annals of Operations Research, 1988, v. 13, n. 1-4, p. 265, doi. 10.1007/BF02288325
- By:
- Publication type:
- Article
6
SOLVING NON-BIPARTITE MATCHING PROBLEMS VTA SHORTEST PATH TECHNIQUES.
- Published in:
- Annals of Operations Research, 1988, v. 13, n. 1-4, p. 225, doi. 10.1007/BF02288324
- By:
- Publication type:
- Article
7
ALGORITHMS AND CODES FOR THE ASSIGNMENT PROBLEM.
- Published in:
- Annals of Operations Research, 1988, v. 13, n. 1-4, p. 193, doi. 10.1007/BF02288323
- By:
- Publication type:
- Article
8
THE RELAX CODES FOR LINEAR MINIMUM COST NETWORK FLOW PROBLEMS.
- Published in:
- Annals of Operations Research, 1988, v. 13, n. 1-4, p. 125, doi. 10.1007/BF02288322
- By:
- Publication type:
- Article
9
A COMPUTATIONAL COMPARISON OF THE DINIC AND NETWORK SIMPLEX METHODS FOR MAXIMUM FLOW.
- Published in:
- Annals of Operations Research, 1988, v. 13, n. 1-4, p. 83, doi. 10.1007/BF02288321
- By:
- Publication type:
- Article
10
SHORTEST PATH ALGORITHMS.
- Published in:
- Annals of Operations Research, 1988, v. 13, n. 1-4, p. 3, doi. 10.1007/BF02288320
- By:
- Publication type:
- Article
11
INTRODUCTION.
- Published in:
- 1988
- Publication type:
- Book Chapter