Pages that link to "Item:Q5959374"

The following pages link to New heuristics for one-dimensional bin-packing (Q5959374):

Displaying 32 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) (← links)
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing (Q342540) (← links)
• Exact and approximate methods for a one-dimensional minimax bin-packing problem (Q363606) (← links)
• A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) (← links)
• Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
• Nature inspired genetic algorithms for hard packing problems (Q610991) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Two heuristics for the one-dimensional bin-packing problem (Q1018262) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• Modified subset sum heuristics for bin packing (Q1044695) (← links)
• Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
• A fast two-level variable neighborhood search for the clustered vehicle routing problem (Q1652293) (← links)
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
• Energy efficient spatial TDMA scheduling in wireless networks (Q1761130) (← links)
• Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
• Optimization in Sanger sequencing (Q2003583) (← links)
• Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
• A hybrid evolutionary algorithm for the offline Bin Packing Problem (Q2045610) (← links)
• A variable neighbourhood search algorithm for the open vehicle routing problem (Q2378421) (← links)
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245) (← links)
• Efficient algorithms for the offline variable sized bin-packing problem (Q2434654) (← 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)
• Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
• The one-dimensional cutting stock problem with sequence-dependent cut losses (Q2803252) (← links)
• A particle swarm optimization approach for the bi-objective load balancing problem (Q2883645) (← links)
• A two-stage packing problem procedure (Q2968485) (← links)
• Heuristics for determining the number of warehouses for storing non-compatible products (Q3410327) (← links)
• Augmented neural networks and problem structure-based heuristics for the bin-packing problem (Q5497425) (← links)
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
• Algorithms for the bin packing problem with scenarios (Q6646755) (← links)