Non-standard approaches to integer programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1676629 (Why is no real title available?)
- scientific article; zbMATH DE number 993566 (Why is no real title available?)
- scientific article; zbMATH DE number 3860890 (Why is no real title available?)
- scientific article; zbMATH DE number 3870586 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 3980484 (Why is no real title available?)
- scientific article; zbMATH DE number 4006346 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1187155 (Why is no real title available?)
- scientific article; zbMATH DE number 1187159 (Why is no real title available?)
- scientific article; zbMATH DE number 3664742 (Why is no real title available?)
- scientific article; zbMATH DE number 3718824 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 108290 (Why is no real title available?)
- scientific article; zbMATH DE number 177867 (Why is no real title available?)
- scientific article; zbMATH DE number 192947 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 1305542 (Why is no real title available?)
- scientific article; zbMATH DE number 1335879 (Why is no real title available?)
- scientific article; zbMATH DE number 1342116 (Why is no real title available?)
- scientific article; zbMATH DE number 3001142 (Why is no real title available?)
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 863497 (Why is no real title available?)
- scientific article; zbMATH DE number 960150 (Why is no real title available?)
- 0/1-Integer programming: Optimization and Augmentation are equivalent
- A Convergent Duality Theory for Integer Programming
- A Geometric Buchberger Algorithm for Integer Programming
- A Polynomial Algorithm for the Two-Variable Integer Programming Problem
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- A Simplified Primal (All-Integer) Integer Programming Algorithm
- A Variant of the Buchberger Algorithm for Integer Programming
- A counterexample to an integer analogue of Carathéodory's theorem
- A hierarchy of polynomial time lattice basis reduction algorithms
- A primal (all-integer) integer programming algorithm
- An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
- An integer analogue of Carathéodory's theorem
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Block Reduced Lattice Bases and Successive Minima
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Computational experience with a group theoretic integer programming algorithm
- Covering minima and lattice-point-free convex bodies
- Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme
- Decomposition of integer programs and of generating sets
- FACES OF AN INTEGER POLYHEDRON
- Factoring polynomials with rational coefficients
- Generalized dynamic programming methods in integer programming
- Geometric algorithms and combinatorial optimization
- Gröbner bases of lattices, corner polyhedra, and integer programming
- Hilbert bases, unimodular triangulations, and binary covers of rational polyhedral cones
- Improved low-density subset sum algorithms
- Integer Programming with a Fixed Number of Variables
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice reduction: a toolbox for the cryptoanalyst
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Minkowski's Convex Body Theorem and Integer Programming
- Neighborhood Systems for Production Sets with Indivisibilities
- Network flows. Theory, algorithms, and applications.
- Normality and covering properties of affine semigroups
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- On crepant resolutions of 2-parameter series of Gorenstein cyclic quotient singularities
- On minimal solutions of Diophantine equations
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning
- On the foundations of linear and integer linear programming I
- On the height of the minimal Hilbert basis
- On the symmetric travelling salesman problem: A computational study
- Production Sets with Indivisibilities, Part I: Generalities
- Sensitivity theorems in integer linear programming
- Simultaneous reduction of a lattice basis and its reciprocal basis
- Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
- Solving low-density subset sum problems
- Some continuous functions related to corner polyhedra
- Some polyhedra related to combinatorial problems
- Standard pairs and group relaxations in integer programming
- The Generalized Basis Reduction Algorithm
- The b-hull of an integer program
- The complexity of theorem-proving procedures
- The height of minimal Hilbert bases
- The integral basis method for integer programming
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Total dual integrality and integer polyhedra
- Truncated Gröbner bases for integer programming
- Variable metric relaxation methods, part II: The ellipsoid method
- Variation of cost functions in integer programming
Cited in
(23)- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- New Bounds for the Integer Carathéodory Rank
- Effective lattice point counting in rational convex polytopes
- Decomposition of integer programs and of generating sets
- New linearizations of quadratic assignment problems
- Relations between facets of low- and high-dimensional group problems
- Vectors in a box
- Could we use a million cores to solve an integer program?
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- A partial enumeration algorithm for pure nonlinear integer programming
- Multivariable Branching: A 0-1 Knapsack Problem Case Study
- Generating functions and duality for integer programs
- On the lattice programming gap of the group problems
- Cover and pack inequalities for (mixed) integer programming
- An improved partial enumeration algorithm for integer programming problems
- Valid inequalities based on simple mixed-integer sets
- A generalization of the integer linear infeasibility problem
- The power of pyramid decomposition in Normaliz
- Extended formulations for Gomory corner polyhedra
- Existence of unimodular triangulations -- positive results
- Representation of Sets of Lattice Points
This page was built for publication: Non-standard approaches to integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697562)
