Discrete optimization by optimal control methods. I: Separable problems
From MaRDI portal
Publication:2457533
DOI10.1134/S0005117906040047zbMATH Open1126.90391MaRDI QIDQ2457533FDOQ2457533
Authors: S. Sergeev 
Publication date: 23 October 2007
Published in: Automation and Remote Control (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4167852
- On the problem of optimization of dynamic discrete-continuous processes
- Stability of separable discrete optimization problems
- Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem
- Solution of discrete optimal control problems via mathematical programming
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- State-space relaxation procedures for the computation of bounds to routing problems
- Title not available (Why is that?)
- Methods of Nonlinear 0-1 Programming
- Reduced complexity dynamic programming based on policy iteration
- Algorithms for the minimax problem of the travelling salesman. II: Dual approach
- A Survey of Methods for Pure Nonlinear Integer Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (17)
- A method for solving a discrete optimization problem with polynomially tabular functions
- Certain block problems of discrete optimization. I: A general approach to forming decomposition solution schemes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete optimization by optimal control methods. II: The static traveling salesman problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Problem-method classification in optimization and control
- Title not available (Why is that?)
- On the problem of optimization of dynamic discrete-continuous processes
- Title not available (Why is that?)
- Approximate algorithms for the traveling salesman problem. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lösungsverfahren für eine klasse diskreter optimierungsaufgaben spezieller struktur
- Ersatz function method for minimizing a finite-valued function on a compact set
- A filled function method for optimal discrete-valued control problems
This page was built for publication: Discrete optimization by optimal control methods. I: Separable problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457533)
