ISUD

swMATH34491MaRDI QIDQ46200FDOQ46200

Author name not available (Why is that?)

Described by source

• Integral simplex using decomposition for the set partitioning problem

Cited In (15)

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

This page was built for software: ISUD