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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-006-8462-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977377453 / rank
 
Normal rank

Revision as of 00:07, 20 March 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

    Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (English)
    0 references
    0 references
    0 references
    4 April 2008
    0 references
    quadratic knapsack
    0 references
    quadratic selective travelling salesman
    0 references
    polyhedral analysis
    0 references
    facets
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references