Search Results - "Quadratic pseudo-boolean functions"
-
1
Quadratic Optimization in 0–1 Variables
ISBN: 1848216564, 9781848216563Published: Hoboken, NJ, USA John Wiley & Sons, Inc 10.07.2014Published in Concepts of Combinatorial Optimization (10.07.2014)“…‐Boolean functions that is relatively rare in optimization. The chapter examines a formulation of the problem of maximizing a quadratic pseudo‐Boolean functions (qpBf…”
Get full text
Book Chapter -
2
An exact method based on Lagrangian decomposition for the 0–1 quadratic knapsack problem
ISSN: 0377-2217, 1872-6860Published: Amsterdam Elsevier B.V 16.09.2004Published in European journal of operational research (16.09.2004)“…The 0–1 quadratic knapsack problem (QKP) consists in maximizing a quadratic pseudo-Boolean function with positive coefficients subject to a linear capacity constraint…”
Get full text
Journal Article -
3
0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization
ISSN: 1052-6234, 1095-7189Published: Philadelphia Society for Industrial and Applied Mathematics 01.01.2012Published in SIAM journal on optimization (01.01.2012)“…This paper presents an exact solution method based on a new linearization scheme for the 0-1 quadratic knapsack problem, which consists of maximizing a quadratic pseudo-Boolean function…”
Get full text
Journal Article -
4
Best reduction of the quadratic semi-assignment problem
ISSN: 0166-218X, 1872-6771Published: Lausanne Elsevier B.V 2001Published in Discrete Applied Mathematics (2001)“…We consider the quadratic semi-assignment problem in which we minimize a quadratic pseudo-Boolean function F subject to the semi-assignment constraints…”
Get full text
Journal Article -
5
A polyhedral approach for a constrained quadratic 0–1 problem
ISSN: 0166-218X, 1872-6771Published: Elsevier B.V 01.08.2005Published in Discrete Applied Mathematics (01.08.2005)“…In this paper we consider the problem of optimizing a quadratic pseudo-Boolean function subject to the cardinality constraint ∑ 1 ⩽ i ⩽ n x…”
Get full text
Journal Article -
6
A new upper bound for the 0-1 quadratic knapsack problem
ISSN: 0377-2217, 1872-6860Published: Amsterdam Elsevier B.V 01.02.1999Published in European journal of operational research (01.02.1999)“…The 0-1 quadratic knapsack problem (QKP) consists in maximizing a positive quadratic pseudo-Boolean function subject to a linear capacity constraint…”
Get full text
Journal Article -
7
Linear programming for the 0–1 quadratic knapsack problem
ISSN: 0377-2217, 1872-6860Published: Amsterdam Elsevier B.V 19.07.1996Published in European journal of operational research (19.07.1996)“…In this paper we consider the quadratic knapsack problem which consists in maximizing a positive quadratic pseudo-Boolean function subject to a linear capacity constraint…”
Get full text
Journal Article -
8
A lower bound for a constrained quadratic 0–1 minimization problem
ISSN: 0166-218X, 1872-6771Published: Elsevier B.V 18.04.1997Published in Discrete Applied Mathematics (18.04.1997)“… In this paper we consider the problem of minimizing a quadratic pseudo- Boolean function subject to the cardinality constraint ∑ i = 1, n x…”
Get full text
Journal Article -
9
The structure and solution of various quadratic pseudo-Boolean optimization problems
ISBN: 0591496577, 9780591496574Published: ProQuest Dissertations & Theses 01.01.1997“… the optimization of a quadratic pseudo-Boolean function subject to a linear inequality. First, we consider the structure of the polytope that arises from a linearization of the quadratic 0-1 knapsack problem…”
Get full text
Dissertation

