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

DOI10.1007/s10878-006-8462-5zbMath1203.90135OpenAlexW1977377453MaRDI QIDQ2479572

Vicky Mak, Tommy Thomadsen

Publication date: 4 April 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-8462-5

zbMATH Keywords

facetsquadratic knapsackpolyhedral analysisquadratic selective travelling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs ⋮ A two-stage vehicle routing model for large-scale bioterrorism emergencies

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• The selective travelling salesman problem
• The discrete p-dispersion problem
• Linear programming for the \(0-1\) quadratic knapsack problem
• Min-cut clustering
• The prize collecting traveling salesman problem
• The Circuit Polytope: Facets
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Solving the Orienteering Problem through Branch-and-Cut
• Exact Solution of the Quadratic Knapsack Problem
• The prize collecting traveling salesman problem: II. Polyhedral results
• The symmetric generalized traveling salesman polytope
• Models for a Steiner ring network design problem with revenues
• A branch and cut approach to the cardinality constrained circuit problem.

This page was built for publication: Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem