Pages that link to "Item:Q3922169"

The following pages link to On the complexity of integer programming (Q3922169):

Displaying 50 items.

• The width and integer optimization on simplices with bounded minors of the constraint matrices (Q315480) (← links)
• Testing additive integrality gaps (Q378120) (← links)
• On the path-width of integer linear programming (Q515665) (← links)
• Automata for unordered trees (Q515668) (← links)
• Mixed-integer quadratic programming is in NP (Q517303) (← links)
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
• Vectors in a box (Q715080) (← links)
• The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
• Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
• Approximation algorithms for Hamming clustering problems (Q876719) (← links)
• A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
• Trichotomy for integer linear systems based on their sign patterns (Q906434) (← links)
• An appraisal of computational complexity for operations researchers (Q1173532) (← links)
• An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271) (← links)
• A genetic algorithm of determining cycle time for printed circuit board assembly lines (Q1592746) (← links)
• Length-bounded disjoint paths in planar graphs (Q1613380) (← links)
• A theoretical framework for cardinality-based feature models: the semantics and computational aspects (Q1647962) (← links)
• Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
• New techniques for linear arithmetic: cubes and equalities (Q1688532) (← links)
• Binary decision rules for multistage adaptive mixed-integer optimization (Q1702781) (← links)
• Knapsack in graph groups (Q1702854) (← links)
• Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
• The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
• A note on non-degenerate integer programs with small sub-determinants (Q1755835) (← links)
• \(\mathbb N\)-solutions to linear systems over \(\mathbb Z\) (Q1827486) (← links)
• Decidable integration graphs. (Q1854273) (← links)
• Minimal resolutions of lattice ideals and integer linear programming (Q1884028) (← links)
• Detectability of labeled weighted automata over monoids (Q2081085) (← links)
• An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
• Numerical semigroups generated by quadratic sequences (Q2143178) (← links)
• Fast and efficient bit-level precision tuning (Q2145313) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Finding cut-offs in leaderless rendez-vous protocols is easy (Q2233393) (← links)
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
• Partitioned EDF scheduling on a few types of unrelated multiprocessors (Q2251370) (← links)
• A complete and terminating approach to linear integer solving (Q2307624) (← links)
• Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
• Cutting to the chase. (Q2351157) (← links)
• Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
• Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
• On the complexity of achieving proportional representation (Q2426957) (← links)
• The master equality polyhedron with multiple rows (Q2429471) (← links)
• The complexity of finite model reasoning in description logics (Q2486582) (← links)
• Complexity of the two-variable fragment with counting quantifiers (Q2567347) (← links)
• Novel geometric approach for virtual coiling (Q2636492) (← links)
• Complexity of modal logics with Presburger constraints (Q2638188) (← links)
• Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
• Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
• On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
• Abelian Networks I. Foundations and Examples (Q2804993) (← links)