Live briefing
Everything about Column generation
Algorithm for solving linear programs
Column generation or delayed column generation is an efficient algorithm for solving large linear programs. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Column generationA 5-minute orientation
- Skim a recent paper: A column generation-based exact solution method for seru scheduling problemsInfluential work since 2022
- Pick up a classic book: Longitudes and AttitudesThe most-reprinted book on the subject
- Read the landmark paper: Selected Topics in Column GenerationCited 854 times
- Go sideways: Benders decompositionA closely related topic
- Go sideways: Duality (optimization)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Selected Topics in Column Generation
A Column Generation Approach for Graph Coloring
Linear Programming Boosting via Column Generation
Routing with time windows by column generation
Stabilized column generation
Preference scheduling for nurses using column generation
An exact algorithm for IP column generation
Parallel Machine Scheduling by Column Generation
🆕 Influential since 2022
A column generation-based exact solution method for seru scheduling problems
Quantum pricing-based column-generation framework for hard combinatorial problems
A machine-learning-based column generation heuristic for electric bus scheduling
Electric Vehicle Fleets: Scalable Route and Recharge Scheduling Through Column Generation
A column generation approach for the team formation problem
📚 Books worth reading
Longitudes and AttitudesThomas L. Friedman · 2002
Structure for architectsRamsey Dabby · 2011
Voices of the poor: selections from the Morning Chronicle 'Labour and the poor' (1849-1850)Henry Mayhew, Anne Humphreys · 1971
Concrete-Filled Stainless Steel Tubular ColumnsVipulkumar Patel, Qing Quan Liang · 2018
Design Examples for High Strength Steel Reinforced Concrete ColumnsSing-Ping Chiew, Yan-Qing Cai · 2018- 📕Geosynthetic Encased Columns for Soft Soil ImprovementMárcio Almeida, Mario Riccio · 2018
Design of High Strength Steel Reinforced Concrete ColumnsSing-Ping Chiew, Yan-Qing Cai · 2018
Invenzione occasionaleElena Ferrante · 2019
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Benders decomposition Benders decomposition (or Benders' decomposition) is a technique in mathematical optimization that allows the solution of very large linear programming…
- Duality (optimization) In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives…
- Simplex algorithm In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming. The name of the algorithm is derived…
- Constrained optimization In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function…
- Dual linear program The dual of a given linear program (LP) is another LP that is derived from the original (the primal) LP in the following schematic way: Each variable in…
- Linear programming relaxation In mathematics, the relaxation of a (mixed) integer linear program is the problem that arises by removing the integrality constraint of each variable.…
- Dantzig–Wolfe decomposition Dantzig–Wolfe decomposition is an algorithm for solving (mixed integer) linear programming problems by exploiting their structure. It was originally developed…
- Basic feasible solution In the theory of linear programming, a basic feasible solution (BFS) is a solution with a minimal set of non-zero variables. Geometrically, each BFS corresponds…