Discrete optimization by optimal control methods. I: Separable problems

DOI10.1134/S0005117906040047zbMath1126.90391MaRDI QIDQ2457533

S. I. Sergeev

Publication date: 23 October 2007

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (max. 100)

Approximate algorithms for the traveling salesman problem. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reduced complexity dynamic programming based on policy iteration
• Algorithms for the minimax problem of the travelling salesman. II: Dual approach
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Methods of Nonlinear 0-1 Programming
• A Survey of Methods for Pure Nonlinear Integer Programming
• State-space relaxation procedures for the computation of bounds to routing problems

This page was built for publication: Discrete optimization by optimal control methods. I: Separable problems