24 results
Search Results
2. Basic Dual Feasible Solutions for a Class of Generalized Networks.
- Author
-
Glover, Fred, Klingman, D., and Napier, A.
- Subjects
ALGORITHMS ,LINEAR programming ,MATHEMATICAL programming ,PRODUCTION scheduling ,DYADS ,COMPUTATIONAL complexity - Abstract
The generalized network problem and the closely related restricted dyadic problem occur frequently in applications of linear programming. Although they are next in order of computational complexity after pure network or distribution problems, the jump in degree of difficulty is such that, in the most general problem, there exist no algorithms comparable in speed to those for pure networks. In this paper we characterize the properties of a special class of generalized network problems that permit a dual feasible basic solution to be determined in one 'pass' through the network. In particular, this class includes the class of pure network problems for which no such procedure has previously existed. Our algorithm also makes it possible to apply LEMKE'S dual method and the poly-ω technique of CHARNES AND COOPER in an efficient manner to solve capacitated (pure) network problems. [ABSTRACT FROM AUTHOR]
- Published
- 1972
- Full Text
- View/download PDF
3. Notes.
- Subjects
PERIODICAL publishing ,MATHEMATICAL programming ,UNIVERSITIES & colleges ,COMPUTATIONAL complexity ,INTEGER programming ,DYNAMIC programming - Abstract
This article presents an information related to a new journal "Mathematical Programming." This information is announced by the North-Holland Publishing Co., Journal Division in Amsterdam, the Netherlands. It will appear bi-monthly and its editor-in-chief is to be professor Michel L. Balinski of the City University of New York. This new English language journal will publish papers on every theoretical, computational, and applicational aspect of mathematical programming, that is, everything of direct or indirect use for questions surrounding the problem of finding the extreme values of functions of many variables. This includes along with the conventional topics in linear, nonlinear and integer programming, computer experimentation, technique for formulating and applying mathematical programming models, computer programming devices of special interest to the subject, unconstrained optimization, and control theory done in the spirit of mathematical programming.
- Published
- 1971
- Full Text
- View/download PDF
4. INVESTIGATION OF VARIOUS BOUNDING PROCEDURES FOR PRODUCTION SCHEDULING PROBLEMS.
- Author
-
Ashour, Said and Quraishi, M. N.
- Subjects
PRODUCTION (Economic theory) ,PRODUCTION scheduling ,METHODOLOGY ,PROBLEM solving ,EMPIRICAL research ,BRANCHING processes ,COMPUTATIONAL complexity - Abstract
This paper is concerned with the efficiency of the branch-and-bound technique for solving the production scheduling problem. Since the efficiency of this technique depends on a powerful lower bound, five promising bounding procedures are studied and investigated empirically. This investigation is based on the number of nodes explored and the computational time involved. Several computational experiments are conducted and results reported. [ABSTRACT FROM AUTHOR]
- Published
- 1969
5. THE EFFECT OF INFORMATION DELAYS IN A PRODUCTION CONTROL SYSTEM.
- Author
-
De Bruyn, C. S. Van Dobben and Muijen, A. R. W.
- Subjects
PRODUCTION control ,COMPUTATIONAL complexity ,QUALITY control charts ,ECONOMIC demand ,PRODUCTION (Economic theory) ,INFORMATIONS (Criminal procedure) ,MATHEMATICAL optimization - Abstract
This paper gives the results of computations, for a chosen production control model, yielding the extra costs incurred when information about a change in mean demand level becomes available at some rime relative to the time of the change. These extra costs are zero if the information is available from prehistoric times and increase monotonically as the detection moment shifts to later points of time. Only "jumplike" changes of mean demand level are considered. It is found that the extra costs as a function of the detection moment N approach a linear asymptote for high N. The points of contact of these results with control chart theory, especially the optimization of control charts as a link between predictors and production control, are mentioned. [ABSTRACT FROM AUTHOR]
- Published
- 1964
- Full Text
- View/download PDF
6. Iteration Skipping in Primal Integer Programming.
- Author
-
Arnold, Larry R. and Bellmore, Mandell
- Subjects
ALGORITHMS ,INTEGER programming ,MATHEMATICAL sequences ,ITERATIVE methods (Mathematics) ,MATHEMATICAL transformations ,COMPUTATIONAL complexity ,STOCHASTIC processes - Abstract
An examination of computational results using the simplified primal integer programming algorithm of GLOVER reveals the existence of long sequences of iterations following a specific pattern. This paper examines the structure of these sequences so that both the termination of a sequence and the tableau at that point can be predicted. It then constructs an algorithm that exploits this structure by performing the iterations of the sequence implicitly and presents computational results. [ABSTRACT FROM AUTHOR]
- Published
- 1974
- Full Text
- View/download PDF
7. PATHOLOGY OF TRAVELING-SALESMAN SUBTOUR-ELIMINATION ALGORITHMS.
- Author
-
Bellmore, Mandell and Malone, John C.
- Subjects
TRAVELING salesman problem ,COMMERCIAL agents ,ALGORITHMS ,PATHOLOGY ,PREVENTIVE medicine ,COMPUTATIONAL complexity - Abstract
The traveling-salesman problem has been the target of a substantial number of computational algorithms over the last two decades. Reported computational experience with these algorithms varies widely; authors, however, have generally failed to explain this variation adequately, or to offer predictive theories for their approaches. This paper (a) develops an underlying theory for the problem, (b) predicts pathological performance of some existing techniques, and (c) presents two algorithms, based upon the theory, with predictable polynomial growth in expected computation time and resistance to pathological problems. [ABSTRACT FROM AUTHOR]
- Published
- 1971
- Full Text
- View/download PDF
8. AN ALGORITHM FOR SEPARABLE NONCONVEX PROGRAMMING PROBLEMS.
- Author
-
Falk, James E. and Soland, Richard M.
- Subjects
ALGORITHMS ,NONCONVEX programming ,COMPUTATIONAL complexity ,FOUNDATIONS of arithmetic ,MATHEMATICAL models in business ,MATHEMATICAL programming ,MANAGEMENT science ,BRANCH & bound algorithms ,INTEGER programming ,COMPUTER programming ,MATHEMATICAL optimization ,BUSINESS mathematics - Abstract
In this paper we present an algorithm for solving mathematical programming problems of the form: Find x = (x[sub 1], ..., x[sub n]) to minimize Σφ[sub i] (x[sub i]) subject to x ε G and I ≤ x ≤ L. Each φ[sub i] is assumed to be lower semicontinuous, possibly nonconvex, and G is assumed to be closed. The algorithm is of the branch and bound type and solves a sequence of problems in each of which the objective function is convex. These problems correspond to successive partitions of the feasible set. Two different rules for refining the partitions are considered; these load to convergence of the algorithm under different requirements on the problem functions. Examples are given, and computational considerations are discussed. [ABSTRACT FROM AUTHOR]
- Published
- 1969
- Full Text
- View/download PDF
9. Numerical Mathematics and Computer Science.
- Author
-
Traub, J. F.
- Subjects
NUMERICAL analysis ,COMPUTER algorithms ,COMPUTATIONAL complexity ,COMPUTER training ,MATHEMATICAL programming ,MACHINE theory ,COMPUTER programming ,MATHEMATICAL optimization ,CYBERNETICS - Abstract
Numerical mathematics is viewed as the analysis of continuous algorithms. Four of the components of numerical mathematics are discussed. These are: foundations (finite precision number systems, computational complexity), synthesis and analysis of algorithms, analysis of error, programs and program libraries. [ABSTRACT FROM AUTHOR]
- Published
- 1972
- Full Text
- View/download PDF
10. NOTE ON "MUNICIPAL BOND COUPON SCHEDULES WITH LIMITATIONS ON THE NUMBER OF COUPONS"
- Author
-
Freimer, Marshall, Rao, Mendu R., and Weingartner, H. Martin
- Subjects
MUNICIPAL bonds ,DYNAMIC programming ,COMPUTATIONAL complexity ,MATHEMATICAL optimization ,GOVERNMENT securities ,MATHEMATICAL programming ,MATHEMATICAL models ,LINEAR programming ,INTEGER programming - Abstract
The optimal coupon schedule for municipal bonds with limits on the number of distinct coupons is formulated in terms of two different dynamic programming models which, in contrast to the companion paper, do guarantee an optimal solution, although at the cost of additional computational difficulty. [ABSTRACT FROM AUTHOR]
- Published
- 1972
- Full Text
- View/download PDF
11. Coding for Engineering Speed.
- Subjects
CODING theory ,ENGINEERING ,TECHNOLOGY ,EDUCATION ,CALCULATORS ,COMPUTATIONAL complexity - Abstract
Presents an abstract of the article "Coding for Engineering Speed," published in the periodical "Chemical and Engineering News." Establishment of a code library containing computers' instructions for problems in chemical, civil, electrical, and mechanical engineering; Information that a client for engineering computations may need to pay only for the actual time spent for the operations done on the calculator.
- Published
- 1955
12. An Efficient Context-Free Parsing Algorithm.
- Author
-
Earley, Jay
- Subjects
PARSING (Computer grammar) ,COMPUTER algorithms ,PROGRAMMING languages ,LINGUISTIC context ,GRAMMAR ,COMPUTATIONAL linguistics - Abstract
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to n
3 (where n is the length of the string being parsed) in general; it has an n2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick. [ABSTRACT FROM AUTHOR]- Published
- 1970
- Full Text
- View/download PDF
13. Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems
- Author
-
Young, Paul
- Published
- 1973
- Full Text
- View/download PDF
14. What Digital Computing Machines Really Are.
- Author
-
Busser, John H.
- Subjects
COMPUTER systems ,COMPUTER storage devices ,COMPUTER operating systems ,COMPUTER input-output equipment ,PUNCHED card systems ,PROGRAMMING languages ,COMPUTATIONAL complexity ,MACHINE theory ,HUMAN-computer interaction - Abstract
The article describes digital computing machines and their role in the society. It notes that digital computing machines store their own instructions, processing from one to the next in order, and performing the necessary manipulations on numbers. The parts of an individual computing machine include input systems, output systems, control/logic system, and memory systems. Each of these parts is described in detail in the article. Information on how these machines should be operated by human beings is provided. Instruct
- Published
- 1970
- Full Text
- View/download PDF
15. GENERALIZED EQUIVALENT INTEGER PROGRAMS AND CANONICAL PROBLEMS.
- Author
-
Faaland, Bruce
- Subjects
INTEGER programming ,EQUIVALENCE classes (Set theory) ,MANAGEMENT science ,THEORY ,MANAGERIAL economics ,ALGORITHMS ,COMPUTATIONAL complexity ,MANAGEMENT ,STATISTICAL decision making - Abstract
The theory of equivalent integer programs is generalized so that a set of minimal canonical problems always exists within each equivalence class. An example is used to demonstrate how highly computation time depends on the particular canonical problem chosen to be solved by implicit enumeration algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 1974
- Full Text
- View/download PDF
16. SET PARTITIONING AND CHAIN DECOMPOSITION.
- Author
-
Nemhauser, G. L., Trotter, L. E., and Nauss, R. M.
- Subjects
BRANCH & bound algorithms ,MANAGEMENT science ,ALGEBRA ,COMPUTATIONAL complexity ,FOUNDATIONS of arithmetic ,MANAGEMENT ,ACYCLIC model ,MANAGERIAL economics ,INDUSTRIAL management - Abstract
There is given a finite set I and a family of subsets of I. We consider the problem of determining a minimum cardinality subfamily that is a partition of I. A branch-and-bound algorithm is presented. The bounds are obtained by determining chain decompositions of directed acyclic graphs. The computation time required to determine a bound is bounded by a polynomial in the cardinality of I. Some computational experience is reported and relationships with other methods are discussed. [ABSTRACT FROM AUTHOR]
- Published
- 1974
- Full Text
- View/download PDF
17. ON OPTIMUM TARGET ASSIGNMENTS.
- Author
-
Denbroeder Jr., G. G., Ellison, R. E., and Emerling, L.
- Subjects
ALGORITHMS ,MILITARY science ,COMPUTATIONAL complexity ,OPERATIONS research ,VALUES (Ethics) ,EXPECTED returns ,MACHINE theory ,ELECTRONIC data processing - Abstract
This note is concerned with two target assignment models An optimum assignment is one which maximizes the expected value of targets destroyed The first model, which admits an explicit solution, associates values only with the number of targets destroyed An algorithm which enjoys a computational nicety is established when the values of the individual targets are assumed known This latter model is a special case of Flood's target- assignment model [ABSTRACT FROM AUTHOR]
- Published
- 1959
- Full Text
- View/download PDF
18. COMPUTATION OF GOOD-WILL PROFITS.
- Author
-
Foreman, C. J.
- Subjects
PROFIT ,COMPUTATIONAL complexity ,BUSINESS ,ECONOMISTS ,ACCOUNTING ,ECONOMICS - Abstract
It is the purpose of the present discussion to point out the different methods of computing the various profits of good-will. The importance of this topic lies chiefly in the fact that in their confusion of good-will concepts both jurists and accountants fail to distinguish the returns of efficiency from those of exploitation. In fact, the legal interpretation of consumers' good-will includes in its scope practically all forms of profit, and is, therefore, in many aspects unsound. This confusion of earned and unearned returns in the profits of good-will may more readily be seen if, for purposes of analysis, the incomes of good-will are classified into two separate groups, depending on whether they appear as present or future gains. Reference to such present profits is frequently made by jurists, but seldom do accountants refer to them except in determining the present cost of good-will or in arriving at a proper basis for estimating its future value. Nevertheless, so long as the legal computation of such present good-will profits fails to separate the gains of hard-earned efficiency from unearned increments of good-will exploitation, it presents to the economist a subject of great interest.
- Published
- 1925
19. A COMPUTATIONAL APPROACH TO THE SELECTION OF AN OPTIMAL NETWORK.
- Author
-
Hoc, Hoang Hai
- Subjects
BOTTLENECKS (Manufacturing) ,COMPUTER systems ,ALGORITHMS ,ROUTING (Computer network management) ,QUEUING theory ,COMPUTATIONAL complexity ,COMPUTER networks ,BREAKDOWNS (Machinery) ,COMPUTERS - Abstract
We consider the problem of selecting an optimal traffic network in its simplest form, where there are no congestion costs. The superadditive effect of deleted links on the objective function is pointed out and used to develop some implicit enumeration procedures for this problem. Some efforts are devoted to evaluate these algorithms, and to show how to stop the computations with an "acceptable" approximate solution when computations are taking too much time. [ABSTRACT FROM AUTHOR]
- Published
- 1973
- Full Text
- View/download PDF
20. THE LOADING PROBLEM.
- Author
-
Eilon, Samuel and Christofides, Nicos
- Subjects
MATHEMATICAL models in business ,LOADING & unloading ,MANAGEMENT ,HEURISTIC ,MATERIALS handling ,MANAGEMENT science ,RESOURCE allocation ,RESEARCH methodology ,ALGORITHMS ,RESOURCE management ,COMPUTATIONAL complexity ,ORGANIZATIONAL research - Abstract
The loading problem is defined as the allocation of given items with known magnitude to boxes with constrained capacity, so as to minimize the number of boxes required. Two methods of solution are considered: The first is by a zero-one programming model, for which the solution procedure is described; the second is by a heuristic algorithm. Fifty problems were solved by the two methods and in all but two the second method yielded the optimal solution with significantly less computing time than that needed by the first method. [ABSTRACT FROM AUTHOR]
- Published
- 1971
- Full Text
- View/download PDF
21. COMPUTING IN MANAGEMENT SCIENCE.
- Author
-
Hurd, Cuthbert C.
- Subjects
ELECTRONIC data processing ,INFORMATION storage & retrieval systems ,MANAGEMENT science ,PUNCHED card systems ,MAGNETIC tapes ,MANAGEMENT simulation methods ,LINEAR programming ,COMPUTER programming ,COMPUTATIONAL complexity ,IBM computers ,DATA entry ,COMPUTER input-output equipment - Abstract
The article discusses the emerging technology of computers in the context of management science. The author differentiates between computers and data processors. Magnetic tapes, such as those used by the IBM Electronic Data Processing Machines, are discussed, as are punch cards. The mathematical formulation of problems through the use of linear equations is discussed, as is the application of computing equipment to solve them. In case where a unique solution is not possible, the article describes the application of maximization. Linear programming and the simplex method are discussed. Simulation is used in cases where neither a unique nor an optimum solution can be obtained directly. This may include train scheduling, bus scheduling, airplane scheduling, and other applications.
- Published
- 1955
- Full Text
- View/download PDF
22. PSYCHOLOGICAL PREDICTION FROM ACTUARIAL TABLES.
- Author
-
Lykken, David T. and Rose, Richard
- Subjects
COMPUTATIONAL complexity ,PSYCHOLOGISTS ,ELECTRONIC data processing ,ANALYSIS of variance ,ASSIMILATION (Sociology) ,MACHINE theory - Abstract
The article reports on computational complexities in psychological prediction. Modern regression theory provides such versatile and powerful methods of multivariate prediction and discrimination that there may seem to be little point in inquiring into radically different approaches to these problems. The most mundane of these considerations relates to the computational difficulties involved in obtaining multivariate regression or discriminating functions from the data of the criterion sample. In spite of the advent of the digital computer, computational complexities are still an obstacle to the average psychologist-user of these methods. The most serious of several limitations of conventional multivariate prediction methods is their assumption of homoscedasticity. Since various regions of the predictor space will often differ widely in predictive validity, an optimum method would allow the psychometrist to estimate the confidence associated with each individual prediction and would maximize validity for valid regions of the predictor space rather than overall average validity.
- Published
- 1963
- Full Text
- View/download PDF
23. Bibliographies in SIG/SIC Newsletters.
- Subjects
BIBLIOGRAPHY ,COMPUTATIONAL complexity ,SEMANTICS ,COMPUTERS - Abstract
A list of bibliographical materials available to readers of Association for Computing Machinery publications. Included are "Computational Complexity: A Bibliography," by Marek I. Irland, "Bibliography on Computer Semantics," by Bertram Raphael and Ann Robinson and "An Annotated Bibliography for Computer Aided Routing and Placement," by David C. Wilson and Robert J. Smith III.
- Published
- 1974
24. Computational Complexity of Iterative Processes
- Author
-
Joseph F. Traub
- Subjects
Average-case complexity ,Mathematical optimization ,Theoretical computer science ,General Computer Science ,Computer science ,General Mathematics ,Complete ,Computational resource ,Computational complexity ,PH ,Dynamic problem ,Iterative methods (Mathematics) ,FOS: Mathematics ,Asymptotic computational complexity ,Computational problem ,Mathematics ,Quantum complexity theory - Abstract
The theory of optimal algorithmic processes is part of computational complexity. This paper deals with analytic computational complexity. The relation between the goodness of an iteration algorithm and its new function evaluation and memory requirements are analyzed. A new conjecture is stated.
- Published
- 1972
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.