Hybrid column generation for large-size covering integer programs: application to transportation planning

DOI10.1016/J.COR.2013.02.020MaRDI QIDQ336412zbMATH OpenOpenAlexFDO

Authors J. Sadki, Laurent Alfandari, Agnès Plateau, A. Nagih

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2013.02.020

zbMATH Keywords

approximationcolumn generationtransportation planninggreedy heuristiccovering integer programmingfractional problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)

Recommendations

• Implementing Mixed Integer Column Generation
• Branch-and-price: Column generation for solving huge integer programs
• Solutions diversification in a column generation algorithm
• scientific article; zbMATH DE number 5863207
• Generalized column generation for linear programming

Cites work

• scientific article; zbMATH DE number 1501879 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• scientific article; zbMATH DE number 3197631 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• A branch-first, cut-second approach for locomotive assignment
• Airline crew pairing optimization
• Approximation algorithms for combinatorial fractional programming problems
• Approximation algorithms for integer covering problems via greedy column generation
• Branch-and-price: Column generation for solving huge integer programs
• Branching in branch-and-price: A generic scheme
• Column generation based heuristic for tactical planning in multi-period vehicle routing
• Column-Generation in Integer Linear Programming
• Combinatorial Optimization with Rational Objective Functions
• Decomposition Principle for Linear Programs
• Engine scheduling by column generation
• Locomotive assignment with heterogeneous consists at CN North America
• Nodal aggregation of resource constraints in a shortest path problem
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• On Nonlinear Fractional Programming
• Performances improvement of the column generation algorithm: application to vehicle routing problems
• Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution
• Solutions diversification in a column generation algorithm
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

Cited in

(1)

• Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation

This page was built for publication: Hybrid column generation for large-size covering integer programs: application to transportation planning

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