Searching for optimal integer solutions to set partitioning problems using column generation

DOI10.1111/ITOR.12050MaRDI QIDQ5416769zbMATH OpenOpenAlexFDO

Authors

Publication date 15 May 2014

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11250/227270

zbMATH Keywords

heuristicinteger programmingcolumn generationLagrangian relaxationset partitioning problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)

Recommendations

• All-integer column generation for set partitioning: basic principles and extensions
• 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
• An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
• 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
• A combinatorial column generation algorithm for the maximum stable set problem
• An integer programming column generation principle for heuristic search methods
• Column generation extensions of set covering greedy heuristics
• Approximation algorithms for integer covering problems via greedy column generation

Cites work

• A concurrent processing framework for the set partitioning problem
• A proximal trust-region algorithm for column generation stabilization
• A relax-and-cut algorithm for the set partitioning problem
• Branch-and-price: Column generation for solving huge integer programs
• Column Generation
• Comparison of bundle and classical column generation
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• Interior point stabilization for column generation
• On some difficult linear programs coming from set partitioning
• Selected Topics in Column Generation
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Some relationships between lagrangian and surrogate duality in integer programming
• Stabilized column generation
• The B<scp>oxstep</scp> Method for Large-Scale Optimization
• The integration of an interior-point cutting plane method within a branch-and-price algorithm
• Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems

Cited in

(9)

• An integer programming column generation principle for heuristic search methods
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods
• All-integer column generation for set partitioning: basic principles and extensions
• 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
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing
• Column generation in the integral simplex method
• Column-to-row operations on partitions: Garden of Eden partitions
• Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019

This page was built for publication: Searching for optimal integer solutions to set partitioning problems using column generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5416769)