Evolutionary Computation in Combinatorial Optimization
From MaRDI portal
Publication:5901738
DOI10.1007/b96499zbMath1177.90424OpenAlexW4205732933MaRDI QIDQ5901738
Thomas Stützle, Susana Isabel Fernandes
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
Integer programming (90C10) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
A survey for the quadratic assignment problem ⋮ Generating new test instances by evolving in instance space ⋮ Generating QAP instances with known optimum solution and additively decomposable cost function ⋮ What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO ⋮ Measuring instance difficulty for combinatorial optimization problems
Uses Software
This page was built for publication: Evolutionary Computation in Combinatorial Optimization
