Pages that link to "Item:Q5892165"
From MaRDI portal
The following pages link to When polynomial approximation meets exact computation (Q5892165):
Displaying 5 items.
- 4OR comes of age. Editorial note (Q2040603) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)
- Preface (Q5970304) (← links)
