Pages that link to "Item:Q1024724"
From MaRDI portal
The following pages link to Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724):
Displayed 6 items.
- Continuous reformulations for zero-one programming problems (Q415420) (← links)
- Uniqueness of integer solution of linear equations (Q601980) (← links)
- A generalized Newton method for absolute value equations associated with second order cones (Q609239) (← links)
- Interval algorithm for absolute value equations (Q657417) (← links)
- Exact penalty functions for nonlinear integer programming problems (Q983724) (← links)
- Probability of unique integer solution to a system of linear equations (Q2275621) (← links)