Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
From MaRDI portal
Publication:2627686
DOI10.1504/IJOR.2016.075647zbMath1362.90308MaRDI QIDQ2627686
Gary A. Kochenberger, Mark Lewis
Publication date: 31 May 2017
Published in: International Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijor.2016.075647
design of experiments; local search; benchmark problems; path relinking; preprocessing; UBQP; multi-start heuristics; perturbation sampling; DOE; probabilistic multistart; solution perturbation; unconstrained binary quadratic problem
90C06: Large-scale problems in mathematical programming
90C10: Integer programming
90C20: Quadratic programming
Related Items