✦ LIBER ✦

Testing optimality for quadratic 0–1 unconstrained problems

✍ Scribed by Paolo Carraresi; Federico Malucelli; Massimo Pappalardo

Publisher: Springer
Year: 1995
Tongue: English
Weight: 601 KB
Volume: 42
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01432506

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Testing optimality for quadratic 0-1 pro

Testing optimality for quadratic 0-1 problems

✍ Paolo Carraresi; Fernanda Farinaccio; Federico Malucelli 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 109 KB

Global optimality conditions for quadrat

Global optimality conditions for quadratic 0-1 optimization problems

✍ Wei Chen; Liansheng Zhang 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 247 KB

Using a Mixed Integer Quadratic Programm

Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem

✍ Alain Billionnet; Sourour Elloumi 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 148 KB

Optimality criteria for general unconstr

Optimality criteria for general unconstrained geometric programming problems

✍ Tibor Illés 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 393 KB

This paper presents a possible generalization of geometric programming problems. Such a generalization was proposed by Paterson [6], based on Roc.l~eUar's [8] conjugate function theory. Using their results, we define a slightly different, more symmetric dual pair of general unconstrained geometric

Lagrangean methods for 0–1 quadratic pro

Lagrangean methods for 0–1 quadratic problems

✍ Philippe Michelon; Nelson Maculan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 615 KB

“Miniaturized” Linearizations for Quadra

“Miniaturized” Linearizations for Quadratic 0/1 Problems

✍ Serigne Gueye; Philippe Michelon 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 239 KB