Embedding Relaxations in Global Constraints for Solving TSP and TSPTW

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.34, Iss.4, 2002-04, pp. : 291-311

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Global Optimization Method for Solving Mathematical Programs with Linear Complementarity Constraints

By Thoai N. Yamamoto Y. Yoshise A.

Journal of Optimization Theory and Applications, Vol. 124, Iss. 2, 2005-02 ,pp. : 467-490

Springer Publishing Company

Access to resources Recommend Favorite

Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

By Rendl Franz

Mathematical Programming, Vol. 121, Iss. 2, 2010-02 ,pp. : 307-335

Elsevier

Access to resources Recommend Favorite

Solving linear constraints over real and rational fields

By German V.

Cybernetics and Systems Analysis, Vol. 46, Iss. 4, 2010-07 ,pp. : 630-638

Springer Publishing Company

Access to resources Recommend Favorite

Solving a Hamilton–Jacobi–Bellman equation with constraints

By Edalati Alireza Hipp Christian

Stochastics: An International Journal of Probability and Stochastic Processes, Vol. 85, Iss. 4, 2013-08 ,pp. : 637-651

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving mathematical programs with complementarity constraints as nonlinear programs

By Fletcher Roger Leyffer Sven

Optimization Methods and Software, Vol. 19, Iss. 1, 2004-02 ,pp. : 15-40

Taylor & Francis Ltd

Access to resources Recommend Favorite