Pages that link to "Item:Q1970365"

The following pages link to Computational study of a column generation algorithm for bin packing and cutting stock problems (Q1970365):

Displaying 50 items.

• A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
• A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637) (← links)
• Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
• A branch and price algorithm for the pharmacy duty scheduling problem (Q342397) (← links)
• A branch and price approach for deployment of multi-tier software services in clouds (Q342499) (← links)
• Improving fleet utilization for carriers by interval scheduling (Q439488) (← links)
• Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
• On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
• Branching in branch-and-price: A generic scheme (Q652288) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
• New bin packing fast lower bounds (Q883309) (← links)
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
• An inexact bundle variant suited to column generation (Q1016116) (← links)
• On column generation formulations for the RWA problem (Q1025995) (← links)
• Knapsack problems with setups (Q1041933) (← links)
• Modified subset sum heuristics for bin packing (Q1044695) (← links)
• A branch-and-price algorithm for solving the cutting strips problem (Q1364894) (← links)
• Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
• Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
• Evaluation of algorithms for one-dimensional cutting (Q1603317) (← links)
• Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
• Tolerance analysis for 0-1 knapsack problems (Q1751719) (← links)
• Layout optimisation for an installation port of an offshore wind farm (Q1751774) (← links)
• Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds (Q1751896) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
• LP models for bin packing and cutting stock problems (Q1847189) (← links)
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths (Q1847193) (← links)
• Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
• Ranking lower bounds for the bin-packing problem (Q1887861) (← links)
• Two-dimensional knapsack-block packing problem (Q1984921) (← links)
• Characterizing the optimality gap and the optimal packings for the bin packing problem (Q2017826) (← links)
• A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows (Q2434985) (← links)
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
• Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets (Q2488902) (← links)
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming (Q2494825) (← links)
• One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214) (← links)
• Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
• Fast lifting procedures for the bin packing problem (Q2581316) (← links)
• Column generation based heuristic for tactical planning in multi-period vehicle routing (Q2643933) (← links)
• A note on the approximability of cutting stock problems (Q2643962) (← links)
• Alternative configurations for cutting machines in a tube cutting mill (Q2643969) (← links)
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
• Arc-flow approach for single batch-processing machine scheduling (Q2669497) (← links)