Theory of linear and integer programming
Theory of linear and integer programming
Computer solution of linear programs
Computer solution of linear programs
A unified approach for price directive decomposition procedures in integer programming
Discrete Applied Mathematics
Modelling and strong linear programs for mixed integer programming
Algorithms and model formulations in mathematical programming
A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
Solving binary cutting stock problems by column generation and branch-and-bound
Computational Optimization and Applications
An integer programming approach to the bandwidth packing problem
Management Science
Daily aircraft routing and scheduling
Management Science
Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem
Computational Optimization and Applications
Plant location with minimum inventory
Mathematical Programming: Series A and B
Discrete Mathematics
An interior point method in Dantzig-Wolfe decomposition
Computers and Operations Research
The vehicle routing problem
On some difficult linear programs coming from set partitioning
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems
Computational Optimization and Applications
Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Drive: Dynamic Routing of Independent Vehicles
Operations Research
Flight String Models for Aircraft Fleeting and Routing
Transportation Science
The Preferential Bidding System at Air Canada
Transportation Science
2-Path Cuts for the Vehicle Routing Problem with Time Windows
Transportation Science
A Column Generation Approach for Large-Scale Aircrew Rostering Problems
Operations Research
Solving Real-World Linear Programs: A Decade and More of Progress
Operations Research
Engine Routing and Scheduling at Industrial In-Plant Railroads
Transportation Science
The integration of an interior-point cutting plane method within a branch-and-price algorithm
Mathematical Programming: Series A and B
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
INFORMS Journal on Computing
Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
Operations Research
A combinatorial column generation algorithm for the maximum stable set problem
Operations Research Letters
An exact algorithm for IP column generation
Operations Research Letters
Optimal delivery of sponsored search advertisements subject to budget constraints
Proceedings of the 8th ACM conference on Electronic commerce
Computers and Operations Research
On minimum k-modal partitions of permutations
Journal of Discrete Algorithms
Branch-and-price-and-cut algorithms for solving the reliable h-paths problem
Journal of Global Optimization
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informations
Trustworthy Global Computing
Exact and Asymptotically Exact Solutions for a Class of Assortment Problems
INFORMS Journal on Computing
Total flow time minimization in a flowshop sequence-dependent group scheduling problem
Computers and Operations Research
The train driver recovery problem-A set partitioning based model and solution method
Computers and Operations Research
Constraint-specific recovery network for solving airline recovery problems
Computers and Operations Research
An integrated column generation and lagrangian relaxation for flowshop scheduling problems
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Multiship Crane Sequencing with Yard Congestion Constraints
Transportation Science
Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
INFORMS Journal on Computing
Fundamental results on target coverage problem in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Boosting through optimization of margin distributions
IEEE Transactions on Neural Networks
A quantitative analysis of the capacity of wireless mesh networks
IEEE Communications Letters
A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem
Transportation Science
INFORMS Journal on Computing
Solving the Curfew Planning Problem
Transportation Science
Fast algorithms for joint power control and scheduling in wireless networks
IEEE Transactions on Wireless Communications
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
CORADD: correlation aware database designer for materialized views and indexes
Proceedings of the VLDB Endowment
SearchCol: metaheuristic search by column generation
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Branch and Price for Service Network Design with Asset Management Constraints
Transportation Science
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
INFORMS Journal on Computing
Branch and Price for Service Network Design with Asset Management Constraints
Transportation Science
Solving Nonlinear Covering Problems Arising in WLAN Design
Operations Research
A Lagrangian heuristic for satellite range scheduling with resource constraints
Computers and Operations Research
Integrated Sequencing and Scheduling in Coil Coating
Management Science
Theoretical treatment of target coverage in wireless sensor networks
Journal of Computer Science and Technology - Special issue on natural language processing
A set partitioning reformulation of a school bus scheduling problem
Journal of Scheduling
New Stabilization Procedures for the Cutting Stock Problem
INFORMS Journal on Computing
A shortest path-based approach to the multileaf collimator sequencing problem
Discrete Applied Mathematics
Chebyshev center based column generation
Discrete Applied Mathematics
A branch-and-price approach for harvest scheduling subject to maximum area restrictions
Computational Optimization and Applications
A hybrid column generation and constraint programming optimizer for the tail assignment problem
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hybrid methods for the multileaf collimator sequencing problem
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans
Computers and Operations Research
Assigning multiple activities to work shifts
Journal of Scheduling
A note on branch-and-cut-and-price
Operations Research Letters
A generic view of Dantzig-Wolfe decomposition in mixed integer programming
Operations Research Letters
A Branch and Price algorithm for the k-splittable maximum flow problem
Discrete Optimization
Positive semidefinite metric learning using boosting-like algorithms
The Journal of Machine Learning Research
A branch and price algorithm for the SS/TDMA problem with cardinality constraint
Computers and Operations Research
Parse, price and cut: delayed column and row generation for graph based parsers
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
A unified optimization framework for auction and guaranteed delivery in online advertising
Proceedings of the 21st ACM international conference on Information and knowledge management
Solving a robust airline crew pairing problem with column generation
Computers and Operations Research
The Pickup and Delivery Problem with Cross-Docking
Computers and Operations Research
Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
Operations Research
An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment
Transportation Science
Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms
Computers and Operations Research
Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling
INFORMS Journal on Computing
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem
INFORMS Journal on Computing
Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows
Transportation Science
A fast algorithm for kernel 1-norm support vector machines
Knowledge-Based Systems
A hybrid column generation with GRASP and path relinking for the network load balancing problem
Computers and Operations Research
Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling
Computers and Operations Research
On Minimum Reload Cost Cycle Cover
Discrete Applied Mathematics
| Hi-index | 0.00 |
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large-scale integer programming. We outline and relate the approaches, and survey mainly recent contributions, not yet found in textbooks. We emphasize the growing understanding of the dual point of view, which has brought considerable progress to the column generation theory and practice. It stimulated careful initializations, sophisticated solution techniques for the restricted master problem and subproblem, as well as better overall performance. Thus, the dual perspective is an ever recurring concept in our "selected topics."