Pages that link to "Item:Q2883638"
From MaRDI portal
The following pages link to Column generation based primal heuristics (Q2883638):
Displaying 48 items.
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- The discrete time window assignment vehicle routing problem (Q319363) (← links)
- A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637) (← links)
- Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce (Q323020) (← links)
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- Optimal Physician assignment and patient demand allocation in an outpatient care network (Q342387) (← links)
- A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
- A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks (Q490218) (← links)
- A new heuristic branching scheme for the crew pairing problem with base constraints (Q1652206) (← links)
- Variable neighborhood search accelerated column generation for the nurse rostering problem (Q1687629) (← links)
- Delay resistant line planning with a view towards passenger transfers (Q1688439) (← links)
- Column generation based primal heuristics for routing and loading problems (Q1742212) (← links)
- A technical review of column generation in integer programming (Q1863851) (← links)
- Column generation for vehicle routing problems with multiple synchronization constraints (Q1991183) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing (Q2027048) (← links)
- An efficient column generation approach for practical railway crew scheduling with attendance rates (Q2030362) (← links)
- On the benchmark instances for the bin packing problem with conflicts (Q2056901) (← links)
- Generalized relax-and-fix heuristic (Q2108128) (← links)
- The min-max close-enough arc routing problem (Q2116901) (← links)
- Distributed integral column generation for set partitioning problems (Q2139355) (← links)
- A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering (Q2173057) (← links)
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
- An exact approach for the personnel task rescheduling problem with task retiming (Q2242295) (← links)
- Directed weighted improper coloring for cellular channel allocation (Q2255043) (← links)
- The distance constrained multiple vehicle traveling purchaser problem (Q2256245) (← links)
- Column-generation based bounds for the homogeneous areas problem (Q2356280) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- A comparison of integer programming models for the partial directed weighted improper coloring problem (Q2414468) (← links)
- Formulations for a problem of petroleum transportation (Q2514812) (← links)
- A branch-and-price-and-cut approach for sustainable crop rotation planning (Q2629731) (← links)
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
- The one-dimensional cutting stock problem with sequence-dependent cut losses (Q2803252) (← links)
- The split delivery capacitated team orienteering problem (Q2811321) (← links)
- Solutions diversification in a column generation algorithm (Q2865859) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
- Bin Packing Problem with Time Lags (Q5106420) (← links)
- Integral Column Generation for Set Partitioning Problems with Side Constraints (Q5106424) (← links)
- Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
- Primal Heuristics for Branch-and-Price Algorithms (Q5176283) (← links)
- An integer programming column generation principle for heuristic search methods (Q6066729) (← links)
- A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles (Q6067894) (← links)
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
- Adaptive solution prediction for combinatorial optimization (Q6112875) (← links)
- Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints (Q6168597) (← links)
- Two extended formulations for the virtual network function placement and routing problem (Q6179721) (← links)
- An improved column-generation-based matheuristic for learning classification trees (Q6561222) (← links)