My experiences as a student and researcher in OR during the 1960's and 70's
From MaRDI portal
(Redirected from Publication:537599)
Cites work
- scientific article; zbMATH DE number 3570501 (Why is no real title available?)
- scientific article; zbMATH DE number 3231691 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- Binary group and Chinese postman polyhedra
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Matching, Euler tours and the Chinese postman
- Maximum matching and a polyhedron with 0,1-vertices
- Paths, Trees, and Flowers
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
This page was built for publication: My experiences as a student and researcher in OR during the 1960's and 70's
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537599)