Simple Enhancements of Local Search Methods for the Binary Quadratic Programming Problem

Kengo Katayama, Hiroyuki Narihisa

Published Mar 29, 2002• 0 citations

Related papers

謙吾片山, 洋之成久

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Peter Merz, Bernd Freisleben

Combining Discrete Ellipsoid-Based Search and Branch-and-Cut for Binary Quadratic Programming Problems

Wen-Yang Ku, J. Christopher Beck

A scatter search approach to unconstrained quadratic binary programs

Mohammad M. Amini, Bahram Alidaee, Gary A. Kochenberger

Systems Analysis; Solving unconstrained binary quadratic programming problem by global equilibrium search

Vladimir P. Shylo, Oleg V. Shylo

Solution Methods for General Quadratic Programming Problem with Continuous and Binary Variables: Overview

Nguyen Van Thoai