All-integer column generation for set partitioning: basic principles and extensions
From MaRDI portal
Publication:296975
DOI10.1016/J.EJOR.2013.08.036zbMATH Open1339.90241OpenAlexW1976578266WikidataQ61940978 ScholiaQ61940978MaRDI QIDQ296975FDOQ296975
Authors: Elina Rönnberg, Torbjörn Larsson 
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-76091
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
- Integral simplex using decomposition for the set partitioning problem
- Selected Topics in Column Generation
- Branch-and-price: Column generation for solving huge integer programs
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Branching in branch-and-price: A generic scheme
- On the Set-Covering Problem
- Title not available (Why is that?)
- An integral simplex algorithm for solving combinatorial optimization problems
- A technical review of column generation in integer programming
- Column generation based primal heuristics
- Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Method of Decomposition for Integer Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A feasible direction method for linear programming
- Column generation in the integral simplex method
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
Cited In (10)
- Integral Column Generation for Set Partitioning Problems with Side Constraints
- An integer optimality condition for column generation on zero-one linear programs
- 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
- Searching for optimal integer solutions to set partitioning problems using column generation
- Influence of the normalization constraint on the integral simplex using decomposition
- Complementary column generation and bounding approaches for set partitioning formulations
- Column generation in the integral simplex method
- Column-to-row operations on partitions: Garden of Eden partitions
- Integral simplex using decomposition with primal cutting planes
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling
Uses Software
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)
