WorldCat Identities

Nemhauser, George L.

Works: 117 works in 350 publications in 5 languages and 4,696 library holdings
Genres: Handbooks and manuals  Conference papers and proceedings 
Roles: Author, Editor, Thesis advisor
Publication Timeline
Most widely held works by George L Nemhauser
Integer and combinatorial optimization by George L Nemhauser( Book )

40 editions published between 1988 and 2014 in English and held by 1,461 WorldCat member libraries worldwide

"A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."--Computing Reviews
Introduction to dynamic programming by George L Nemhauser( Book )

36 editions published between 1966 and 1990 in English and German and held by 800 WorldCat member libraries worldwide

Basic theory; Basic computations; Computational refinements; Risk, uncertainty, and competition; Nonserial systems; Infinite-stage systems
Optimization by George L Nemhauser( Book )

31 editions published between 1989 and 2006 in 4 languages and held by 642 WorldCat member libraries worldwide

A view of unconstrained optimization (J.E. Dennis Jr. and R.B. Schanbel). Linear programming (D. Goldfarb and M.J. Todd). Constrained nonlinear programming ((P.E. Gill, W. Myrray, M.A. Saunders and M.H. Wright). Network flows (R.K. Ahuja, T.L. Magnanti and J.B. Orlin). Polyhedral combinatorics (W.R.Pulleyblank). Integer programming (G.L.Nemhauser and L.A. Wolsey). Nondifferentiable optimization (C. Lemaréchal). Stochastic programming (R.J-B. Wets). Global optimization (A.H.G. Rinnoy Kan and G.T. Timmer). Multiple criteria decision making: five basic concepts (P.L.Yu)
Integer programming by Robert S Garfinkel( Book )

20 editions published between 1970 and 2010 in English and Undetermined and held by 630 WorldCat member libraries worldwide

Linear programming; Integer programming graphs; Enumeration methods; Cutting plane methods; The knapsack problem; Integer programming over cones; The set covering and partitioning problems; Approximate methods; Integer nonlinear programming; Computational experience
Discrete optimization( )

15 editions published in 2005 in English and Italian and held by 554 WorldCat member libraries worldwide

The chapters of this Handbook volume covers nine main topics that are representative of recent theoretical and algorithmic developments in the field. In addition to the nine papers that present the state of the art, there is an article on the early history of the field. The handbook will be a useful reference to experts in the field as well as students and others who want to learn about discrete optimization. All of the chapters in this handbook are written by authors who have made significant original contributions to their topics. Herewith a brief introduction to the chapters of the handbook. "On the history of combinatorial optimization (until 1960)" goes back to work of Monge in the 18th century on the assignment problem and presents six problem areas: assignment, transportation, maximum flow, shortest tree, shortest path and traveling salesman. The branch-and-cut algorithm of integer programming is the computational workhorse of discrete optimization. It provides the tools that have been implemented in commercial software such as CPLEX and Xpress MP that make it possible to solve practical problems in supply chain, manufacturing, telecommunications and many other areas. "Computational integer programming and cutting planes" presents the key ingredients of these algorithms. Although branch-and-cut based on linear programming relaxation is the most widely used integer programming algorithm, other approaches are needed to solve instances for which branch-and-cut performs poorly and to understand better the structure of integral polyhedra. The next three chapters discuss alternative approaches. "The structure of group relaxations" studies a family of polyhedra obtained by dropping certain nonnegativity restrictions on integer programming problems. Although integer programming is NP-hard in general, it is polynomially solvable in fixed dimension. "Integer programming, lattices, and results in fixed dimension" presents results in this area including algorithms that use reduced bases of integer lattices that are capable of solving certain classes of integer programs that defy solution by branch-and-cut. Relaxation or dual methods, such as cutting plane algorithms, progressively remove infeasibility while maintaining optimality to the relaxed problem. Such algorithms have the disadvantage of possibly obtaining feasibility only when the algorithm terminates. Primal methods for integer programs, which move from a feasible solution to a better feasible solution, were studied in the 1960's but did not appear to be competitive with dual methods. However, recent development in primal methods presented in "Primal integer programming" indicate that this approach is not just interesting theoretically but may have practical implications as well. The study of matrices that yield integral polyhedra has a long tradition in integer programming. A major breakthrough occurred in the 1990's with the development of polyhedral and structural results and recognition algorithms for balanced matrices. "Balanced matrices" is a tutorial on the subject. Submodular function minimization generalizes some linear combinatorial optimization problems such as minimum cut and is one of the fundamental problems of the field that is solvable in polynomial time. "Submodular function minimization" presents the theory and algorithms of this subject. In the search for tighter relaxations of combinatorial optimization problems, semidefinite programming provides a generalization of linear programming that can give better approximations and is still polynomially solvable. This subject is discussed in "Semidefinite programming and integer programming". Many real world problems have uncertain data that is known only probabilistically. Stochastic programming treats this topic, but until recently it was limited, for computational reasons, to stochastic linear programs. Stochastic integer programming is now a high profile research area and recent developments are presented in "Algorithms for stochastic mixed-integer programming models". Resource constrained scheduling is an example of a class of combinatorial optimization problems that is not naturally formulated with linear constraints so that linear programming based methods do not work well. "Constraint programming" presents an alternative enumerative approach that is complementary to branch-and-cut. Constraint programming, primarily designed for feasibility problems, does not use a relaxation to obtain bounds. Instead nodes of the search tree are pruned by constraint propagation, which tightens bounds on variables until their values are fixed or their domains are shown to be empty
Integer programming and combinatorial optimization : 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004 : proceedings by George L Nemhauser( )

13 editions published between 2002 and 2005 in English and held by 377 WorldCat member libraries worldwide

This volume contains the papers accepted for publication at IPCO X, the Tenth InternationalConferenceonInteger ProgrammingandCombinatorialOptimi- tion, held in New York City, New York, USA, June 7–11, 2004.The IPCO series of conferences presents recent results in theory, computation and applications of integer programming and combinatorial optimization. These conferences are sponsoredby the Mathematical ProgrammingSociety, andareheldin thoseyearsin whichno InternationalSymposiumonMathema- calProgrammingtakes place.IPCO VIII was held in Utrecht (The Netherlands) and IPCO IX was held in Cambridge (USA). A total of 109 abstracts, mostly of very high quality, were submitted. The ProgramCommittee accepted 32, in order to meet the goal of having three days of talks with no parallel sessions. Thus, many excellent abstracts could not be accepted. The papers in this volume havenot been refereed. It is expected that revised versions of the accepted papers will be submitted to standard scienti?c journals for publication. The Program Committee thanks all authors of submitted manuscripts for their support of IPCO. March 2004 George Nemhauser Daniel Bienstock Organization IPCO X was hosted by the Computational Optimization Research Center (CORC), Columbia University
50 years of integer programming, 1958-2008 : the early years and state-of-the-art surveys by M Jünger( )

8 editions published between 2009 and 2010 in English and held by 29 WorldCat member libraries worldwide

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a short paper that described his cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In January of 2008, to commemorate the anniversary of Gomory's seminal paper, a special session celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. This book is based on the material presented during this session. 50 Years of Integer Programming offers an account of featured talks at the 2008 Aussois workshop, namely - Michele Conforti, Gérard Cornuéjols, and Giacomo Zambelli: Polyhedral Approaches to Mixed Integer Linear Programming - William Cook: 50+ Years of Combinatorial Integer Programming - Francois Vanderbeck and Laurence A. Wolsey: Reformulation and Decomposition of Integer Programs The book contains reprints of key historical articles together with new introductions and historical perspectives by the authors: Egon Balas, Michel Balinski, Jack Edmonds, Ralph E. Gomory, Arthur M. Geoffrion, Alan J. Hoffman & Joseph B. Kruskal, Richard M. Karp, Harold W. Kuhn, and Ailsa H. Land & Alison G. Doig. It also contains written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community: - Friedrich Eisenbrand: Integer Programming and Algorithmic Geometry of Numbers - Raymond Hemmecke, Matthias Köppe, Jon Lee, and Robert Weismantel: Nonlinear Integer Programming - Andrea Lodi: Mixed Integer Programming Computation - Francois Margot: Symmetry in Integer Linear Programming - Franz Rendl: Semidefinite Relaxations for Integer Programming - Jean-Philippe P. Richard and Santanu S. Dey: The Group-Theoretic Approach to Mixed Integer Programming Integer programming holds great promise for the future, and continues to build on its foundations. Indeed, Gomory's finite cutting-plane method for the pure integer case is currently being reexamined and is showing new promise as a practical computational method. This book is a uniquely useful celebration of the past, present and future of this important and active field. Ideal for students and researchers in mathematics, computer science and operations research, it exposes mathematical optimization, in particular integer programming and combinatorial optimization, to a broad audience
Handbooks in operations research and management science by K Aardal( )

6 editions published between 2005 and 2006 in English and held by 22 WorldCat member libraries worldwide

Covers nine topics that represent the theoretical and algorithmic developments in the field. This handbook presents six problem areas: assignment, transportation, maximum flow, shortest tree, shortest path and traveling salesman. It provides tools that help solve problems in supply chain, manufacturing, telecommunications and many other areas
Handbooks in operations research and management science( )

in English and held by 10 WorldCat member libraries worldwide

Preface Transportation sustains economic and social activity and is central to operations research and management science. When operations research emerged as a structured field during World War II, some of the first problems investigated arose from the need to optimize military logistics and transportation activities. After the war ended, the scope of operations research applications broadened but transportation problems always occupied a central place. It is now widely recognized that some of the most successful applications of operations research are encountered in transportation, most significantly in the airline industry where it underlies almost every aspect of strategic, tactical and operational planning. This success story may be explained by a number of factors, the first being the economic importance of transportation. Also, the complexity and large scale of transportation problems call for powerful analytical techniques, and the high volumes involved imply that substantial savings can often be achieved through the use of optimization.; Furthermore, transportation problems are highly structured, making them amenable to the use of efficient solution methods based on network optimization techniques and mathematical programming
Two Computationally Difficult Set Covering Problems that Arise in Computing the 1-Width of Incidence Matrices of Steiner Triple Systems by D. R Fulkerson( Book )

8 editions published between 1973 and 1974 in English and held by 8 WorldCat member libraries worldwide

Two minimum cardinality set covering problems of similar structure are presented as difficult test problems for evaluating the computational efficiency of integer programming and set covering algorithms. The smaller problem has 117 constraints and 27 variables and the larger one, constructed by H.J. Ryser, has 330 constraints and 45 variables. The constraint matrices of the two set covering problems are incidence matrices of Steiner triple systems. An optimal solution to the problem that the authors were able to solve (the smaller one) gives some new information on the 1-widths of members of this class of (0,1)-matrices. (Author)
When the greedy solution solves a class of knapsack problems by M. J Magazine( Book )

8 editions published between 1973 and 1974 in English and held by 7 WorldCat member libraries worldwide

A heuristic for the knapsack problem that recursively determines a solution by making a variable with smallest marginal cost as large as possible is studied. Recursive necessary and sufficient conditions for the optimality of such greedy solutions and a good algorithm for verifying these conditions are given. Maximum absolute error for non-optimal greedy solutions is also examined. (Author)
Vertex packings: structural properties and algorithms by George L Nemhauser( Book )

8 editions published in 1974 in English and held by 7 WorldCat member libraries worldwide

A sufficient local optimality condition is given for the weighted vertex packing problem. It is shown that integer-valued variables in an optimal solution to the linearization of this problem retain those same values in an optimal integer solution to the problem. An algorithm is presented and computational experience is given. (Modified author abstract)
A transport improvement problem transformable to a best-path problem by A. J Goldman( Book )

3 editions published in 1967 in English and held by 5 WorldCat member libraries worldwide

Solving multi-item capacitated lot-sizing problems with setup times by branch-and-cut by Andrew J Miller( Book )

4 editions published in 2000 in English and held by 5 WorldCat member libraries worldwide

A dynamic programming approach for optimal design and operation of multistage systems in the process industries by George L Nemhauser( )

4 editions published between 1961 and 1981 in English and held by 5 WorldCat member libraries worldwide

On the polyhedral structure of a multi-item production planning model with setup times by Andrew J Miller( Book )

4 editions published in 2000 in English and held by 5 WorldCat member libraries worldwide

A multi-item production planning model with setup times : algorithms, reformulations, and polyhedral characterizations for a special case by Andrew J Miller( Book )

3 editions published in 2001 in English and held by 4 WorldCat member libraries worldwide

A polynomial algorithm for the max cut problem on graphs without long odd cycles by Martin Grötschel( Book )

3 editions published in 1982 in English and German and held by 4 WorldCat member libraries worldwide

Maximizing submodular set functions : formulations, algorithms and applications by George L Nemhauser( Book )

3 editions published in 1978 in English and held by 4 WorldCat member libraries worldwide

A canonical representation of simple plant location problems and its applications by Gerard Cornuejols( Book )

3 editions published between 1979 and 1980 in English and held by 3 WorldCat member libraries worldwide

moreShow More Titles
fewerShow Fewer Titles
Audience Level
Audience Level
  Kids General Special  
Audience level: 0.54 (from 0.43 for Integer an ... to 0.95 for A polynomi ...)

Integer and combinatorial optimization
OptimizationInteger programmingDiscrete optimizationInteger programming and combinatorial optimization : 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004 : proceedings50 years of integer programming, 1958-2008 : the early years and state-of-the-art surveysHandbooks in operations research and management science
Alternative Names
George Nemhauser American mathematician and engineer

George Nemhauser Amerikaans wiskundige

George Nemhauser amerikansk matematikar

George Nemhauser amerikansk matematiker

George Nemhauser matematico statunitense

George Nemhauser US-amerikanischer Mathematiker

Lann Nemhauser, George 1937-

Nemhauser, G.L.

Nemhauser, G. L. 1937-

Nemhauser, George.

Nemhauser, George 1937-

Nemhauser, George L.

Nemhauser, George Lann

Nemhauser, George Lann 1937-