Computers & Operations Research

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem

Geraldo Regis Mauri, Luiz Antônio Nogueira Lorena

Published Sep 13, 2011• 14 citations

Related papers

A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs

Wei-An Chen, Zhen Zhu, Nan Kong

The unconstrained binary quadratic programming problem: a survey

Gary A. Kochenberger, Jin‐Kao Hao, Fred Glover +4 more

Parametric Lagrangian dual for the binary quadratic programming problem

Yong Xia, Wenxun Xing

Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

Kengo Katayama, Hiroyuki Narihisa

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems

Shenshen Gu, Rui Cui, Peng Jiao

A Hybrid Heuristic for Solving Unconstrained Binary Quadratic Programming Problems.

Kien Ming Ng