The following pages link to (Q4607934):
Displaying 34 items.
- Vectors in a box (Q715080) (← links)
- Local linear set on graphs with bounded twin cover number (Q2032157) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- The integrality number of an integer program (Q2118127) (← links)
- About the complexity of two-stage stochastic IPs (Q2118129) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Proximity in concave integer quadratic programming (Q2149572) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- Distances to lattice points in knapsack polyhedra (Q2191767) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Distances between optimal solutions of mixed-integer programs (Q2288201) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
- The Support of Integer Optimal Solutions (Q4577743) (← links)
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma (Q4973054) (← links)
- Faster Algorithms for Integer Programs with Block Structure (Q5002724) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590) (← links)
- About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
- The Integrality Number of an Integer Program (Q5041756) (← links)
- On Integer Programming and Convolution. (Q5090420) (← links)
- (Q5090494) (← links)
- (Q5091168) (← links)
- (Q5091234) (← links)
- The Distributions of Functions Related to Parametric Integer Optimization (Q5125408) (← links)
- Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (Q5138974) (← links)
- Distance-Sparsity Transference for Vertices of Corner Polyhedra (Q5147026) (← links)
- On Proximity for k-Regular Mixed-Integer Linear Optimization (Q5214422) (← links)
- (Q5874501) (← links)
- Proximity bounds for random integer programs (Q5918434) (← links)
- Proximity bounds for random integer programs (Q5925654) (← links)
- A colorful Steinitz lemma with application to block-structured integer programs (Q6120853) (← links)
