Integer Programming with a Fixed Number of Variables

Cited in

(only showing first 100 items - show all)

Bin packing with controllable item sizes
Complexity of min-max subsequence problems
Periodic scheduling with obligatory vacations
Scheduling parallel machines with inclusive processing set restrictions and job release times
The vertices of the knapsack polytope
An integral transformation for integer programming problems
On Lovász' lattice reduction and the nearest lattice point problem
On principal ideal testing in algebraic number fields
An application of simultaneous diophantine approximation in combinatorial optimization
A hierarchy of polynomial time lattice basis reduction algorithms
Subclasses of Presburger arithmetic and the polynomial-time hierarchy
The diophantine problem of Frobenius: A close bound
Voting schemes for which it can be difficult to tell who won the election
An appraisal of computational complexity for operations researchers
Fine covers of a VAS language
Quantifier elimination for modules with scalar variables
On integer points in polyhedra
Pinwheel scheduling with two distinct numbers
The context-freeness of the languages associated with vector addition systems is decidable
Lattice translates of a polytope and the Frobenius problem
A relation of primal--dual lattices and the complexity of shortest lattice vector problem
Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
Simultaneous reduction of a lattice basis and its reciprocal basis
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Complexity of scheduling multiprocessor tasks with prespecified processors allocations
Factorization properties of lattices over the integers
Complexity of Presburger arithmetic with fixed quantifier dimension
A polynomial-time approximation scheme for maximizing the minimum machine completion time
Real data-integer solution problems within the Blum-Shub-Smale computational model
On variations of the subset sum problem
An approximation scheme for strip packing of rectangles with bounded dimensions
The optimal LLL algorithm is still polynomial in fixed dimension.
Integer programming, Barvinok's counting algorithm and Gomory relaxations.
The maximum deviation just-in-time scheduling problem.
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
On the limits of nonapproximability of lattice problems
Short vectors of planar lattices via continued fractions
Modelization of deterministic rational relations
A PTAS for the multiple subset sum problem with different knapsack capacities
Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
Energy efficient voltage scheduling for multi-core processors with software controlled dynamic voltage scaling
Pisot unit generators in number fields
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
Segment LLL reduction of lattice bases using modular arithmetic
Short rational generating functions for solving some families of fuzzy integer programming problems
On the string consensus problem and the Manhattan sequence consensus problem
Super-Golden-Gates for PU(2)
Thinner is not always better: cascade knapsack problems
Multi-attribute proportional representation
Pattern-guided k-anonymity
Tropical principal component analysis and its application to phylogenetics
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
On the number of integer points in a multidimensional domain
The complexity landscape of decompositional parameters for ILP
Swapping colored tokens on graphs
Geometric versions of the three-dimensional assignment problem under general norms
Integer programming as projection
FPT-algorithms for some problems related to integer programming
Minimum-cost b-edge dominating sets on trees
A note on non-degenerate integer programs with small sub-determinants
Multivariate complexity analysis of Swap Bribery
Algorithmic meta-theorems for restrictions of treewidth
A linear algorithm for integer programming in the plane
Integer convex minimization by mixed integer linear optimization
Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems
Note on the complexity of the mixed-integer hull of a polyhedron
On approximation algorithms for concave mixed-integer quadratic programming
The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
Cutting-plane proofs in polynomial space
On the computation of units and class numbers by a generalization of Lagrange's algorithm
Random lattices, threshold phenomena and efficient reduction algorithms.
A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
The inapproximability of lattice and coding problems with preprocessing
Shop scheduling problems with multiprocessor tasks on dedicated processors
Executing join queries in an uncertain distributed environment
Proportionate progress: A notion of fairness in resource allocation
A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
Lattice-based algorithms for number partitioning in the hard phase
Algorithms for highly symmetric linear and integer programs
Approximability of scheduling with fixed jobs
Parameterized complexity of \textsc{maximum edge colorable subgraph}
Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
A local maximizer for lattice width of 3-dimensional hollow bodies
Alliances in graphs of bounded clique-width
Local linear set on graphs with bounded twin cover number
On structural parameterizations of the edge disjoint paths problem
Polyhedral circuits and their applications
Algorithmic reduction of biological networks with multiple time scales
Approximate CVP\(_p\) in time \(2^{0.802n}\)
Piecewise linear valued constraint satisfaction problems with fixed number of variables
Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
The covering radius and a discrete surface area for non-hollow simplices
More on ordered open end bin packing
Techniques and results on approximation algorithms for packing circles
Target set selection parameterized by vertex cover and more
EPTAS for load balancing problem on parallel machines with a non-renewable resource
Parameterized complexity of maximum edge colorable subgraph
Empowering the configuration-IP: new PTAS results for scheduling with setup times
In memoriam: Gerhard Woeginger (1964--2022)

This page was built for publication: Integer Programming with a Fixed Number of Variables

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