The following pages link to (Q5090421):
Displaying 15 items.
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- Approximation schemes for the generalized extensible bin packing problem (Q832515) (← links)
- Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
- Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
- Approximating Weighted Completion Time for Order Scheduling with Setup Times (Q3297757) (← links)
- About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- (Q5090494) (← links)
- (Q5091234) (← links)
- Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (Q5138974) (← links)
- (Q5874501) (← links)
- High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
- EPTAS for parallel identical machine scheduling with time restrictions (Q6123390) (← links)
- Approximation schemes for machine scheduling (Q6606622) (← links)
