New heuristics for one-dimensional bin-packing
From MaRDI portal
Publication:5959374
DOI10.1016/S0305-0548(00)00082-4zbMath0994.90134OpenAlexW2017450662MaRDI QIDQ5959374
Krzysztof Fleszar, Khalil S. Hindi
Publication date: 30 July 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00082-4
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A particle swarm optimization approach for the bi-objective load balancing problem, A variable neighbourhood search algorithm for the open vehicle routing problem, Bin packing and cutting stock problems: mathematical models and exact algorithms, An effective hybrid algorithm for the problem of packing circles into a larger containing circle, A grouping genetic algorithm with controlled gene transmission for the bin packing problem, A fast two-level variable neighborhood search for the clustered vehicle routing problem, Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function, Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing, Exact and approximate methods for a one-dimensional minimax bin-packing problem, Nature inspired genetic algorithms for hard packing problems, Exact and approximate methods for the score-constrained packing problem, A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts, A simulated annealing hyper-heuristic methodology for flexible decision support, A two-stage packing problem procedure, Efficient algorithms for the offline variable sized bin-packing problem, Worst-case analysis of the subset sum algorithm for bin packing., Solving the one-dimensional bin packing problem with a weight annealing heuristic, Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem, Optimization in Sanger sequencing, Energy efficient spatial TDMA scheduling in wireless networks, Efficient algorithms for real-life instances of the variable size bin packing problem, Variable neighbourhood search: methods and applications, Bin packing problem with conflicts and item fragmentation, The one-dimensional cutting stock problem with sequence-dependent cut losses, A hybrid evolutionary algorithm for the offline Bin Packing Problem, Two heuristics for the one-dimensional bin-packing problem, Variable neighbourhood search: Methods and applications, Heuristics for determining the number of warehouses for storing non-compatible products, Augmented neural networks and problem structure-based heuristics for the bin-packing problem, Modified subset sum heuristics for bin packing, Fast lifting procedures for the bin packing problem
Uses Software
Cites Work
