LLMpediaThe first transparent, open encyclopedia generated by LLMs

Computers & Operations Research

Generated by GPT-5-mini
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Parent: TSPLIB Hop 5
Expansion Funnel Raw 150 → Dedup 0 → NER 0 → Enqueued 0
1. Extracted150
2. After dedup0 (None)
3. After NER0 ()
4. Enqueued0 ()
Computers & Operations Research
TitleComputers & Operations Research
DisciplineOperations Research, Computer Science
PublisherElsevier
FrequencyMonthly
Established1974

Computers & Operations Research is a peer-reviewed academic journal at the intersection of Operations Research and Computer Science, focusing on the development and application of computational methods to decision-making problems. The journal publishes research linking algorithmic advances to practical problems studied by institutions such as IBM, Microsoft, Google, Amazon (company), and Siemens. Contributions often involve collaborations among researchers from MIT, Stanford University, University of California, Berkeley, Carnegie Mellon University, and University of Cambridge.

Overview

The journal emphasizes rigorous studies that connect classical work by figures like George Dantzig, John von Neumann, Richard Karp, Michael Held and Myles Hollander to contemporary computational implementations by teams at Bell Labs, AT&T, Hewlett-Packard, Intel, and Facebook (Meta Platforms). It covers theoretical foundations from scholars affiliated with Princeton University, Yale University, Columbia University, University of Oxford, Imperial College London and applied research tied to organizations including NASA, European Space Agency, United States Postal Service, and General Electric. Editorial boards frequently include members from INFORMS, SIAM, IEEE, ACM, and Royal Statistical Society.

History and Development

The journal emerged in the 1970s alongside advances in computing hardware such as systems from Cray Research, architectures described in work at Bell Labs and programming paradigms developed at Xerox PARC. Early contributors included researchers from RAND Corporation, Brookhaven National Laboratory, Los Alamos National Laboratory, Argonne National Laboratory, and universities like University of Michigan and Cornell University. Developments in integer programming influenced by Jack Edmonds and R. M. Karp and network flow theory advanced through work at IBM Research and AT&T Bell Laboratories. The rise of parallel computing at Lawrence Livermore National Laboratory and the advent of metaheuristics popularized by researchers at University of Western Australia and University of Granada shaped subsequent directions. Major conferences such as INFORMS Annual Meeting, IJCAI, NeurIPS, ICML, SODA (ACM-SIAM Symposium on Discrete Algorithms) and CP (Principles and Practice of Constraint Programming) have overlapped in authorship and topics.

Methodologies and Algorithms

The journal publishes contributions on algorithmic strategies rooted in seminal results like the Simplex method (linked to George Dantzig), cutting-plane methods developed by R. M. Karp and Gomory, branch-and-bound techniques refined by teams at IBM and ORACLE Corporation, and dynamic programming traditions traceable to Richard Bellman. Modern methods incorporate machine learning models from Andrew Ng, Yoshua Bengio, Geoffrey Hinton, and Yann LeCun to inform heuristic search employed by groups at DeepMind, OpenAI, and Google DeepMind. Stochastic programming frameworks influenced by John Birge and Pierre L. Lions appear alongside robust optimization approaches advocated by Dimitris Bertsimas and Martin Grötschel. Constraint programming contributions build on work from Pascal Van Hentenryck and Francois Fages, while metaheuristics like genetic algorithms popularized by John Holland, tabu search by Fred Glover, and simulated annealing linked to S. Kirkpatrick are recurrent. Graph algorithms referencing Edsger Dijkstra, Robert Tarjan, Andrew V. Goldberg, and Jon Kleinberg appear with computational complexity perspectives from Stephen Cook, Leonid Levin, and Richard Lipton.

Applications and Case Studies

Published case studies apply computational operations research to problems tackled by FedEx, UPS, Delta Air Lines, United Airlines, Maersk, Royal Dutch Shell, BP (British Petroleum), Pfizer, and Johnson & Johnson. Domains include logistics and routing influenced by the Travelling Salesman Problem instances studied in collaborations with LANL, energy system optimization in projects with E.ON, EDF (Électricité de France), and grid studies with PJM Interconnection. Financial engineering applications cite work at Goldman Sachs, J.P. Morgan, Morgan Stanley and central banks such as the Bank of England and Federal Reserve System. Healthcare scheduling studies reference casework at Mayo Clinic, Johns Hopkins Hospital, Cleveland Clinic and public health initiatives tied to World Health Organization. Urban planning and public transit optimizations include partnerships with Transport for London, Port Authority of New York and New Jersey, and Metropolitan Transportation Authority (New York).

Software and Tools

Authors report implementations using platforms such as CPLEX (IBM ILOG CPLEX), Gurobi, SCIP, GLPK, COIN-OR, and solvers integrated with modeling languages like AMPL, GAMS, Pyomo and JuMP. Computational experiments often deploy codebases hosted on infrastructures using GitHub, cloud services from Amazon Web Services, Microsoft Azure, Google Cloud Platform, and high-performance computing centers at Oak Ridge National Laboratory and NCSA (National Center for Supercomputing Applications). Visualization and data-processing stacks in studies reference tools originating from MATLAB (MathWorks), R (programming language), Python (programming language), and libraries maintained by communities around SciPy, NumPy, Pandas (software), and TensorFlow.

Research Challenges and Future Directions

Current challenges discussed involve scalability on exascale systems developed at Oak Ridge National Laboratory and algorithmic fairness concerns echoing debates involving European Commission and United Nations initiatives. Cross-disciplinary frontiers connect with quantum computing prototypes by IBM Quantum, Google Quantum AI, D-Wave Systems, and algorithmic game theory research linked to Tim Roughgarden and Éva Tardos. Emerging topics include integration with work on autonomous systems from Tesla, Inc. and Waymo, supply-chain resilience studied alongside McKinsey & Company and Boston Consulting Group, and cybersecurity optimization linked to National Institute of Standards and Technology and European Union Agency for Cybersecurity. The field will continue to evolve through interactions with major funding agencies such as the National Science Foundation, European Research Council, UK Research and Innovation, and private philanthropy from organizations like the Bill & Melinda Gates Foundation.

Category:Operations research journals