Pages that link to "Item:Q2480055"

The following pages link to Carathéodory bounds for integer cones (Q2480055):

Displaying 40 items.

• New approximability results for two-dimensional bin packing (Q261358) (← links)
• Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
• Branching in branch-and-price: A generic scheme (Q652288) (← links)
• Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
• On the complexity of timed pattern matching (Q832025) (← links)
• Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions (Q835601) (← links)
• On the bin packing problem with a fixed number of object weights (Q872247) (← links)
• Cardinality constraints for arrays (decidability results and applications) (Q1688541) (← links)
• A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927) (← links)
• Sparse representation of vectors in lattices and semigroups (Q2118144) (← links)
• NP satisfiability for arrays as powers (Q2152659) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Closure properties of knapsack semilinear groups (Q2236107) (← links)
• Huge multiway table problems (Q2339833) (← links)
• The syllogistic with unity (Q2377188) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Generalized flatness constants, spanning lattice polytopes, and the Gromov width (Q2686594) (← links)
• Counting Constraints in Flat Array Fragments (Q2817911) (← links)
• Small substructures and decidability issues for first-order logic with two variables (Q2915891) (← links)
• Reasoning with Global Assumptions in Arithmetic Modal Logics (Q2947894) (← links)
• An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints (Q2958349) (← links)
• Closing the Gap for Makespan Scheduling via Sparsification Techniques (Q3387928) (← links)
• About the Structure of the Integer Cone and Its Application to Bin Packing (Q3387933) (← links)
• Huge Unimodular $n$-Fold Programs (Q3455242) (← links)
• The two‐variable fragment with counting and equivalence (Q3460527) (← links)
• Linear Arithmetic with Stars (Q3512499) (← links)
• Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars (Q3540175) (← links)
• The Support of Integer Optimal Solutions (Q4577743) (← links)
• Optimizing Sparsity over Lattices and Semigroups (Q5041733) (← links)
• The Distributions of Functions Related to Parametric Integer Optimization (Q5125408) (← links)
• Distance-Sparsity Transference for Vertices of Corner Polyhedra (Q5147026) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• Two-Variable Logic with Counting and Trees (Q5278191) (← links)
• New Algorithmic Results for Bin Packing and Scheduling (Q5283351) (← links)
• On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics (Q5387294) (← links)
• Decision Procedures for Multisets with Cardinality Constraints (Q5452719) (← links)
• Sparse Solutions of Linear Diophantine Equations (Q5737776) (← links)
• An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
• New Bounds for the Integer Carathéodory Rank (Q6136661) (← links)
• On algebraic array theories (Q6192058) (← links)