Linear fractional approximations for master problems in column generation

DOI10.1016/j.orl.2017.08.004zbMath1409.90106OpenAlexW2745275603MaRDI QIDQ1728318

Guy Desaulniers, Jacques Desrosiers, Hocine Bouarab, Jean Bertrand Gauthier

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.08.004

zbMATH Keywords

column generationlinear fractional programmaster problemsuper-geometric growth rate

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (1)

The minimum mean cycle-canceling algorithm for linear programs

Uses Software

• ISUD

Cites Work

• Unnamed Item
• Integral Simplex Using Decomposition for the Set Partitioning Problem
• An Improved Primal Simplex Algorithm for Degenerate Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• Finding minimum-cost circulations by canceling negative cycles
• Programming with linear fractional functionals

This page was built for publication: Linear fractional approximations for master problems in column generation