Work

Complete Solutions to Mixed Integer Programming

Year: 2013
Type: article
Abstract: This paper considers a new canonical duality theory for solving mixed integer quadratic programming problem. It shows that this well-known NP-hard problem can be converted into concave maximization dual problems without duality gap. And the dual problems can be solved, under certain conditions, by polynomial algorithms.
Author: Ning Ruan
Language: English
Open Access status: gold
Estimated APC paid: $599
OpenAlex ID: W1990358938
FWCI: 0.587
Cites: 24
Cited by: 2
Related to: 10