Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach

By Zheng X.   Sun X.   Li D.  

Journal of Optimization Theory and Applications, Vol. 146, Iss. 2, 2010-08 ,pp. : 463-489

Springer Publishing Company

Access to resources Recommend Favorite

Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints

By Lebedeva T.   Sergienko T.  

Cybernetics and Systems Analysis, Vol. 42, Iss. 5, 2006-09 ,pp. : 667-674

Springer Publishing Company

Access to resources Recommend Favorite

Exact Algorithm for the Surrogate Dual of an Integer Programming Problem: Subgradient Method Approach

By   Kim S.  

Journal of Optimization Theory and Applications, Vol. 96, Iss. 2, 1998-02 ,pp. : 363-375

Springer Publishing Company

Access to resources Recommend Favorite

Nearness and Bound Relationships Between an Integer-Programming Problem and Its Relaxed Linear-Programming Problem

By Joseph A.   Gass S.I.   Bryson N.A.  

Journal of Optimization Theory and Applications, Vol. 98, Iss. 1, 1998-07 ,pp. : 55-63

Springer Publishing Company

Access to resources Recommend Favorite

Dynamic programming approaches to solve the shortest path problem with forbidden paths

By Di Puglia Pugliese Luigi   Guerriero Francesca  

Optimization Methods and Software, Vol. 28, Iss. 2, 2013-04 ,pp. : 221-255

Taylor & Francis Ltd

Access to resources Recommend Favorite