Pages that link to "Item:Q2349847"
From MaRDI portal
The following pages link to A strongly polynomial method for solving integer max-linear optimization problems in a generic case (Q2349847):
Displaying 5 items.
- On the integer max-linear programming problem (Q741732) (← links)
- Constrained integer fractional programming problem with box constraints (Q1689256) (← links)
- A strongly polynomial algorithm for bimodular integer linear programming (Q4978060) (← links)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
- Approximating the volume of tropical polytopes is difficult (Q5742783) (← links)