Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572): Difference between revisions

Latest revision as of 19:54, 27 June 2024

scientific article

Language	Label	Description	Also known as
English	Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem	scientific article

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

Journal of Combinatorial Optimization

0 references

publication date

4 April 2008

0 references

zbMATH Keywords

quadratic knapsack

0 references

quadratic selective travelling salesman

0 references

polyhedral analysis

0 references

facets

0 references

describes a project that uses

Knapsack

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10878-006-8462-5

0 references

cites work

The prize collecting traveling salesman problem

0 references

The prize collecting traveling salesman problem: II. Polyhedral results

0 references

The Circuit Polytope: Facets

0 references

A branch and cut approach to the cardinality constrained circuit problem.

0 references

Linear programming for the \(0-1\) quadratic knapsack problem

0 references

Exact Solution of the Quadratic Knapsack Problem

0 references

The discrete p-dispersion problem

0 references

The symmetric generalized traveling salesman polytope

0 references

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

0 references

Solving the Orienteering Problem through Branch-and-Cut

0 references

Q4540081

0 references

Models for a Steiner ring network design problem with revenues

0 references

Min-cut clustering

0 references

The selective travelling salesman problem

0 references

Q4040221

0 references

Identifiers

zbMATH Open document ID

1203.90135

0 references

DOI

10.1007/s10878-006-8462-5

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2479572

@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-006-8462-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1977377453
@@ Property / OpenAlex ID: W1977377453 / rank @@
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem
@@ Property / cites work: The prize collecting traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem: II. Polyhedral results
+Normal rank
@@ Property / cites work @@
+The Circuit Polytope: Facets
@@ Property / cites work: The Circuit Polytope: Facets / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and cut approach to the cardinality constrained circuit problem.
+Normal rank
@@ Property / cites work @@
+Linear programming for the \(0-1\) quadratic knapsack problem
+Normal rank
@@ Property / cites work @@
+Exact Solution of the Quadratic Knapsack Problem
@@ Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The discrete p-dispersion problem
@@ Property / cites work: The discrete p-dispersion problem / rank @@
+Normal rank
@@ Property / cites work @@
+The symmetric generalized traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Solving the Orienteering Problem through Branch-and-Cut
+Normal rank
@@ Property / cites work @@
+Q4540081
@@ Property / cites work: Q4540081 / rank @@
+Normal rank
@@ Property / cites work @@
+Models for a Steiner ring network design problem with revenues
+Normal rank
@@ Property / cites work @@
+Min-cut clustering
@@ Property / cites work: Min-cut clustering / rank @@
+Normal rank
@@ Property / cites work @@
+The selective travelling salesman problem
@@ Property / cites work: The selective travelling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2479572