Some theoretical implications of local optimization
From MaRDI portal
Publication:4120335
DOI10.1007/BF01580681zbMath0349.90120MaRDI QIDQ4120335
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C10: Integer programming
90C30: Nonlinear programming
41A60: Asymptotic approximations, asymptotic expansions (steepest descent, etc.)
Related Items
Polarity and the complexity of the shooting experiment, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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