Pages that link to "Item:Q1812093"

The following pages link to An integral simplex algorithm for solving combinatorial optimization problems (Q1812093):

Displaying 14 items.

• All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
• Influence of the normalization constraint on the integral simplex using decomposition (Q729804) (← links)
• Column generation in the integral simplex method (Q948677) (← links)
• Improved integral simplex using decomposition for the set partitioning problem (Q1616829) (← links)
• Integral simplex using decomposition with primal cutting planes (Q1683694) (← links)
• Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling (Q1694842) (← 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)
• Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
• Integral Simplex Using Decomposition for the Set Partitioning Problem (Q2875612) (← links)
• Integral Column Generation for Set Partitioning Problems with Side Constraints (Q5106424) (← links)
• Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
• Valid Inequalities and Separation Algorithms for the Set Partitioning Problem (Q6160432) (← links)
• A quadratic simplex algorithm for primal optimization over zero-one polytopes (Q6202952) (← links)