Integer Programming with a Fixed Number of Variables

Cited in

(only showing first 100 items - show all)

Target Set Selection in Dense Graph Classes
Combinatorial \(n\)-fold integer programming and applications
Huge multiway table problems
The l-diversity problem: tractability and approximability
New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
On the optimality of pseudo-polynomial algorithms for integer programming
Quantum algorithms for algebraic problems
Electing a committee with dominance constraints
Optimizing low dimensional functions over the integers
Approximability of sparse integer programs
On the optimality of pseudo-polynomial algorithms for integer programming
scientific article; zbMATH DE number 7278041 (Why is no real title available?)
Exploiting symmetries in polyhedral computations
Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
Packing arc-disjoint cycles in oriented graphs
Parameterized complexity for iterated type partitions and modular-width
Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
Enumeration and unimodular equivalence of empty delta-modular simplices
The possible winner with uncertain weights problem
On principal ideal testing in algebraic number fields
Parameterized complexity of coloring problems: treewidth versus vertex cover
Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing
On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems
Studies in Computational Aspects of Voting
New support size bounds for integer programming, applied to makespan minimization on uniformly related machines
Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
Thinner is not always better: cascade knapsack problems
The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
Further parameterized results on weak Grundy coloring
Improved approximation algorithms for multiprocessor indivisible coflow scheduling
A dichotomy for real weighted Holant problems
A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
Data-complexity of the two-variable fragment with counting quantifiers
The (not so) trivial lifting in two dimensions
New algorithms for minimizing the weighted number of tardy jobs on a single machine
Acyclic coloring parameterized by directed clique-width
Parameterized complexity of locally minimal defensive alliances
The balanced satisfactory partition problem
Integer equal flows
A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
Reachability analysis of low-order discrete state reaction networks obeying conservation laws
Parameterized resiliency problems
The integrality number of an integer program
Testing additive integrality gaps
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
A multivariate complexity analysis of the material consumption scheduling problem
Grundy Distinguishes Treewidth from Pathwidth
Short vectors of planar lattices via continued fractions
Parameterized computational complexity of Dodgson and Young elections
Non-standard approaches to integer programming
Real data-integer solution problems within the Blum-Shub-Smale computational model
Solving hard stable matching problems involving groups of similar agents
From approximate to exact integer programming
The optimal LLL algorithm is still polynomial in fixed dimension.
Multi-attribute proportional representation
Scheduling with cardinality dependent unavailability periods
FPT approximation for fair minimum-load clustering
Effective lattice point counting in rational convex polytopes
Complexity of integer quasiconvex polynomial optimization
Finding a cluster in incomplete data
Improved approximation algorithms for multiprocessor indivisible coflow scheduling
Column basis reduction and decomposable knapsack problems
Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem
Improved approximation schemes for early work scheduling on identical parallel machines with a common due date
Minimization of even conic functions on the two-dimensional integral lattice
The minimum-cost dynamic flow problem in a fixed graph with a constant target flow value
Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
On polynomial kernels for sparse integer linear programs
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
Vertex cover meets scheduling
Unbounded knapsack problems with arithmetic weight sequences
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
Critical properties of bipartite permutation graphs
On the Column Number and Forbidden Submatrices for -Modular Matrices
EPTAS for the dual of splittable bin packing with cardinality constraint
Privacy in elections: k-anonymizing preference orders
Robustness among multiwinner voting rules
When can graph hyperbolicity be computed in linear time?
Bipartite finite Toeplitz graphs
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 parameterized complexity of controlling amendment and successive winners
Complexity of min-max subsequence problems
Single-machine scheduling with fixed energy recharging times to minimize the number of late jobs and the number of just-in-time jobs: a parameterized complexity analysis
On degree sequence optimization
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times
Scheduling problems on parallel machines with machine-dependent generalized due-dates
On the number of integer points in translated and expanded polyhedra
The birth and early years of parameterized complexity
Complexity and approximability of parameterized MAX-CSPs
The computational complexity of integer programming with alternations
Disentangling the computational complexity of network untangling
Super-Golden-Gates for PU(2)
On coresets for fair clustering in metric and Euclidean spaces and their applications
A linear algorithm for integer programming in the plane
Complexity of Presburger arithmetic with fixed quantifier dimension

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)