Pages that link to "Item:Q2892273"

The following pages link to A Set-Covering-Based Heuristic Approach for Bin-Packing Problems (Q2892273):

Displaying 29 items.

• A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem (Q299777) (← links)
• A single machine scheduling problem with two-dimensional vector packing constraints (Q319018) (← links)
• An optimization-based heuristic for the machine reassignment problem (Q338859) (← links)
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing (Q342540) (← links)
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing (Q610979) (← links)
• The multiple container loading cost minimization problem (Q635154) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints (Q729798) (← links)
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
• Bidimensional packing by bilinear programming (Q1016113) (← links)
• Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
• Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
• Space defragmentation for packing problems (Q1926954) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time Windows (Q2070117) (← links)
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
• Adaptive simulated annealing with greedy search for the circle bin packing problem (Q2147115) (← links)
• Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)
• A branch-and-price algorithm for the two-dimensional vector packing problem (Q2329474) (← links)
• A new exact method for the two-dimensional bin-packing problem with fixed orientation (Q2467477) (← links)
• A variable neighborhood descent approach for the two-dimensional bin packing problem (Q2631240) (← links)
• Models and algorithms for three-stage two-dimensional bin packing (Q2643961) (← links)
• Hybrid approach for the two-dimensional bin packing problem with two-staged patterns (Q2811942) (← links)
• HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS (Q2998846) (← 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)
• A metaheuristic framework for nonlinear capacitated covering problems (Q5963698) (← links)
• An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)