Pages that link to "Item:Q5322154"

The following pages link to Selected Topics in Column Generation (Q5322154):

Displaying 50 items.

• Speeding up column generation for robust wireless network planning (Q743642) (← links)
• Chebyshev center based column generation (Q765323) (← links)
• A shortest path-based approach to the multileaf collimator sequencing problem (Q765342) (← links)
• Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
• Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints (Q828768) (← links)
• Combining column generation and constraint programming to solve the tail assignment problem (Q846141) (← links)
• A generalization of column generation to accelerate convergence (Q847856) (← links)
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028) (← links)
• A column generation approach for the rail crew re-scheduling problem (Q869160) (← links)
• The network design problem with relays (Q869627) (← links)
• A column-generation approach for joint mobilization and evacuation planning (Q890000) (← links)
• Scheduling fighter squadron training missions using column generation (Q895772) (← links)
• Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
• A Branch and Price algorithm for the \(k\)-splittable maximum flow problem (Q937408) (← links)
• Pruning in column generation for service vehicle dispatching (Q940899) (← links)
• Aircraft and crew scheduling for fractional ownership programs (Q940904) (← links)
• Column generation in the integral simplex method (Q948677) (← links)
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
• Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
• Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064) (← links)
• An inexact bundle variant suited to column generation (Q1016116) (← links)
• On minimum \(k\)-modal partitions of permutations (Q1018088) (← links)
• The train driver recovery problem-a set partitioning based model and solution method (Q1046697) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• Task assignment with start time-dependent processing times for personnel at check-in counters (Q1617296) (← links)
• Fast approximate \(L_\infty\) minimization: speeding up robust regression (Q1623573) (← links)
• Improving blood products supply through donation tailoring (Q1628111) (← links)
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
• A path-based solution approach for the green vehicle routing problem (Q1634062) (← links)
• Application of optimization for solving a sawing stock problem with a cant sawing pattern (Q1634783) (← links)
• Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network (Q1639274) (← links)
• Branch-and-price approaches for the network design problem with relays (Q1651598) (← links)
• The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
• Vehicle routing with probabilistic capacity constraints (Q1651706) (← links)
• Lane covering with partner bounds in collaborative truckload transportation procurement (Q1652017) (← links)
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows (Q1652285) (← links)
• Exact approaches for the knapsack problem with setups (Q1652523) (← links)
• Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
• Testing probabilistic models of choice using column generation (Q1652625) (← links)
• Accelerating the branch-and-price algorithm using machine learning (Q1653391) (← links)
• Two-dimensional cutting stock problem with sequence dependent setup times (Q1681356) (← links)
• Dynamic constraint and variable aggregation in column generation (Q1683120) (← links)
• Optimization methods for the train unit shunting problem (Q1683138) (← links)
• Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows (Q1694312) (← links)
• A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem (Q1725600) (← links)
• Compatibility of short and long term objectives for dynamic patient admission scheduling (Q1725603) (← links)
• Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
• Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system (Q1730678) (← links)
• The sport teams grouping problem (Q1730756) (← links)