Pages that link to "Item:Q3929541"
From MaRDI portal
The following pages link to Finite checkability for integer rounding properties in combinatorial programming problems (Q3929541):
Displaying 6 items.
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← links)
- Membership criteria and containments of powers of monomial ideals (Q2000797) (← links)
- Integer Rounding for Polymatroid and Branching Optimization Problems (Q3668310) (← links)
- A polynomial algorithm for integer programming covering problems satisfying the integer round-up property (Q3929542) (← links)
- Integral decomposition in polyhedra (Q4740329) (← links)