Pages that link to "Item:Q1290171"

The following pages link to Exact solution of bin-packing problems using column generation and branch-and-bound (Q1290171):

Displaying 50 items.

• Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
• A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
• An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
• Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
• Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost (Q2168751) (← links)
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
• A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events (Q2242370) (← links)
• Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
• Decomposition methods for the lot-sizing and cutting-stock problems in paper industries (Q2293861) (← 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)
• A branch-and-price algorithm for the two-dimensional vector packing problem (Q2329474) (← links)
• Improved flow-based formulations for the skiving stock problem (Q2333124) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• A three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) (← links)
• Novel formulations and modeling enhancements for the dynamic berth allocation problem (Q2424775) (← links)
• Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485) (← links)
• Fast lifting procedures for the bin packing problem (Q2581316) (← links)
• Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
• Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387) (← links)
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
• Integrated scheduling problem on a single bounded batch machine with an unavailability constraint (Q2657417) (← links)
• Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
• Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
• Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727) (← links)
• An exact framework for the discrete parallel machine scheduling location problem (Q2668759) (← links)
• Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)
• Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
• The fixed-charge shortest-path problem (Q2815469) (← links)
• Column generation for extended formulations (Q2840735) (← links)
• Prospective network flow models and algorithms for bin packing problems (Q2883549) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• Heuristics for determining the number of warehouses for storing non-compatible products (Q3410327) (← links)
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory (Q4646531) (← links)
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
• The Meet-in-the-Middle Principle for Cutting and Packing Problems (Q5137950) (← links)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• Augmented neural networks and problem structure-based heuristics for the bin-packing problem (Q5497425) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
• New heuristics for one-dimensional bin-packing (Q5959374) (← links)