All-integer column generation for set partitioning: basic principles and extensions
From MaRDI portal
Recommendations
- Searching for optimal integer solutions to set partitioning problems using column generation
- Complementary column generation and bounding approaches for set partitioning formulations
- Integral Column Generation for Set Partitioning Problems with Side Constraints
- Distributed integral column generation for set partitioning problems
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Circuit Partitioning Via Set Partitioning and Column Generation
- Column generation extensions of set covering greedy heuristics
- A Fast Algorithm for Generating Set Partitions
- A hybrid exact algorithm for complete set partitioning
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
Cites work
- scientific article; zbMATH DE number 3825556 (Why is no real title available?)
- scientific article; zbMATH DE number 3828715 (Why is no real title available?)
- scientific article; zbMATH DE number 3961338 (Why is no real title available?)
- scientific article; zbMATH DE number 3495856 (Why is no real title available?)
- scientific article; zbMATH DE number 3333883 (Why is no real title available?)
- scientific article; zbMATH DE number 3069636 (Why is no real title available?)
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- A Method of Decomposition for Integer Programs
- A feasible direction method for linear programming
- A technical review of column generation in integer programming
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- An integral simplex algorithm for solving combinatorial optimization problems
- Branch-and-price: Column generation for solving huge integer programs
- Branching in branch-and-price: A generic scheme
- Column generation based primal heuristics
- Column generation in the integral simplex method
- Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
- Integral simplex using decomposition for the set partitioning problem
- On the Set-Covering Problem
- Selected Topics in Column Generation
Cited in
(10)- 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
- Complementary column generation and bounding approaches for set partitioning formulations
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
- Column-to-row operations on partitions: Garden of Eden partitions
- Column generation in the integral simplex method
- Influence of the normalization constraint on the integral simplex using decomposition
- Integral simplex using decomposition with primal cutting planes
- Integral Column Generation for Set Partitioning Problems with Side Constraints
- Searching for optimal integer solutions to set partitioning problems using column generation
- An integer optimality condition for column generation on zero-one linear programs
This page was built for publication: All-integer column generation for set partitioning: basic principles and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296975)