Some efficiently solvable problems over integer partition polytopes (Q476314): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.08.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978661177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large sparse numerical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal integer partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of Discrete Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral proof methods in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopes of partitions of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2875896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2732561 / rank
 
Normal rank

Latest revision as of 08:39, 9 July 2024

scientific article
Language Label Description Also known as
English
Some efficiently solvable problems over integer partition polytopes
scientific article

    Statements

    Some efficiently solvable problems over integer partition polytopes (English)
    0 references
    0 references
    0 references
    28 November 2014
    0 references
    integer partitions
    0 references
    integer partition polytope
    0 references
    vertex adjacency
    0 references
    separation problem
    0 references

    Identifiers