My experiences as a student and researcher in OR during the 1960's and 70's
From MaRDI portal
Publication:537599
DOI10.1007/s10479-006-0109-5zbMath1213.90022OpenAlexW2036549539MaRDI QIDQ537599
Publication date: 20 May 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0109-5
History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- Binary group and Chinese postman polyhedra
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- Matching, Euler tours and the Chinese postman
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Paths, Trees, and Flowers
- Maximum matching and a polyhedron with 0,1-vertices
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm