A Primer in Column Generation
From MaRDI portal
Publication:5493626
DOI10.1007/0-387-25486-2_1zbMath1246.90093OpenAlexW2149335048MaRDI QIDQ5493626
Jacques Desrosiers, Marco E. Lübbecke
Publication date: 16 October 2006
Published in: Column Generation (Search for Journal in Brave)
Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15478
Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Linear programming (90C05) Interior-point methods (90C51) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items
Workforce scheduling and routing problems: literature survey and computational study, Planning personnel retraining: column generation heuristics, Outpatient appointment scheduling given individual day-dependent no-show predictions, Freight railway operator timetabling and engine scheduling, Dynamic gate configurations at airports: a network optimization approach, A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem, Column generation for a UAV assignment problem with precedence constraints, Network Design with Service Requirements: Scaling-up the Size of Solvable Problems, A branch-and-price algorithm for stable workforce assignments with hierarchical skills, Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce, Optimization in Designing Complex Communication Networks, A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine, Optimized load planning for motorail transportation, Uncontrolled inexact information within bundle methods, Constraint-specific recovery network for solving airline recovery problems, Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework, The arc-item-load and related formulations for the cumulative vehicle routing problem, Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine, Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach, A column generation-based heuristic for a rehabilitation patient scheduling and routing problem, Delay resistant line planning with a view towards passenger transfers, Lower and upper bounding procedures for the bin packing problem with concave loading cost, Integrating train service route design with passenger flow allocation for an urban rail transit line, Configuration‐based approach for topological problems in the design of wireless sensor networks, Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows, Column generation approach for the point-feature cartographic label placement problem, Elective course planning, On the impact of resource relocation in facing health emergencies, Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods, Parallel batching with multi-size jobs and incompatible job families, A column generation approach to the discrete barycenter problem, Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems, Coordinated cutting plane generation via multi-objective separation, Optimizing railway crew schedules with fairness preferences, Liner shipping service scheduling and cargo allocation, Optimization in liner shipping, A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem, Branch-and-Bound for Bi-objective Integer Programming, Dynamic constraint aggregation for solving very large-scale airline crew pairing problems, A branch-and-price algorithm for the liner shipping network design problem, The dynamic-demand joint replenishment problem with approximated transportation costs, An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs, A robust framework for task-related resident scheduling, Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft, A branch-and-price algorithm for the minimum sum coloring problem, A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design, Optimization in liner shipping, Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling, Column generation for vehicle routing problems with multiple synchronization constraints, Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem, Integrating rolling stock scheduling with train unit shunting, An optimization approach to designing a baseball scout network, Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints, A new branch-and-bound algorithm for the maximum weighted clique problem, A column generation approach for solving the patient admission scheduling problem, Oil production optimization solved by piecewise linearization in a branch \& price framework, An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007, Range-constrained traffic assignment with multi-modal recharge for electric vehicles, A graph partitioning strategy for solving large-scale crew scheduling problems, Primal Heuristics for Branch-and-Price Algorithms, Column Generation for Multi-Matrix Blocking Problems, A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints, The undirected capacitated arc routing problem with profits, A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows, Avoiding redundant columns by adding classical Benders cuts to column generation subproblems, Joint vehicle assembly‐routing problems: An integrated modeling and optimization approach, A column generation approach for an emission-oriented vehicle routing problem on a multigraph, Orientational variable-length strip covering problem: a branch-and-price-based algorithm, A column generation approach for the maximal covering location problem, Reductions of Approximate Linear Programs for Network Revenue Management, Robust crew pairing for managing extra flights, Complementary column generation and bounding approaches for set partitioning formulations, A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example, Automatic Dantzig-Wolfe reformulation of mixed integer programs, A lexicographic pricer for the fractional bin packing problem, ON DUAL APPROACHES TO EFFICIENT OPTIMIZATION OF LP COMPUTABLE RISK MEASURES FOR PORTFOLIO SELECTION, A decomposition approach for the probabilistic maximal covering location-allocation problem, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, A branch-and-price procedure for clustering data that are graph connected, School bus routing—a column generation approach, Scheduling with uncertain processing times in mixed-criticality systems, Route Planning for Robot Systems, Scheduling Personnel Retraining: Column Generation Heuristics, A survey of scheduling with parallel batch (p-batch) processing, Demand-oriented integration optimization of train timetabling and rolling stock circulation planning with flexible train compositions: a column-generation-based approach, Unnamed Item, A branch-and-price approach for the continuous multifacility monotone ordered median problem, Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems, Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms, Timed route approaches for large multi-product multi-step capacitated production planning problems, A decomposition method for large scale MILPs, with performance guarantees and a power system application, Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation, Column-generation based bounds for the homogeneous areas problem
