Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Global Optimization

Parametric Lagrangian dual for the binary quadratic programming problem

Yong Xia, Wenxun Xing

Published Feb 26, 2014• 4 citations
Publisher
DOI
10.1007/s10898-014-0164-4

Related papers

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem

Geraldo Regis Mauri, Luiz Antônio Nogueira Lorena

Computers & Operations Research•Sep 13, 2011•14 citations

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

Wei-An Chen, Zhen Zhu, Nan Kong

Optimization Letters•Mar 8, 2017•4 citations

An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions

Xuewen Mu, Wenlong Liu

Optimization Letters•Mar 18, 2015•1 citation

The unconstrained binary quadratic programming problem: a survey

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

Journal of Combinatorial Optimization•Apr 17, 2014•540 citations

Approximation Algorithm for A Mixed Binary Quadratically Constrained Quadratic Programming Problem

Zi Li Xu, Mingyi Hong

•Jan 1, 2015•1 citation

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

謙吾 片山, 洋之 成久

岡山理科大学紀要. A, 自然科学•Jan 1, 2001•0 citations