Pages that link to "Item:Q5131729"

The following pages link to Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729):

Displaying 29 items.

• Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
• Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
• A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem (Q2076890) (← links)
• The minimum mean cycle-canceling algorithm for linear programs (Q2076908) (← links)
• Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources (Q2106718) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• Conference scheduling: a clustering-based approach (Q2242187) (← links)
• Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
• A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
• Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
• Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
• Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
• Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems (Q5085995) (← links)
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
• Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows (Q5086013) (← links)
• Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
• Bin Packing Problem with Time Lags (Q5106420) (← links)
• A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)
• Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
• Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks (Q6087570) (← links)
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)