This is a prospective on the research in the intersection of mathematics and artificial intelligence that I see as having been the most important over the past 10 years and that I think should be...
Mitochondrial Metabolic Network Based on Proteomic and Biochemical Data * □S (2009)
Thuy D. Vo, Harvey J. Greenberg, Bernhard O. Palsson
Diverse datasets including genomic, proteomic, isotopomer, and DNA sequence variation are becoming available for human mitochondria. Thus there is a need to integrate these data within an in silico...
THE ROLE OF SOFTWARE IN OPTIMIZATION AND (2008)
mathematical programming systems
Representing Uncertainty in Decision Support (2008)
There are more than 20 measures of uncertainty and many modeling paradigms. The research question is, “How do we know which is the right choice in an OR/MS situation? ” My talk listed some of...
Representing Super- Sparse Matrices with Perturbed Values (2008)
D. Shanno, Harvey J. Greenberg, Richard P. O'neill
This paper describes a form of purposeful data perturbation in a linear programming model which pertains to uncertainties in the magnitudes of the matrix coefficients. A problem in value pool...
North-Holland Views of mathematical programming models and their instances * (2008)
Harvey J. Greenberg, Frederic H. Murphy
Large-scale mathematical models are built, managed and applied by people with different cognitive skills. This poses a challenge for the design of a multi-view architecture of a system that...
� Possibility [Zadeh, 1965] (2008)
Harvey J. Greenberg, Saul I. Gass, Blaise Pascal, Harvey J. Greenberg
also at my web site: www-math.cudenver.edu/~hgreenbe/
Annals of Operations Research 12(1988)199-215 LOGICAL TESTING FOR RULE-BASE MANAGEMENT (2008)
Fred Glover, Harvey J Greenberg
We present a procedure to logically reduce simple implications that comprise the rule-base of an expeqt system. Our method uses topological sorting on a digraph representation that detects logical...
Jean-paul Watson, William E. Hart, Harvey J. Greenberg
Recent events have significantly increased the level of interest in using sensors to detect the presence of contaminants in municipal water distribution systems. A key deployment issue is identifying...
Harvey J. Greenberg, William E. Hart
minimum energy, bioinformatics, molecular structure prediction, protein folding, protein alignment, rearrangements, assembly, sequence alignment, SNP, sorting by reversals Optimization in...
Opportunities for Combinatorial Optimization (2007)
In Computational Biology, Harvey J. Greenberg, William E. Hart
This is a survey designed for mathematical programming people who do not know molecular biology and want to learn the kinds of combinatorial optimization problems that arise. After a brief...
Preparing Manuscripts for the INFORMS Journal on (2007)
Computing David Kelton, W. David Kelton, Yong Liu, Bruce L. Golden, Harvey J. Greenberg
This paper both describes and exemplifies the logical style for preparing manuscripts for the INFORMS Journal on Computing. The intent is not for authors to spend time imitating the cosmetic style of...
Abstract. This paper establishes theorems about the simultaneous variation of right-hand sides and cost coefficients in a linear program from a strictly complementary solution. Some results are...
A multiple-objective analysis of sensor placement optimization in water networks (2004)
Jean-paul Watson, Harvey J. Greenberg, William E. Hart
Terrorism concerns have recently led to increased interest in the potential use of sensors to detect malicious attacks on municipal water systems. A key deployment issue is identifying where the...
Maximal-clique Partitions (2003)
Chariya Uiyyasathain, Kathryn L. Fraughnaugh, William E. Cherowitzo, Harvey J. Greenberg, Michael S. Jacobson, Kathryn L. Fraughnaugh
has been approved by
c j and z bz c = j=1 c j + bc k fc, so a performance guarantee is 1 + c k (b j=1 a j ) j=1 c j max 5x 1 + 3x 2 + 3x 3 + 2x 4 : x 2 f0; 1g 2x 1 + 3x 2 + 4x 3 + 3x 4 8 The variables are ordered...
This is a prospective on the research in the intersection of mathematics and articial intelligence that I see as having been the most important over the past 10 years and that I think should be...
This is a prospective on the research in the intersection of mathematics and artificial intelligence that I see as having been the most important over the past 10 years and that I think should be...
Analytic Centers and Repelling Inequalities (1999)
Richard J. Caron, Harvey J. Greenberg, Allen G. Holder
The new concepts of repelling inequalities, repelling paths, and prime analytic centers are introduced. A repelling path is a generalization of the analytic central path for linear programming, and...
Adam Speight, Harvey J. Greenberg, Gary A. Kochenberger, Stephen C. Billups, Stephen C. Billups, Stephen C. Billups
This thesis presents a new method for solving nonsmooth systems of equations, which is based on probability one homotopy techniques for solving smooth equations. The method is based on a new class of...
344> 2 and the improved point is x + h = 0 B B @ 1 1 2 2 1 C C A . For x = 0 B B @ 0 1 3 0 1 C C A and b = 4 7 , choose h = h 1 and the improved point is 1 x + h = 0 B B @ 0 2 1 1 1 C C A . For x...
This paper updates the previous survey [121], bringing the calculation and use of stability regions of optimal digraphs into focus. Their empirical study reflects the indication in [22] that the...
Relaxing Convergence Conditions To Improve The Convergence Rate (1999)
Daniel Macmillan, Richard H. Byrd, Gary A. Kochenberger, Weldon A. Lodwick, Thomas F. Russell, ...
Standard global convergence proofs are examined to determine why some algorithms perform better than other algorithms. We show that relaxing the conditions required to prove global convergence can...
Empirical research into new strategies and tactics for linear programming requires realistic, large-scale problem-solving tools. The Workbench for Research In (linear) Programming, called WRIP, is a...
Greedy Algorithms for Minimum Spanning Tree (1998)
The glossary de nes a spanning tree for a connected graph with non-negative weights on its edges, and one problem: nd a max weight spanning tree. Remarkably, the greedy algorithm results in a...
Matrix Sensitivity Analysis from an Interior Solution of a Linear Program (1997)
This paper considers the effect of changing matrix coefficients in a linear program after we have obtained an interior solution. Changes are restricted to where there remains an optimal solution to...
On the dimension of the set of rim perturbations for optimal partition invariance (1996)
Harvey J. Greenberg, Allen G. Holder, Kees Roos, Pii S
Abstract. Two new dimension results are presented. For linear programs, it is shown that the sum of the dimension of the optimal set and the dimension of the set of objective perturbations for which...
Consistency, redundancy, and implied equalities in linear systems (1996)
Systems of linear inequalities have been studied for more than a century, but many of the results were developed during t.he early years of linear programming (1950s). New developments in linear...
On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance (1996)
Harvey J. Greenberg, Allen G. Holder, Kees Roos, Tomas Terlaky
. Two new dimension results are presented. For linear programs, it is shown that the sum of the dimension of the optimal set and the dimension of the set of objective perturbations for which the...
Mathematical programming models for environmental quality control (1995)
This paper surveys the use of mathematical programming models for controll~ng environmental quality. The scope includes air, water, and land quality, stemming from the first works in the 1960s. It...
Abstract Short Communication Possibilities of logically equivalent expressions (1992)
sets and systems If A is logically equivalent to B, it is not necessary that #(A) = p(B). This technical note proves, however, that if A is in CNF, there exists some logically equivalent DNF, B, such...
This describes enhancements to provide more advanced computer-assisted analysis of instances of hnear programming models. Three categories of enhancements are described: views, engines for obtaining...
This study reports empirical findings for applying three methods of diagnosing infeasibility, based on: (1) Phase I price aggregation, (2) irreducible infeasible subsystems, and (3) successive...
Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility (1988)
One problem in modem large-scale model management is to provide computer assistance to help an analyst determine the cause of infeasibility when such is the case. This paper develops diagnostics for...
GREENBERG, HARVEY J., LUCAS, CORMAC, MITRA, GAUTAM
A framework for model formulation and analysis to support operations and management of large-scale linear programs is developed from the combined capabilities of CAMPS and ANALYZE. Both the systems...
Diagnosing Infeasibility in Min-cast Network Flow Problems Part I: Dual Infeasibility (1986)
One problem in modern large-scale model management is to provide computer assistance to help an analyst determine the cause of infeasibility when such is the case. This paper develops diagnostics for...
Greenberg, Harvey J., Maybee, John Stanley.
Proceedings of the symposium held at the University of Colorado on March 24, 1980, and sponsored by the United States Dept. of Energy.