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

DOI10.1016/J.COR.2013.02.020zbMATH Open1348.90470OpenAlexW2081267654MaRDI QIDQ336412FDOQ336412

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

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

zbMATH Keywords

approximationcolumn generationtransportation planninggreedy heuristiccovering integer programmingfractional problems

Mathematics Subject Classification ID

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

Cites Work

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

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)