On improving relaxation methods by modified gradient techniques
- 1 January 1975
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Bounds for 3-matroid intersection problemsInformation Processing Letters, 1975
- Validation of subgradient optimizationMathematical Programming, 1974
- Large scale optimization and the relaxation methodPublished by Association for Computing Machinery (ACM) ,1972
- A decomposition algorithm for integer programming problems with many columnsPublished by Association for Computing Machinery (ACM) ,1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964
- A Method for Solving Traveling-Salesman ProblemsOperations Research, 1958
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954