Search Results - subject:"Algorithms"

Discovery algorithms for hierarchical relations

Price, Lewis; Dayton, C.; Macready, George - In: Psychometrika 45 (1980) 4, pp. 449-465

Persistent link: https://www.econbiz.de/10005758052

Invited Note---Some References for the Ellipsoid Algorithm

Wolfe, Philip - In: Management Science 26 (1980) 8, pp. 747-749

From personal interest and also on behalf of the Mathematical Programming Society I have been trying to keep afloat in the flood of writing that followed Khachian's "Polynomial Time Algorithm for Linear Programming" (Khachian, L. G. 1979. A polynomial algorithm in linear programming. Dokl. Akad....

Persistent link: https://www.econbiz.de/10009192020

A Land Management Model Using Dantzig-Wolfe Decomposition

Nazareth, L. - In: Management Science 26 (1980) 5, pp. 510-523

This paper deals with a mathematical model designed to provide guidelines for managing a land resource over an extended period of time. We develop a framework which permits sequences of management decisions to be conveniently formulated, and their associated costs and benefits specified. This...

Persistent link: https://www.econbiz.de/10009197880

Simple Ranking Methods for Allocation of One Resource

Zipkin, Paul H. - In: Management Science 26 (1980) 1, pp. 34-43

, finite algorithms. The major purpose of this paper is to present these results in a unified framework, which then permits …

Persistent link: https://www.econbiz.de/10009198243

Note---A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem

Bagga, P. C.; Kalra, K. R. - In: Management Science 26 (1980) 6, pp. 633-636

In this note, a node elimination procedure has been suggested in case the two sequences obtained by using Townsend's (Townsend, W. 1978. The single machine problem with quadratic penalty function of completion times: A branch and bound solution. Management Sci. 24 (5) 530--534.) sufficient...

Persistent link: https://www.econbiz.de/10009204278

Worst-Case Analysis of Heuristic Algorithms

Fisher, Marshall L. - In: Management Science 26 (1980) 1, pp. 1-17

The increased focus on heuristics for the approximate solution of integer programs has led to more sophisticated analysis methods for studying their performance. This paper is concerned with the worst-case approach to the analysis of heuristic performance. A worst-case study establishes the...

Persistent link: https://www.econbiz.de/10009204649

Pivot and Complement--A Heuristic for 0-1 Programming

Balas, Egon; Martin, Clarence H. - In: Management Science 26 (1980) 1, pp. 86-96

Pivot and Complement is a heuristic for finding approximate solutions to 0-1 programming problems. It uses the fact that a 0-1 program is equivalent to the associated linear program with the added requirement that all slack variables, other than those in the upper bounding constraints, be basic....

Persistent link: https://www.econbiz.de/10009209052

A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem

Shepardson, Fred; Marsten, Roy E. - In: Management Science 26 (1980) 3, pp. 274-281

The two duty period scheduling problem is an integer programming problem with 0-1 constraint coefficients. It is recognized that the problem can be reformulated as a one duty period problem with side constraints. Since the one duty period problem can be solved as a minimal cost network flow...

Persistent link: https://www.econbiz.de/10009209165

How to Get the Blanchard-Kahn Form from a General Linear Rational Expectations Model

Boucekkine, Raouf; Van, Cuong Le; Schubert, Katheline - Society for Computational Economics - SCE

In this paper we prove that every linear model with rational expectations can be transformed by means of an one-to-one mapping into another model which has one of the following properties: i) it is degenerated, ii) it is backward, iii) it has a Blanchard-Kahn form. In addition to some simple...

Persistent link: https://www.econbiz.de/10005537519

Principles of Data Mining

Hand, David J.; Mannila, Heikki; Smyth, Padhraic - The MIT Press

, provides a tutorial overview of the principles underlying data mining algorithms and their application. The presentation … emphasizes intuition rather than rigor. The second section, data mining algorithms, shows how algorithms are constructed to solve … specific problems in a principled manner. The algorithms covered include trees and rules for classification and regression …

Persistent link: https://www.econbiz.de/10004973293