Pages that link to "Item:Q3391991"

The following pages link to Dual-Optimal Inequalities for Stabilized Column Generation (Q3391991):

Displaying 38 items.

• Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
• Integer linear programming models for the skiving stock problem (Q322686) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
• A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• Chebyshev center based column generation (Q765323) (← 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 stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
• On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
• Stabilized column generation (Q1297485) (← links)
• Characterizing the optimality gap and the optimal packings for the bin packing problem (Q2017826) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
• Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
• A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• New developments in the primal-dual column generation technique (Q2253404) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities (Q2362175) (← links)
• Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
• Interior point stabilization for column generation (Q2465956) (← links)
• A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)
• Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
• Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
• The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
• Reductions of approximate linear programs for network revenue management (Q2797458) (← links)
• Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times (Q2830951) (← links)
• New stabilization procedures for the cutting stock problem (Q2899145) (← links)
• Integrated Charge Batching and Casting Width Selection at Baosteel (Q2931698) (← links)
• Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
• Vector Space Decomposition for Solving Large-Scale Linear Programs (Q4971568) (← links)
• Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management (Q5058047) (← links)
• Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows (Q5086013) (← links)
• Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429) (← links)