"Polynomial time solvable algorithms to binary quadratic programming ..."

Shenshen Gu (2010)

> Home

Details and statistics

DOI: 10.1109/WCSP.2010.5632199

access: closed

type: Conference or Workshop Paper

metadata version: 2017-11-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wcsp/Gu10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wcsp/Gu10
Shenshen Gu:
Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix. WCSP 2010: 1-5

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.