79 results
Search Results
2. APPLIED STATISTICS ALGORITHMS SECTION.
3. OPTIMIZATION OF SERIES-PARALLEL-SERIES NETWORKS.
4. CUTTING-PLANE METHODS WITHOUT NESTED CONSTRAINT SETS.
5. Algorithm 457 Finding All Cliques of an Undirected Graph [ H ].
6. Error-Free Methods for Statistical Computations.
7. An Algorithm for Project (Job) Sequencing with Resource Constraints.
8. COMPLEMENTARY PROGRAMMING.
9. QUADRATIC BINARY PROGRAMMING WITH APPLICATION TO CAPITAL-BUDGETING PROBLEMS.
10. SOME EMPIRICAL TESTS OF THE CRISS-CROSS METHOD.
11. A NON-LINEAR EXTENSION OF THE SIMPLEX METHOD.
12. Accurate Floating-Point Summation.
13. ON THE COMPLEXITY OF SYMMETRIC COMPUTATIONS.
14. A TWO-STAGE DECOMPOSITION ALGORITHM FOR A GENERALIZED MULTI-COMMODITY FLOW PROBLEM.
15. MAXIMIZATION BY QUADRATIC HILL-CLIMBING.
16. Error Evaluation for Stemming Algorithms as Clustering Algorithms.
17. INVENTORY MODELS: OPTIMIZATION BY GEOMETRIC PROGRAMMING.
18. Problem Decomposition and Data Reorganization by a Clustering Technique.
19. A Generalized Approach to Dantzig-Wolfe Decomposition for Concave Programs.
20. ON THE OBJECTIVE FUNCTION FOR THE SEQUENTIAL P-MODEL OF CHANCE-CONSTRAINED PROGRAMMING.
21. ALGORITHMS FOR TARGETING STRIKES IN A LINES-OF-COMMUNICATION NETWORK.
22. COMPUTATIONAL ALGORITHMS FOR CONVEX STOCHASTIC PROGRAMS WITH SIMPLE RECOURSE.
23. NUMERICAL OPERATORS FOR STATISTICAL PERT CRITICAL PATH ANALYSIS.
24. A BRANCH-AND-BOUND ALGORITHM FOR MULTI-LEVEL FIXED-CHARGE PROBLEMS.
25. Notes.
26. On an Algorithm of Ghare and Taylor.
27. A Note on the Consistency between Two Approaches to Incorporate Data from Unreliable Sources in Bayesian Analysis.
28. The Application of Bayes's Theorem When the True Data State is Uncertain.
29. THE OPTIMAL ORDER TO SERVE IN CERTAIN SERVICING PROBLEMS.
30. A COMMENT ON SYMIV: AN ALGORITHM FOR THE INVERSION OF A POSITIVE DEFINITE MATRIX BY THE CHOLESKY DECOMPOSITION.
31. Algorithms.
32. Algorithms.
33. Algorithms.
34. 'Logical' Arithmetic on Computers with Two's Complement Binary Arithmetic.
35. Algorithms.
36. Experience with FORMAC Algorithm Design.
37. Computation in Discrete Stochastic Programs with Recourse
38. Finite Algorithms for Solving Quasiconvex Quadratic Programs.
39. A PRACTICAL GUIDE TO THE DUAL THEOREM.
40. COMPUTATIONAL EXPERIENCE WITH VARIANTS OF THE BALAS ALGORITHM APPLIED TO THE SELECTION OF R&D PROJECTS.
41. ON THE COMPUTATIONAL SOLUTION OF LINEAR PROGRAMMING PROBLEMS INVOLVING ALMOST-BLOCK-DIAGONAL MATRICES.
42. On the Numerical Properties of an Iterative Method for Computing the Moore- Penrose Generalized Inverse
43. Generation of the Admissible Boundary of a Convex Polytope
44. Location Theory: A Selective Bibliography
45. Computer Construction of "D-Optimal" First-Order Designs
46. An Algorithm for the Construction of "D-Optimal" Experimental Designs
47. Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
48. Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
49. A Finite Step Algorithm for Determining the "Strict" Chebyshev Solution to Ax = b
50. Numerical Construction of the Hill Functions
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.