Pages that link to "Item:Q4973054"

The following pages link to Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma (Q4973054):

Displaying 20 items.

• Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
• More on change-making and related problems (Q2051861) (← links)
• Improving the Cook et al. proximity bound given integral valued constraints (Q2164682) (← links)
• A note on a variant of the online open end bin packing problem (Q2661578) (← links)
• A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) (Q2674382) (← links)
• Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
• On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases (Q5099099) (← links)
• Proximity bounds for random integer programs (Q5918434) (← links)
• On the integrality gap of binary integer programs with Gaussian data (Q5918435) (← links)
• Proximity bounds for random integer programs (Q5925654) (← links)
• On the integrality gap of binary integer programs with Gaussian data (Q5925655) (← links)
• High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
• Hedonic diversity games: a complexity picture with more than two colors (Q6067039) (← links)
• Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube (Q6155880) (← links)
• Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
• On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
• Scheduling with cardinality dependent unavailability periods (Q6565385) (← links)
• Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
• Parameterized complexity of weighted target set selection (Q6636096) (← links)
• The complexity of soundness in workflow nets (Q6649450) (← links)