Pages that link to "Item:Q1396977"
From MaRDI portal
The following pages link to The integral basis method for integer programming (Q1396977):
Displaying 13 items.
- Manifold relaxations for integer programming (Q380594) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- An integral transformation for integer programming problems (Q1062628) (← links)
- A primal all-integer algorithm based on irreducible solutions (Q1424268) (← links)
- An algorithm for mixed integer optimization (Q1424300) (← links)
- Improved integral simplex using decomposition for the set partitioning problem (Q1616829) (← links)
- An integer linear programming approach for a class of bilinear integer programs (Q1785220) (← links)
- Integral simplex using double decomposition for set partitioning problems (Q2273675) (← links)
- Improving set partitioning problem solutions by zooming around an improving direction (Q2288990) (← links)
- Integral simplex using decomposition for the set partitioning problem (Q2875612) (← links)
- A class of integer linear fractional bilevel programming problems (Q2926478) (← links)
- Iterated Chvátal--Gomory Cuts and the Geometry of Numbers (Q2934479) (← links)
- A New Algebraic Geometry Algorithm for Integer Programming (Q3116774) (← links)