Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

Author： Mak Vicky Thomadsen Tommy

Publisher： Springer Publishing Company

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.11, Iss.4, 2006-06, pp. : 421-434

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

The symmetric quadratic traveling salesman problem

By Fischer Anja Helmberg Christoph

Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. : 205-254

Elsevier

Access to resources Recommend Favorite

Algorithm for cardinality-constrained quadratic optimization

By Bertsimas Dimitris Shioda Romy

Computational Optimization and Applications, Vol. 43, Iss. 1, 2009-05 ,pp. : 1-22

Springer Publishing Company

Access to resources Recommend Favorite

A polyhedral study of the semi-continuous knapsack problem

By Farias Ismael Zhao Ming

Mathematical Programming, Vol. 142, Iss. 1-2, 2013-12 ,pp. : 169-203

Elsevier

Access to resources Recommend Favorite

The travelling salesman problem with neighbourhoods: MINLP solution

By Gentilini Iacopo Margot François Shimada Kenji

Optimization Methods and Software, Vol. 28, Iss. 2, 2013-04 ,pp. : 364-378

Taylor & Francis Ltd

Access to resources Recommend Favorite

A bilevel programming approach to the travelling salesman problem

By Marcotte P. Savard G. Semet F.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 240-248

Elsevier

Access to resources Recommend Favorite