Convex integer optimization by constantly many linear counterparts (Q2451653): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963590392 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1208.5639 / 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: Optimal partitions having disjoint convex and conic hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Matroid Optimization and Experimental Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric nonlinear discrete optimization over well-described sets and matroid intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex integer maximization via Graver bases / 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: \(N\)-fold integer programming / 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: Maximizing Classes of Two-Parameter Objectives Over Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial oracle-time algorithm for convex integer minimization / 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: A Polynomial Time Algorithm for Shaped Partition Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear discrete optimization. An algorithmic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher Lawrence configurations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Latest revision as of 13:31, 8 July 2024

scientific article
Language Label Description Also known as
English
Convex integer optimization by constantly many linear counterparts
scientific article

    Statements

    Convex integer optimization by constantly many linear counterparts (English)
    0 references
    0 references
    0 references
    4 June 2014
    0 references
    combinatorial optimization
    0 references
    matroid
    0 references
    projection
    0 references
    integer programming
    0 references
    transportation problem
    0 references
    statistical table
    0 references

    Identifiers