Pages that link to "Item:Q5322154"

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

Displaying 50 items.

• 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)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Branch-and-price-and-cut for a service network design and hub location problem (Q1752143) (← links)
• A multi-item approach to repairable stocking and expediting in a fluctuating demand environment (Q1752175) (← links)
• Heuristics for multi-item two-echelon spare parts inventory control subject to aggregate and individual service measures (Q1752179) (← links)
• Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
• A new cross decomposition method for stochastic mixed-integer linear programming (Q1752218) (← links)
• A column generation approach to high school timetabling modeled as a multicommodity flow problem (Q1752250) (← links)
• A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals (Q1753439) (← links)
• A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems (Q1753575) (← links)
• A specialized primal-dual interior point method for the plastic truss layout optimization (Q1756573) (← links)
• Decomposition-based inner- and outer-refinement algorithms for global optimization (Q1756777) (← links)
• Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans (Q1761229) (← links)
• An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007 (Q1761922) (← links)
• Decomposition theorems for linear programs (Q1785306) (← links)
• Real-time freight locomotive rescheduling and uncovered train detection during disruption (Q1926901) (← links)
• A prototype column generation strategy for the multiple container loading problem (Q1926980) (← links)
• A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks (Q1935910) (← links)
• Air cargo scheduling: integrated models and solution procedures (Q1944877) (← links)
• An efficient approach to solve the large-scale semidefinite programming problems (Q1955162) (← links)
• An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
• Dynamic job assignment: a column generation approach with an application to surgery allocation (Q1991107) (← links)
• An exact branch-and-price algorithm for scheduling rescue units during disaster response (Q1991141) (← links)
• Column generation for vehicle routing problems with multiple synchronization constraints (Q1991183) (← links)
• The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling (Q1999394) (← links)
• Using branch-and-price to determine optimal treatment plans for volumetric modulated arc therapy (VMAT) (Q2002839) (← links)
• Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
• A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach (Q2027023) (← links)
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
• A branch-cut-and-price algorithm for optimal decoding in digital communication systems (Q2052394) (← links)
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
• A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
• New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
• Fast quantum subroutines for the simplex method (Q2061891) (← links)
• Scheduling heterogeneous delivery tasks on a mixed logistics platform (Q2076846) (← links)
• Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
• An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• On decomposition and multiobjective-based column and disjunctive cut generation for MINLP (Q2129200) (← links)
• Electric bus planning \& scheduling: a review of related problems and methodologies (Q2140186) (← links)
• A supervised learning-driven heuristic for solving the facility location and production planning problem (Q2140228) (← links)
• The vehicle allocation problem: alternative formulation and branch-and-price method (Q2147070) (← links)
• Branch-and-cut-and-price for multi-agent path finding (Q2147092) (← links)
• Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
• Feeder routing for air-to-air refueling operations (Q2171624) (← links)
• A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering (Q2173057) (← links)
• The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)