Pages that link to "Item:Q703262"
From MaRDI portal
The following pages link to Optimality criterion for a class of nonlinear integer programs. (Q703262):
Displayed 8 items.
- Lower bounds on the graver complexity of \(M\)-fold matrices (Q259721) (← links)
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- Optimality criterion for a class of nonlinear integer programs. (Q703262) (← links)
- Cone superadditivity of discrete convex functions (Q715073) (← links)
- On test sets for nonlinear integer maximization (Q1003492) (← links)
- \(n\)-fold integer programming in cubic time (Q1942262) (← links)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- Vector and matrix apportionment problems and separable convex integer optimization (Q2482690) (← links)