Evolutionary Computation in Combinatorial Optimization

DOI10.1007/b96499zbMath1177.90439OpenAlexW4205732933MaRDI QIDQ5901735

Jakob Puchinger, Günther R. Raidl, Gabriele Koller

Publication date: 5 May 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b96499

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (10)

Models and algorithms for three-stage two-dimensional bin packing ⋮ A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation ⋮ Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization ⋮ A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems ⋮ Computing minimum cuts by randomized search heuristics ⋮ On Guillotine Separability of Squares and Rectangles. ⋮ A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem ⋮ Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers ⋮ Three-dimensional bin packing problem with variable bin height ⋮ Analysis of distributed genetic algorithms for solving cutting problems

This page was built for publication: Evolutionary Computation in Combinatorial Optimization