Pages that link to "Item:Q2890465"
From MaRDI portal
The following pages link to Using extra dual cuts to accelerate column generation (Q2890465):
Displaying 41 items.
- Integer linear programming models for the skiving stock problem (Q322686) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Column generation for extended formulations (Q458128) (← links)
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
- A note on branch-and-cut-and-price (Q613321) (← links)
- Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← 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)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- Adding activities to the dual instead of cuts to the primal problem (Q1097165) (← links)
- Exact algorithms for the bin packing problem with fragile objects (Q1662100) (← links)
- Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
- Characterizing the optimality gap and the optimal packings for the bin packing problem (Q2017826) (← links)
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Solving bin packing problems using VRPSolver models (Q2033390) (← 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 lexicographic pricer for the fractional bin packing problem (Q2294394) (← 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)
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming (Q2494825) (← links)
- Models and algorithms for three-stage two-dimensional bin packing (Q2643961) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
- Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
- Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
- Exactly solving a two-level location problem with modular node capacities (Q2892154) (← links)
- New stabilization procedures for the cutting stock problem (Q2899145) (← links)
- Integrated Charge Batching and Casting Width Selection at Baosteel (Q2931698) (← links)
- Dual-Optimal Inequalities for Stabilized Column Generation (Q3391991) (← links)
- Vector Space Decomposition for Solving Large-Scale Linear Programs (Q4971568) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← 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)