On the complexity of integer programming

Cited in

(only showing first 100 items - show all)

An appraisal of computational complexity for operations researchers
An expanding-core algorithm for the exact 0-1 knapsack problem
A genetic algorithm of determining cycle time for printed circuit board assembly lines
Length-bounded disjoint paths in planar graphs
A theoretical framework for cardinality-based feature models: the semantics and computational aspects
Circuit satisfiability and constraint satisfaction around Skolem arithmetic
New techniques for linear arithmetic: cubes and equalities
Binary decision rules for multistage adaptive mixed-integer optimization
Knapsack in graph groups
Constants and finite unary relations in qualitative constraint reasoning
The complexity landscape of decompositional parameters for ILP
A note on non-degenerate integer programs with small sub-determinants
N-solutions to linear systems over Z
Decidable integration graphs.
Minimal resolutions of lattice ideals and integer linear programming
Detectability of labeled weighted automata over monoids
An FPTAS for the -modular multidimensional knapsack problem
Numerical semigroups generated by quadratic sequences
Fast and efficient bit-level precision tuning
Combinatorial \(n\)-fold integer programming and applications
Finding cut-offs in leaderless rendez-vous protocols is easy
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
Partitioned EDF scheduling on a few types of unrelated multiprocessors
A complete and terminating approach to linear integer solving
Constructing NP-intermediate problems by blowing holes with parameters of various properties
Cutting to the chase.
Hyperplane separation technique for multidimensional mean-payoff games
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
On the complexity of achieving proportional representation
The master equality polyhedron with multiple rows
The complexity of finite model reasoning in description logics
Complexity of the two-variable fragment with counting quantifiers
Novel geometric approach for virtual coiling
Complexity of modal logics with Presburger constraints
Integer programming in parameterized complexity: five miniatures
Block-structured integer programming: can we parameterize without the largest coefficient?
On the optimality of pseudo-polynomial algorithms for integer programming
Abelian networks. I: Foundations and examples
Fast cube tests for LIA constraint solving
Reasoning with global assumptions in arithmetic modal logics
Solving nonlinear integer arithmetic with MCSAT
The width and integer optimization on simplices with bounded minors of the constraint matrices
The complexity of reversal-bounded model-checking
Non-E-overlapping, weakly shallow, and non-collapsing TRSs are confluent
The two-variable fragment with counting and equivalence
Linear Arithmetic with Stars
An Analysis of Slow Convergence in Interval Propagation
Preprocessing composite cutting procedure: an approach to the integer model
Coalgebraic Hybrid Logic
Testing additive integrality gaps
A Sharp Bound for Solutions of Linear Diophantine Equations
Machines Over the Reals and Non-Uniformity
Using linear constraints for logic program termination analysis
How to block blood flow by using elastic coil
Faster Algorithms for Integer Programs with Block Structure
On the Identity Problem for the Special Linear Group and the Heisenberg Group.
Integer programming in parameterized complexity: three miniatures
On the optimality of pseudo-polynomial algorithms for integer programming
On the complexity of inverse mixed integer linear optimization
Complexity and polynomially solvable special cases of QUBO
On integer programming and convolution
Tight complexity lower bounds for integer linear programming with few constraints
The distributions of functions related to parametric integer optimization
Verification of flat FIFO systems
On the path-width of integer linear programming
Automata for unordered trees
Target counting with Presburger constraints and its application in sensor networks
Mixed-integer quadratic programming is in NP
Decision Procedures for Multisets with Cardinality Constraints
The logic of comparative cardinality
The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions
scientific article; zbMATH DE number 7651172 (Why is no real title available?)
Stable divisorial gonality is in NP
On the integrality gap of binary integer programs with Gaussian data
On the integrality gap of binary integer programs with Gaussian data
On the complexity of recognizing the Hilbert basis of a linear Diophantine system
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
Fast and succinct population protocols for Presburger arithmetic
Complexity of optimizing over the integers
Presburger Büchi tree automata with applications to logics with expressive counting
A logic for preference lifting under uncertainty and its decidability
On -modular integer linear problems in the canonical form and equivalent problems
Polyhedral geometry and combinatorics of an autocatalytic ecosystem
An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
Early verification of legal compliance via bounded satisfiability checking
Succinct ordering and aggregation constraints in algebraic array theories
Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates
Two variable logic with ultimately periodic counting
On two-variable guarded fragment logic with expressive local Presburger constraints
Reasoning about reversal-bounded counter machines
Two variable logic with ultimately periodic counting
Integer programs with bounded subdeterminants and two nonzeros per row
Integer linear-exponential programming in NP by quantifier elimination
A new and faster representation for counting integer points in parametric polyhedra
Space-efficient algorithm for integer programming with few constraints
The rational construction of a Wheeler DFA
Integer points in the degree-sequence polytope
Robust ordinal regression for subsets comparisons with interactions
Active learning supported iterative combinatorial auctions
Optimizing resource allocation: an active learning approach to iterative combinatorial auctions

This page was built for publication: On the complexity of integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922169)