Some theoretical implications of local optimization

DOI10.1007/BF01580681zbMath0349.90120OpenAlexW2081153368MaRDI QIDQ4120335

Sam L. Savage

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580681

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Nonlinear programming (90C30) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60)

Related Items (4)

Simulated annealing and tabu search: Lessons from a line search ⋮ An effective structured approach to finding optimal partitions of networks ⋮ Polarity and the complexity of the shooting experiment ⋮ Solving the medium newspaper production/distribution problem

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Linear Inequalities and Related Systems. (AM-38)
• Computer Solutions of the Traveling Salesman Problem
• Discrete Optimizing
• Laplace's Equation and Network Flows
• The Traveling Salesman Problem: A Survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some theoretical implications of local optimization