#jsDisabledContent { display:none; } My Account | Register | Help

Search Results (69 titles)

Searched over 21.6 Million titles in 0.64 seconds

 Federated Media Type

Programming (X) Arithmetic (X)

 1|2|3|4 Records: 41 - 60 of 69 - Pages:
 Book Id: WPLBN0003761114 ► Abstract
 Book Id: WPLBN0003760946 Subjects: Programming, Mathematics, Notes, Programming ► Abstract
 Book Id: WPLBN0003761695 Subjects: Programming, Mathematics, Algebra, Programming ► Abstract
 Book Id: WPLBN0003761717 ► Abstract
 Book Id: WPLBN0003842746 Subjects: Fundamentals, C++, Programming, Programming ► Abstract
 Book Id: WPLBN0001029521 ► Abstract Full Text Search Details...aditionally the 1-dimensional knapsack problem is solved by means of dynamic programming. The multi- dimensional problem is usually reduced to a one-d... ... one. Additional algorithms are developed which are applied within a dynamic programming framework. Given these, the object is to obtain solutions eff... ...constraints are not entirely rigid, a different formulation, based on linear programming, may be more appropriate, as was analyzed in [7]- A i4j_ ji j... ...purpose of this paper is to describe computational methods, based on dynamic programming, for the solution of allocation with rigid con- straints. The... ...ve purposes (if not for computation) the problem may be stated as an integer programming problem. Let b. be the payoff from in- clusion of project i, ... ...c are nonnegative the model in (l) may be solved, in principle, as a dynamic programming problem as follows : (2) f.(C-^,C^,...,Cp = max^ [b.x. + f._^... ... vector C = (C', C', . . ., C' ). As stated above, the stages of the dynamic programming calculations are the computation of un- daninated feasible st... ...scussed in a separate section, below. Straightforward application of dynamic programming to this problem, as reported in [6j, proved inadequate to the... ...t problem appears to bear a certain resemblance to the dual method of linear programming. A minimization has been stubstituted for the original maximi...
 Book Id: WPLBN0000251098 ► Abstract Full Text Search Details... by JEREMY F. SHAPIRO GENERALIZED LAGRANGE MULTIPLIERS IN INTEGER PROGRAMMING by Jeremy F. Shapiro March 7, 1969 Working Paper 371-69 ABSTRA... ...Jeremy F. Shapiro March 7, 1969 Working Paper 371-69 ABSTRACT The integer programming problem is reformulated using group theory thereby allowing a n... ... theory thereby allowing a new Lagrangian optimization problem for integer programming to be constructed. The properties of this problem and its relat... ...l multipliers are also given. GENERALIZED LAGRANGE MULTIPLIERS IN INTEGER PROGRAMMING 1 . Introduction Several authors ([3], [4], [8], [9], [10], [14... ...alized Lagrangian methods for finding good or optimal solutions to integer programming problems. The capital budgeting problem of Lorie and Savage [9]... ...an in [8] can yield an optimal solution only if there is an optimal linear programming solution that is integer. In this paper, we use group theory ([... ... group theory ([5], [6], [7], [11], [12], [13]) to reformulate the integer programming problem, thereby obtaining a Lagrangian problem which appears t... ...which some of the previous results are specialized to the zero-one integer programming problem. 6^9G42 2. Construction of the Lagrangian Problem and ... ...truction of the Lagrangian Problem and Its Properties Consider the Integer programming problem In the form mln cw s.t. Aw = b (1) w non-negative integ...
 Book Id: WPLBN0000539508 ► Abstract Full Text Search Details... Classic Literature Collection World Public Library.org FOR INTEGER PROGRAMMING PROBLEMS Title: AN ADAPTIVE GROUP THEORETIC ALGORITHM FO... ...MMING PROBLEMS Title: AN ADAPTIVE GROUP THEORETIC ALGORITHM FOR INTEGER PROGRAMMING PROBLEMS Author: G. ANTHONY GORRY Language: English Subject:... ...ry.net Preliminary Draft AN ADAPTIVE GROUP THEORETIC ALGORITHM FOR INTEGER PROGRAMMING PROBLEMS 318-68 G, Anthony Gorry and Jeremy F, Shapiro MASS, ... ... 1958 DtVt'tY U3?.APY Abstract A prototypical algorithm for solving integer programming problems is presented The algorithm combines group theoretic ... ...is paper is the construction of a prototypical algorithm for solving integer programming (LP) problems which integrates diverse analytical methods und... ...ithm on a given IP problem depends on the choice of cuts added to the linear programming (LP) problem at each iteration [17]. Thus, it appeared to us ... ... with a variable integer m-vector b(b=b ). From the point of view of dynamic programming, b is the state vector, and it should be clear to the reader ... ... to the reader that there is an intimate connection between discrete dynamic programming and tree search. In Section 2, we discuss briefly the IP prob... ...ree search. In Section 2, we discuss briefly the IP problem from the dynamic programming point of view. It is to be emphasized, however, that dynamic ...
 Book Id: WPLBN0000435823 ► Abstract Full Text Search Details... Literature Collection World Public Library.org A GROUP THEORETIC INTEGER PROGRAMMING ALGORITHM Title: COMPUTATIONAL EXPERIENCE WITH A GROUP T... ...LGORITHM Title: COMPUTATIONAL EXPERIENCE WITH A GROUP THEORETIC INTEGER PROGRAMMING ALGORITHM Author: ANTHONY GORRY Language: English Subject: F... ...T. TECH. JUL 22 1972 Computational Experience with a Group Theoretic Integer Programming Algorithm* by , G. Anthony _Gorry and Jeremy F. Shapiro May, ... ...specific computational details and experience with a group theoretic integer programming algorithm. Included among the subroutines are a matrix reduct... ...mization problems, and a branch and bound search for finding optimal integer programming solu- tions. The innovative subroutines are shown to be effic... ...s are shown to be efficient to compute and effective in finding good integer programming solutions and providing strong lower bounds for the branch an... ...ction In this paper we report on computational experience with a new integer programming algorithm (IPA). Details of how group theory can be used to s... ...e the m vector with components b . . Problem (1) is solved first as a linear programming (LP) problem by a simplex algorithm. Without loss of generali... ...elled with the names of the principal system subroutines (e.g. LP for linear programming, etc.). In what follows, we will discuss each component brief...
 Book Id: WPLBN0003761470 Subjects: Programming, Mathematics, Theory, Programming ► Abstract
 Book Id: WPLBN0003761911 ► Abstract Description DetailsDescription: This book explains all the basic concepts in assembly language programming.
 Book Id: WPLBN0000344697 ► Abstract Full Text Search Details...s formulated as an Integer Program and the asymptotic algorithm of integer programming is applied. A simple way of getting the group problem is obtain... ...nvestigators..."^ 2 In this paper, the group theoretic approach to integer programming will be applied to this problem. We will formulate this problem... ...ional Academy of Sciences, 53 , pp. 250-256, (1965). Shapiro, J., "Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer P... ...h 1^, pp. 103-121, (1968), and "Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm," Operations Resea... ...s Research 16, pp. 928-947, (1968). In section 1 of this paper an integer programming formulation of the Job Shop Scheduling problem is presented. We... ...erical example and section 6 contains some concluding remarks . 1. Integer Programming Formulation The n/m job-shop problem involves n jobs which must... ...Job/Task 1 2 3 4 5 1 9 3 6 5 2 2 3 3 7 5 7 3 8 5 5 Process Times Job/Task programming techniques. Finally, we let y be a 0-1 variable equal to 1 if j... ...l follow the strategy suggested by the group theoretic 3pproach to integer programming. Beginning with the optimal LP solution to (1), (2) and (3) whi... ... investigated. Shapiro, J.F., "Generalized Lagrange Multipliers in Integer Programming," M.I.T. Working Paper 371-69, March 7, 1969, revised January 5...
 Book Id: WPLBN0000251103 ► Abstract Full Text Search Details.... SEP 7 1971 DEWEY LIBRARY A Generalized Proqramminq Alaorithn for Integer Programming Problems with Many Columns* frank. Jeremy F. Shapiro August, 19... ... part by the U.S. Army Research Office (Durham). Abstract The generalized programming algorithm consists of major iterations and minor iterations; ea... ...mory cut. A minor iteration corresponds to the solution of a master linear programming problem and a group optimization problem. Activities can be del... ...rated during the minor iteration. The algorithm allows most of the integer programming columns to be kept in secondary storage and evaluated in core o... .... I srsosa Introduction One of the major computational problems of linear programming (LP) and integer programming (IP) is dealing with the large num... ...f many columns in LP has been solved, at least in part, by the generalized programming method of Dantzig and Wolfe ([2]). This method can be viewed as... ...ced cost) activities. Our puroose here is to provide a similar generalized programming algorithm for IP which makes it possible for most of the column... ...ding an optimal LP basis, either in the conventional way or by generalized programming. If the computational effort required to find an optimal LP bas... ...eat, any LP basis will suffice. This feature is important when generalized programming is used to solve LP(1) because of its slow convergence characte...
 Book Id: WPLBN0003842783 ► Abstract
 Book Id: WPLBN0003842560 Subjects: 88 C Programs, C, Programming, Programming ► Abstract
 Book Id: WPLBN0001199041 ► Abstract
 Book Id: WPLBN0003761101 ► Abstract
 Book Id: WPLBN0002689523 ► Abstract
 Book Id: WPLBN0003761862 ► Abstract
 Book Id: WPLBN0003761977 ► Abstract
 Book Id: WPLBN0003842460 ► Abstract Description Details...ariables. This manual attempts to be a full description of Emacs Lisp. For a beginner’s introduction to Emacs Lisp, see An Introduction to Emacs Lisp Programming, by Bob Chassell, also published by the Free Software Foundation. This manual presumes considerable familiarity with the use of Emacs for editing; see The GNU Emacs Manual for this basic information....
 Book Id: WPLBN0003842528 ► Abstract Table of Contents Details...iagnosis of Discrete Event Systems with Petri Nets - Augmented Marked Graphs and the Analysis of Shared Resource Systems - Incremental Integer Linear Programming Models for Petri Nets Reachability Problems - Using Transition Invariants for Reachability Analysis of Petri Nets - Reliability Prediction and Sensitivity Analysis of Web Services Composition - Petri Nets for Comp...
 Book Id: WPLBN0003761943 ► Abstract
 Book Id: WPLBN0003842529 ► Abstract
 Book Id: WPLBN0002625389 ► Abstract
 Book Id: WPLBN0001320797 ► Abstract Full Text Search Details...L OF MANAGEMENT The Synchronization of Traffic Signals by Mixed-Integer Linear Programming John D. C. Little 129-65 MASS. INST. TECH. I MASS. INST.... ...6; DEWn IjBRARL The Synchronization of Traffic Signals by Mixed-Integer Linear Programming -J-' f\.^^ John D. C. Little 129-65 MASS. INST. TECH. JAN 2... ...w formulation offers no advantages and many disadvantages. However, the linear programming format opens up the possibility of solving more general pro... ...ack and artificial variables. 2.5 Determining the Synchronization . The linear programming variables determine the synchronization of the signals. Let... ...e algorithms presently available for solving the general mixed- integer linear programming problem are usually considered only partially satisfactory.... ...orithmwere carried out manually except for the linear programs. In some linear programming codes^ it is possible to suppress constraints. Then the ent...
 Book Id: WPLBN0001365067 ► Abstract
 Book Id: WPLBN0000344692 Collections: American Libraries Collection ► Abstract Full Text Search Details...et A GROUP THEORETIC BRANCH AND BOUND ALGORITHM FOR THE ZERO-ONE INTEGER PROGRAMMING PROBLEM* by ** Jeremy F. Shapiro December 18, 1967 Working Pape... ... ** The author is indebted, to Wayne W. Baxter for his invaluable computer programming contributions. ABSTRACT This paper contains a new algorithm fo... ...ns. ABSTRACT This paper contains a new algorithm for the zero-one integer programming problem. A given problem is solved first as a linear programmin... ...itly. The algorithm of this paper finds an optimal solution to the integer programming problem by implicitly enumerating all feasible solutions. Each ... ....rji7 1. Introduction In [12], Gomory showed how to transform the integer programming problem into a group optimization problem. The transformation r... ...a group optimization problem. The transformation requires that the integer programming problem be solved first as a linear programming (LP) problem. I... ...ructure of the group problem when compared to that of the original integer programming problem. More- over, the group setting appears to be a particul... ...ularly good one for resolving the number theoretic difficulties of integer programming. In particular, the group problem can be viewed ([25]) as a spe... ...er of nodes and arcs. The set of all feasible solutions to a given integer programming problem corresponds to a collection of paths connecting a speci...
 Book Id: WPLBN0000344693 Collections: American Libraries Collection ► Abstract Full Text Search Details...HONY GORRY Classic Literature Collection World Public Library.org PROGRAMMING ALGORITHM Title: A GROUP THEORETIC INTEGER PROGRAMMING ALG... ...net MA3ti,-;;r.r£CH. MAR 12 1S71 BIWEY LIBRARY A Group Theoretic Integer Programming Algorithm: System Design and Computational Experience by 6. Ant... ...13-71 February 1971 Introduction In this paper we report on a new integer programming algorithm (IPA). The central idea upon which this algorithm is ... ...oup. In order to apply this classical approach of number theory to integer programming (IP) problems, it is necessary to take into account non-negativ... ...hich are indicative of our experience with a variety of real world integer programming problems. Computational experience has indicated that group the... ...qualitative as well as quantitative insights into the structure of integer programming problems. Our plan for this paper is as follows. First, we will... ...o: (1) obtain an optimal solution to the continuous version of the integer programming problem, (2) transform the problem to a group optimization prob... ... the way in which the system can be used to manipulate the data of integer programming problems. This data manipulation allows the system to find an o... ...ffort. Finally, we discuss some of our experience in solving large integer programming problems. The system we will be discussing is currently impleme...
 1|2|3|4 Records: 41 - 60 of 69 - Pages: