Some remarks on quadratic programming with 0-1 variables
Peter L. Hammer, Abraham A. Rubin (1970)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “An efficient method for obtaining sharp bounds for nonlinear boolean programming problems”
Some remarks on quadratic programming with 0-1 variables
On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
Thaï Quynh Phong, Le Thi Hoai An, Pham Dinh Tao (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints
M. Minoux, J. Y. Serreault (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Reformulations in Mathematical Programming: Definitions and Systematics
Leo Liberti (2009)
RAIRO - Operations Research
Similarity:
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts...
Lagrangean decomposition for integer programming : theory and applications
Monique Guignard, Siwhan Kim (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: