Author image not provided
 Harlan Pinkney Crowder

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article10.67
Citation Count96
Publication count9
Publication years1972-2001
Available for download1
Average downloads per article610.00
Downloads (cumulative)610
Downloads (12 Months)31
Downloads (6 Weeks)3
Arrow RightAuthor only

See all colleagues of this author

See all subject areas


9 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 9 of 9
Sort by:

January 2001 Interfaces: Volume 31 Issue 1, January 2001
Publisher: INFORMS
Citation Count: 9

Fingerhut mails up to 120 catalogs per year to each of its 7 million customers. With this dense mail plan and mailing decisions made independently for each catalog, many customers were receiving redundant and unproductive catalogs. To identify and eliminate this excessive operational expense, IBM and Fingerhut together developed an ...
Keywords: Marketing--segmentation, Statistics--cluster analysis

October 1983 Operations Research: Volume 31 Issue 5, October 1983
Publisher: INFORMS
Citation Count: 46

In this paper we report on the solution to optimality of 10 large-scale zero-one linear programming problems. All problem data come from real-world industrial applications and are characterized by sparse constraint matrices with rational data. About half of the sample problems have no apparent special structure; the remainder show structural ...
Keywords: 625 problem preprocessing, brand and bound, cutting planes, 628 facets of zero-one linear programs

January 1983
Citation Count: 0

This Thesis addresses a critical problem in the practical application of operations research: how to describe linear programming (LP) models to a computer. The data for such models occur naturally as sets of arrays, which are rectangularly arranged data aggregates. These input data quantify the operational and structural characteristics of ...

4 published by ACM
June 1979 ACM Transactions on Mathematical Software (TOMS): Volume 5 Issue 2, June 1979
Publisher: ACM
Citation Count: 15
Downloads (6 Weeks): 3,   Downloads (12 Months): 31,   Downloads (Overall): 610

Full text available: PDFPDF

April 1979 Management Science: Volume 25 Issue 4, April 1979
Publisher: INFORMS
Citation Count: 4

This paper presents and tests an effective optimization algorithm for clustering homogeneous data. The algorithm iteratively employs a subgradient method for determining lower bounds and a simple search procedure for determining upper bounds. The overall objective is to assign n objects to m mutually exclusive “clusters” such that the sum ...
Keywords: heuristics, integer programming applications, cluster analysis, Lagrangian relaxation

December 1978 Mathematical Programming: Series A and B: Volume 15 Issue 1, December 1978
Publisher: Springer-Verlag New York, Inc.
Citation Count: 0

This paper presents a set of recommended standards for the presentation of computational experiments in mathematical programming.
Keywords: Computation, Experimentation

March 1978 IBM Systems Journal: Volume 17 Issue 1, March 1978
Publisher: IBM Corp.
Citation Count: 0

The installation scheduling problem involves finding a program for installing a large number of sizes and types of items (e.g., machines) over time so as to optimize some measure (e.g., initial capital investment), subject to various resource constraints. Examples of this problem are scheduling the installation of point-of-sale terminals in ...

December 1974 Mathematical Programming: Series A and B: Volume 6 Issue 1, December 1974
Publisher: Springer-Verlag New York, Inc.
Citation Count: 15

The "relaxation" procedure introduced by Held and Karp for approximately solving a large linear programming problem related to the traveling-salesman problem is refined and studied experimentally on several classes of specially structured large-scale linear programming problems, and results on the use of the procedure for obtaining exact solutions are given. ...

July 1972 IBM Journal of Research and Development: Volume 16 Issue 4, July 1972
Publisher: IBM Corp.
Citation Count: 5

There are two procedures for applying the method of conjugate gradients to the problem of minimizing a convex, nonlinear function: the "continued" method, and the "restarted" method in which all the data except the best previous point are discarded, and the procedure is begun a new from that point. It ...

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us