Complexity of optimizing over the integers (Q6160281)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7700907

Language	Label	Description	Also known as
English	Complexity of optimizing over the integers	scientific article; zbMATH DE number 7700907

Statements

scholarly article

0 references

Complexity of optimizing over the integers (English)

0 references

zbMATH Open document ID

0 references

0 references

10.1007/s10107-022-01862-z

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

23 June 2023

0 references

full work available at URL

https://arxiv.org/abs/2110.06172

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling

0 references

On Vaidya's Volumetric Cutting Plane Method for Convex Programming

0 references

A note on non-degenerate integer programs with small sub-determinants

0 references

A strongly polynomial algorithm for bimodular integer linear programming

0 references

Transversal numbers over subsets of linear spaces

0 references

Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity

0 references

The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces

0 references

Split Cuts in the Plane

0 references

Enumerating Integer Points in Polytopes with Bounded Subdeterminants

0 references

Centerpoints: A Link between Optimization and Convex Geometry

0 references

Algorithms in real algebraic geometry

0 references

0 references

0 references

A Theorem Concerning the Integer Lattice

0 references

Complexity, exactness, and rationality in polynomial optimization

0 references

0 references

A brief history of linear and mixed-integer programming computation

0 references

0 references

On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

0 references

On the Chvátal rank of polytopes in the 0/1 cube

0 references

Lower bounds for cutting planes proofs with small coefficients

0 references

0 references

Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory

0 references

0 references

Cutting planes, connectivity, and threshold logic

0 references

Hard Knapsack Problems

0 references

On cutting-plane proofs in combinatorial optimization

0 references

On the complexity of cutting-plane proofs

0 references

On the Matrix-Cut Rank of Polyhedra

0 references

0 references

Chvátal closures for mixed integer programming problems

0 references

On Integer Programming and the Branch-Width of the Constraint Matrix

0 references

A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming

0 references

0 references

0 references

Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs

0 references

On the complexity of cutting-plane proofs using split cuts

0 references

Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming

0 references

On \(t\)-branch split cuts for mixed-integer programs

0 references

On approximation algorithms for concave mixed-integer quadratic programming

0 references

Subdeterminants and Concave Integer Quadratic Programming

0 references

Mixed-integer quadratic programming is in NP

0 references

Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane

0 references

A Polyhedral Study of Binary Polynomial Programs

0 references

The Multilinear Polytope for Acyclic Hypergraphs

0 references

The Running Intersection Relaxation of the Multilinear Polytope

0 references

On the impact of running intersection inequalities for globally solving polynomial optimization problems

0 references

Integer quadratic programming in the plane

0 references

Branch-and-bound solves random binary IPs in poly\((n)\)-time

0 references

Lower bounds on the size of general branch-and-bound trees

0 references

Convexity in cristallographical lattices

0 references

Integer Programming and Algorithmic Geometry of Numbers

0 references

Bounds on the Chvatal rank of polytopes in the 0/1-cube

0 references

On the power and limitations of branch and cut

0 references

An application of simultaneous diophantine approximation in combinatorial optimization

0 references

0 references

0 references

0 references

0 references

The width and integer optimization on simplices with bounded minors of the constraint matrices

0 references

On integer programming with bounded determinants

0 references

0 references

Geometric algorithms and combinatorial optimization

0 references

Partitions of mass-distributions and of convex bodies by hyperplanes

0 references

Complexity of integer quasiconvex polynomial optimization

0 references

A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)

0 references

An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra

0 references

0 references

Trivial integer programs unsolvable by branch-and-bound

0 references

An improved cutting plane method for convex optimization, convex-concave games, and its applications

0 references

Minkowski's Convex Body Theorem and Integer Programming

0 references

0 references

Integer optimization on convex semialgebraic sets

0 references

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints

0 references

0 references

On the Complexity of Nonlinear Mixed-Integer Optimization

0 references

Discretely ordered modules as a first-order extension of the cutting planes proof system

0 references

Integer Programming with a Fixed Number of Variables

0 references

Cook, Kannan and Schrijver's example revisited

0 references

Mixed Integer Programming Computation

0 references

0 references

0 references

A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

0 references

A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations

0 references

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Lectures on convex optimization

0 references

Integer convex minimization by mixed integer linear optimization

0 references

Nonlinear discrete optimization. An algorithmic theory

0 references

On the complexity of integer programming

0 references

Computability and Noncomputability in Classical Analysis

0 references

Lower bounds for resolution and cutting plane proofs and monotone computations

0 references

0 references

On the Width of Semialgebraic Proofs and Algorithms

0 references

0/1 Polytopes with Quadratic Chvátal Rank

0 references

Distances between non-symmetric convex bodies and the \(MM^*\)-estimate

0 references

An observation on the structure of production sets with indivisibilities

0 references

0 references

0 references

A new algorithm for minimizing convex functions over convex sets

0 references

Integer program with bimodular matrix

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6160281

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6160281&oldid=37528365"