Computing Optimized Path Integrals for Knapsack Feasibility

DOI10.1287/ijoc.2021.1142OpenAlexW4213313399WikidataQ114058186 ScholiaQ114058186MaRDI QIDQ5106414

Ulf Friedrich, Endric Daues

Publication date: 19 September 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2021.1142

zbMATH Keywords

generating functionsinteger programmingcomputational studyCauchy's integral formulapath optimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Computing the Ehrhart polynomial of a convex lattice polytope
• The Ehrhart polynomial of the Birkhoff polytope
• Explicit and efficient formulas for the lattice point count in rational polygons using Dedekind-Rademacher sums
• The partial-fractions method for counting solutions to integral linear systems
• Counting integer flows in networks
• Where are the hard knapsack problems?
• Counting lattice points by means of the residue theorem
• Solving the knapsack problem via \(\mathbb Z\)-transform
• Extended formulations for Gomory corner polyhedra
• The many aspects of counting lattice points in polytopes
• A computational study of integer programming algorithms based on Barvinok's rational functions
• A Laplace transform algorithm for the volume of a convex polytope
• Eine algorithmisch orientierte Einführung
• Lattice points in simple polytopes
• Residue formulae, vector partition functions and lattice points in rational polytopes
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Optimal contours for high-order derivatives
• Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration
• Simple Explicit Formula for Counting Lattice Points of Polyhedra
• A Primal Barvinok Algorithm Based on Irrational Decompositions
• Linear and Integer Programming vs Linear Integration and Counting
• On Counting Integral Points in a Convex Rational Polytope
• Integer Programming and Combinatorial Optimization