Gerald J. Lieberman’s scientific contributions

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (13)


Introduction to operations research
  • Book

January 2015

·

4,314 Reads

·

1,236 Citations

·

Gerald J Lieberman

Tenth edition. For over four decades, Introduction to Operations Research by Frederick Hillier has been the classic text on operations research. While building on the classic strengths of the text, the author continues to find new ways to make the text current and relevant to students. One way is by incorporating a wealth of state-of-the-art, user-friendly software and more coverage of business applications than ever before. The hallmark features of this edition include clear and comprehensive coverage of fundamentals, an extensive set of interesting problems and cases, and state-of-the-practice operations research software used in conjunction with examples from the text. 1. Introduction -- 2. Overview of the operations research modeling approach -- 3. Introduction to linear programming -- 4. Solving linear programming problems: the simplex method -- 5. The theory of the simplex method -- 6. Duality theory -- 7. Linear programming under uncertainty -- 8. Other algorithms for linear programming -- 9. The transportation and assignment problems -- 10. Network optimization models -- 11. Dynamic programming -- 12. Integer programming -- 13. Nonlinear programming -- 14. Metaheuristics -- 15. Game theory -- 16. Decision analysis -- 17. Queuing theory -- 18. Inventory theory -- 19. Markov decision processes -- 20. Simulation -- Appendix 1. Documentation for the OR courseware -- Appendix 2. Convexity -- Appendix 3. Classical optimization methods -- Appendix 4. Matrices and matrix operations -- Appendix 5. Table for a Normal Distribution -- Partial answers to selected problems.



Operations research. 2nd ed

June 1976

·

130 Reads

·

37 Citations




Introduction To Operations Research
  • Chapter
  • Full-text available

January 1969

·

109,875 Reads

·

3,700 Citations

Journal of the Royal Statistical Society Series A (General)

Download



Introducción a la investigación de operaciones / F.S. Hillier, G.J. Lieberman ; tr. por Marcia A. González Osuna.

1,937 Reads

·

23 Citations

Traducción de: Introduction to Operations Research Tr. de la 6a ed. en inglés Contiene: Introducción; Panorama sobre el enfoque de modelado en la investigación de operaciones; Introducción a la programación lineal; Solución de problemas de programación lineal: método Símplex; Teoría del método Símplex; Teoría de dualidad y análisis de sensibilidad; Otros algoritmos para programación lineal; Problemas de transporte y asignación; Análisis de redes, incluyendo PERT-CPM; Programación dinámica; Teoría de juegos; Programación entera; Programación no lineal; Cadenas de Markov; Teoría de colas; Aplicación de la teoría de colas; Teoría de inventarios; Pronósticos; Procesos markovianos de decisión; Análisis de decisión; Simulación.



Citations (12)


... A genetic algorithm (GA) is a metaheuristic computational method [1]. It is possible to employ genetic algorithms (GAs), which have been around for a while, to carry out artificial intelligence (AI) tasks like learning, categorization, and optimization [2]. ...

Reference:

Quantum fuzzy genetic algorithm with Turing to solve DE
Introduction to Operations Research
  • Citing Article
  • December 1975

Operational Research Quarterly (1970-1977)

... The Hungarian method is an algorithm designed to solve assignment problems by finding optimal solutions in allocating tasks to workers or other resources. This assignment problem is often related to cost optimization, where organizations aim to assign workers to specific tasks at the lowest possible cost, or with the highest efficiency (Hillier & Lieberman, 2015). ...

Introduction to operations research
  • Citing Book
  • January 2015

... The experiments evaluated the performance of the Benin-Owena river basin as a technique of solving the problem of climate change crises (Prototype). This experiment was based on some behavior and actions of the Gardener / Farmer as the decision maker in terms of his application of Markovian and Bayesian Models in selecting the most suitable project among alternatives that would give highest yield or production according to Handy (2008) [15] and Hiller & Lieberman (1995) [16] respectively. ...

Introduction to Operations Research (Second Edition)
  • Citing Article
  • June 1976

Journal of Risk & Insurance

... Due to the enormous memory requirement by the dynamic programming approaches to achieve an optimal solution for the problem formulated in Section III, we employ the standard branch-and-bound approach in [6] to solve our problem. As mentioned in [6], [10], the crucial property of branch-andbound techniques is an intelligent enumeration of the solution space for the optimization problems. ...

Solutions manual for ”Introduction to operations research, 3rd ed.”. Prepared by: Philip G. Abrahamson, Karen E. Isaacson, Brian E. Leverick
  • Citing Article
  • January 1968

Journal of the Royal Statistical Society Series A (General)

... In decision-making, in general, for each state of nature (j) and for each alternative (i) a payment (Pij) occurs, which are presented through a matrix. In the case of decision making under uncertainty, the states of nature are known, but not their probability of occurrence (Baumol 1980, El Proceso 2001, Hillier & Lieberman 1974, León 2001, Levin & Kirkpatrick 1985. ...

Operations research. 2nd ed
  • Citing Article
  • June 1976

... Crossover rates of 0.6 and 0.9 were applied, and swap and inversion mutation types were used [39,79,88] Although various termination criteria are used in the literature for optimization problems based on genetic algorithms, there is no universally accepted standard. Common criteria include a fixed number of iterations, a fixed CPU time, or a fixed number of consecutive iterations without improvement in the current solution [93,94]. In their study focusing on order grouping with genetic algorithms, Hsu et al. [39] analyzed workloads of 40 to 300 orders, identifying distances of 711 to 9905 m, and terminated their algorithm after 40 generations without solution improvement. ...

Introduction To Operations Research

Journal of the Royal Statistical Society Series A (General)

... Para el modelado de las rutas se consideran otros factores, como la capacidad de los vehículos, los tiempos de entrega, las restricciones de tráfico, entre otros. Los modelos de vrp proveen una amplia variedad de aplicaciones, desde la planificación de entregas de paquetería (por ejemplo, de empresas como FedEx, ups Estafeta, Correos de México, dhl) y alimentos (Danone, Bimbo, Alpura), hasta el diseño de rutas de recolección de basura y servicios de emergencia(Hillier y Lieberman, 2010;Rossit et al., 2020;Rossit y Nesmachnow, 2022). La relación entre la logística y los mrv es muy estrecha. ...

Introducción a la investigación de operaciones / Frederick S. Hillier, Gerald J. Liebermantraducción: Marcia González Osunarevisión técnica: Lucia del Pilar Mota Quevedo, Alfredo Díaz Mata
  • Citing Article

... Haghighi et al. [10] derived the steady-state probabilities for multi-channel M=M=c queue under consideration of balking and reneging concepts. Hillier and Lieberman [11] discussed various aspects of balking and reneging in his textbook. Abou-El-Alta and Hariri [12] analysed the M=M=C=N queue with balking and reneging. ...

Operations research / Frederick S. Hilier, Gerald J. Lieberman
  • Citing Article

... Cuando se libera un servidor se selecciona un miembro de la cola para proporcionarle el servicio, esta selección obedece a alguna regla conocida como disciplina de cola. Posteriormente se lleva a cabo el servicio requerido por el cliente mediante un mecanismo de servicio compuesto por el total de servidores, y finalmente el cliente sale del sistema al completar el servicio requerido (Hillier y Lieberman, 2010). ...

Introducción a la investigación de operaciones / Frederick S. Hillier, Gerald J. Liebermantraducción María Gonzáles Osunarevisión técnica José Humberto Cantú Delgado
  • Citing Article