Pages that link to "Item:Q4530641"

The following pages link to On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm (Q4530641):

Displaying 29 items.

• Converging upon basic feasible solutions through Dantzig-Wolfe decomposition (Q2439505) (← links)
• On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem (Q2468737) (← links)
• A branch-and-price approach for integrating nurse and surgery scheduling (Q2482743) (← links)
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming (Q2494825) (← links)
• A branch-and-price-and-cut approach for sustainable crop rotation planning (Q2629731) (← links)
• Column generation based heuristic for tactical planning in multi-period vehicle routing (Q2643933) (← links)
• Models and algorithms for three-stage two-dimensional bin packing (Q2643961) (← links)
• A new branch-and-price algorithm for the traveling tournament problem (Q2655609) (← links)
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
• Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
• On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage (Q2673804) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• Branch-and-price: Column generation for solving huge integer programs (Q2770133) (← links)
• Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
• Cutting planes for branch-and-price algorithms (Q3113514) (← links)
• Branch and Price for Chance-Constrained Bin Packing (Q3386782) (← links)
• Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem (Q3562403) (← links)
• Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems (Q3621930) (← links)
• Column-Generation in Integer Linear Programming (Q4450558) (← links)
• Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
• Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)
• Using Column Generation to Solve a Coal Blending Problem (Q5247684) (← links)
• Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types (Q5270509) (← links)
• A column generation approach for the split delivery vehicle routing problem (Q5894493) (← links)
• The omnipresence of Lagrange (Q5920487) (← links)
• A hybrid robust-stochastic optimization approach for day-ahead scheduling of cascaded hydroelectric system in restructured electricity market (Q6106511) (← links)
• Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm (Q6106600) (← links)
• A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)
• A modeling and hybridized decomposition approach for the multi-level capacitated lot-sizing problem with setup carryover, backlogging, and emission control (Q6620753) (← links)