On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-021-01744-x / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3164622184 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2010.05768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Support of Integer Optimal Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for bimodular integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on non-degenerate integer programs with small sub-determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Ehrhart quasi-polynomial of a rational simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer points in polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short rational generating functions for lattice point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the stable set problem in terms of the odd cycle packing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sub-determinants and the diameter of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Points entiers dans les polyèdres convexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of quasiconvex integer minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity theorems in integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective lattice point counting in rational convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulations. Structures for algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynômes arithmétiques et méthode des polyedres en combinatoire / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Integer Programming in Fixed Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric random edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point / rank
 
Normal rank
Property / cites work
 
Property / cites work: The width and integer optimization on simplices with bounded minors of the constraint matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of three graph problems for instances with bounded minors of constraint matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of dominating set problems for instances with bounded minors of constraint matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer conic function minimization based on the comparison oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of even conic functions on the two-dimensional integral lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer programming with bounded determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT-algorithms for some problems related to integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT-algorithm for computing the width of a simplex given by a convex hull / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2789641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Integer Programming and Convolution. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4031179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing parametric rational generating functions with a primal Barvinok algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Alternative Algorithm for Counting Lattice Points in a Convex Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving proximity bounds using sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary graph classes for some maximum induced subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of graphs critical for the edge list-ranking problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity dichotomy and a new boundary class for the dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical elements in combinatorially closed families of graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical hereditary graph classes: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4274023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum numbers of faces of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice invariant valuations on rational polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3317685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integrality number of an integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances between optimal solutions of mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming revisited: Improving knapsack algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting with rational generating functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting integer points in parametric polytopes using Barvinok's rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3037543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer program with bimodular matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for minimizing discrete convic functions in fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of<i>N</i>-Space by Hyperplanes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-021-01744-X / rank
 
Normal rank

Latest revision as of 07:42, 17 December 2024

scientific article
Language Label Description Also known as
English
On lattice point counting in \(\varDelta\)-modular polyhedra
scientific article

    Statements

    On lattice point counting in \(\varDelta\)-modular polyhedra (English)
    0 references
    0 references
    9 August 2022
    0 references
    integer linear programming
    0 references
    short rational generating function
    0 references
    bounded minors
    0 references
    Ehrhart quasi-polynomial
    0 references
    step polynomial
    0 references
    parametric polytope
    0 references
    unbounded knapsack problem
    0 references
    multidimensional knapsack problem
    0 references
    subset sum problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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