The following pages link to A Primer in Column Generation (Q5493626):
Displaying 50 items.
- A decomposition method for large scale MILPs, with performance guarantees and a power system application (Q259426) (← links)
- Workforce scheduling and routing problems: literature survey and computational study (Q284388) (← links)
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
- Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce (Q323020) (← links)
- Optimized load planning for motorail transportation (Q342294) (← links)
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
- Elective course planning (Q420895) (← links)
- Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods (Q421554) (← links)
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems (Q439646) (← links)
- A robust framework for task-related resident scheduling (Q666983) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- The undirected capacitated arc routing problem with profits (Q975994) (← links)
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (Q976316) (← links)
- Robust crew pairing for managing extra flights (Q1000996) (← links)
- Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
- A decomposition approach for the probabilistic maximal covering location-allocation problem (Q1017444) (← links)
- Planning personnel retraining: column generation heuristics (Q1631648) (← links)
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
- Delay resistant line planning with a view towards passenger transfers (Q1688439) (← links)
- Optimizing railway crew schedules with fairness preferences (Q1707668) (← links)
- Liner shipping service scheduling and cargo allocation (Q1719622) (← links)
- A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem (Q1725600) (← links)
- The dynamic-demand joint replenishment problem with approximated transportation costs (Q1734353) (← links)
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs (Q1734849) (← links)
- A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design (Q1744533) (← links)
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) (← links)
- Integrating rolling stock scheduling with train unit shunting (Q1751830) (← links)
- An optimization approach to designing a baseball scout network (Q1752145) (← links)
- Oil production optimization solved by piecewise linearization in a branch \& price framework (Q1761184) (← links)
- An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007 (Q1761922) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling (Q1991148) (← links)
- Column generation for vehicle routing problems with multiple synchronization constraints (Q1991183) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- Range-constrained traffic assignment with multi-modal recharge for electric vehicles (Q2005853) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
- A column generation approach for an emission-oriented vehicle routing problem on a multigraph (Q2028762) (← links)
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
- A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Demand-oriented integration optimization of train timetabling and rolling stock circulation planning with flexible train compositions: a column-generation-based approach (Q2083942) (← links)
- A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
- Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems (Q2107098) (← links)
- Timed route approaches for large multi-product multi-step capacitated production planning problems (Q2116870) (← links)
- Dynamic gate configurations at airports: a network optimization approach (Q2140303) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- Dynamic constraint aggregation for solving very large-scale airline crew pairing problems (Q2226471) (← links)
- A branch-and-price algorithm for the liner shipping network design problem (Q2226484) (← links)
