Some theoretical implications of local optimization

DOI10.1007/BF01580681MaRDI QIDQ4120335zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• Computer Solutions of the Traveling Salesman Problem
• Discrete Optimizing
• scientific article; zbMATH DE number 3543850 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3247783 (Why is no real title available?)
• scientific article; zbMATH DE number 3418499 (Why is no real title available?)
• Laplace's Equation and Network Flows
• Linear Inequalities and Related Systems. (AM-38)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The Traveling Salesman Problem: A Survey

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120335)