NDLI: Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix

Content Provider	IEEE Xplore Digital Library
Author	Shenshen Gu Rui Cui
Copyright Year	2014
Description	Author affiliation: Sch. of Mechatron. Eng. & Autom., Shanghai Univ., Shanghai, China (Shenshen Gu; Rui Cui)
Abstract	Binary quadratic programming (BQP) is a typical integer programming problem widely applied in the field of signal processing, economy, management and engineering. However, it's NP-hard and lacks efficient algorithms. Due to this reason, in this paper, a novel polynomial algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix is focused by combining the basic algorithm proposed in [1], [2], [3] and the dynamic programming method. We first briefly deduce the basic algorithm. Then, the algorithm is proposed to solve this special problem. In addition, a specific example is presented to illustrate the new algorithm. Lastly, we demonstrate its polynomial feature as well as its high efficiency.
Starting Page	366
Ending Page	372
File Size	598548
Page Count	7
File Format	PDF
ISBN	9781479936496
e-ISBN	9781479936502
DOI	10.1109/ICICIP.2014.7010280
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-08-18
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Heuristic algorithms Signal processing algorithms Educational institutions Polynomials Dynamic programming Quadratic programming
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix

A sequential quadratic programming algorithm for discrete optimal control problems with control inequality constraints

Compressing ECG signals by piecewise polynomial approximation

On polynomial-approximated solutions to the film copy deliverer problem

Implementation of Dynamic Matrix Control on FPGA

A multiplicative update algorithm for nonnegative convex polyhedral cone learning

A polynomial time algorithm for optimizing join queries

∈-entropy of piecewise polynomial functions and tree partitioning compression

The design of optimal DFT algorithms using dynamic programming

Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix

Similar Documents

Polynomial time solvable algorithms to binary quadratic programming problems with Q being a tri-diagonal or five-diagonal matrix

A sequential quadratic programming algorithm for discrete optimal control problems with control inequality constraints

Compressing ECG signals by piecewise polynomial approximation

On polynomial-approximated solutions to the film copy deliverer problem

Implementation of Dynamic Matrix Control on FPGA

A multiplicative update algorithm for nonnegative convex polyhedral cone learning

A polynomial time algorithm for optimizing join queries

∈-entropy of piecewise polynomial functions and tree partitioning compression

The design of optimal DFT algorithms using dynamic programming

Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix