The following pages link to Huge Unimodular $n$-Fold Programs (Q3455242):
Displaying 5 items.
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- (Q5091234) (← links)
- Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (Q5138974) (← links)
