Pages that link to "Item:Q1424268"
From MaRDI portal
The following pages link to A primal all-integer algorithm based on irreducible solutions (Q1424268):
Displaying 11 items.
- Compact representations of all members of an independence system (Q513340) (← links)
- Optimality criterion for a class of nonlinear integer programs. (Q703262) (← links)
- Cone superadditivity of discrete convex functions (Q715073) (← links)
- Influence of the normalization constraint on the integral simplex using decomposition (Q729804) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- New technique for solving primal all-integer linear programming (Q1393023) (← links)
- The integral basis method for integer programming (Q1396977) (← links)
- Integral simplex using decomposition with primal cutting planes (Q1683694) (← links)
- Extended formulations for Gomory corner polyhedra (Q2386199) (← links)
- Approximate extended formulations (Q2583138) (← links)
- A quadratic simplex algorithm for primal optimization over zero-one polytopes (Q6202952) (← links)