The following pages link to (Q5111743):
Displaying 19 items.
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- About the complexity of two-stage stochastic IPs (Q2118129) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- The last dozen of years of or research in Czechia and Slovakia (Q2673270) (← links)
- The Support of Integer Optimal Solutions (Q4577743) (← links)
- Faster Algorithms for Integer Programs with Block Structure (Q5002724) (← links)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
- (Q5075765) (← links)
- (Q5090421) (← links)
- (Q5090494) (← links)
- (Q5091234) (← links)
- (Q5111743) (← links)
- Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (Q5138974) (← links)
- (Q5140719) (← links)
- The clever shopper problem (Q5919456) (← links)
