ISUD

swMATH34491MaRDI QIDQ46200

No author found.

Described by source

• Integral Simplex Using Decomposition for the Set Partitioning Problem

Related Items (15)

Improved integral simplex using decomposition for the set partitioning problem ⋮ All-integer column generation for set partitioning: basic principles and extensions ⋮ Distributed integral column generation for set partitioning problems ⋮ The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties ⋮ Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows ⋮ Integral simplex using decomposition with primal cutting planes ⋮ Integral Column Generation for Set Partitioning Problems with Side Constraints ⋮ Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling ⋮ Linear fractional approximations for master problems in column generation ⋮ Dynamic constraint aggregation for solving very large-scale airline crew pairing problems ⋮ Avoiding redundant columns by adding classical Benders cuts to column generation subproblems ⋮ Integral simplex using double decomposition for set partitioning problems ⋮ Influence of the normalization constraint on the integral simplex using decomposition ⋮ Improving set partitioning problem solutions by zooming around an improving direction ⋮ Row-reduced column generation for degenerate master problems

This page was built for software: ISUD