Convex integer maximization via Graver bases (Q1017675): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2724100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some complexity results for polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(N\)-fold integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Three-Way Statistical Tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Linear and Integer Programs Are Slim 3‐Way Transportation Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov bases of three-way tables are arbitrarily complicated / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Graver complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finiteness theorem for Markov bases of hierarchical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher Lawrence configurations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vector Partition Problem for Convex Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the foundations of linear and integer linear programming I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the positive sums property and the computation of Graver test sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variation of cost functions in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Shaped Partition Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature classes of transportation polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On properties of multi-dimensional statistical tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for multi-index transportation problems with decomposable costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for the existence of solutions of the three-dimensional planar transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal partitions having disjoint convex and conic hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clustering problems with connected optima in Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive algorithm for vector partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3544989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321546 / rank
 
Normal rank

Latest revision as of 14:12, 1 July 2024

scientific article
Language Label Description Also known as
English
Convex integer maximization via Graver bases
scientific article

    Statements

    Convex integer maximization via Graver bases (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2009
    0 references
    0 references
    algebraic algorithmic scheme
    0 references
    polynomial time algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references