 
2/13/2005
 The PBO bibliography is in its starting stage. Further additions to it can
be expected in the subsequent months. To speed up the processing of this
list, please let us know about any unlisted PBO references, or any
mistakes/errors you may find in the current list. 
Bibliography on PBO

Adams
,
W., A. Billionnet and A. Sutter, (1990), "Unconstrained 01
optimization and Lagrangean relaxation", Discrete Appl. Math. 29, pp
131142, December.


Alidaee,
B., G. A. Kochenberger, K. Lewis and M. Lewis, (2004), "Modeling and
solving set packing problems via unconstrained quadratic programming",
Working Paper, May.


AlKhamis,
T. M., M. Hasan and M. A. Ahmed, (1998), "Simulated annealing for the
unconstrained quadratic pseudoBoolean function", Eur. J. Oper. Res.
108(3), pp 641652, August.


AlKhayyal,
F. A. and C. Larsen, (1990), "Global optimization of a quadratic
function subject to a bounded mixed integer constraint set", Ann. Oper.
Res. 25, pp 163168.


Allemand,
K., K. Fukuda, T. M. Liebling and E. Steiner, (2001), "A polynomial
case of unconstrained zeroone quadratic optimization", Math. Program.
91(1), pp 4952.


Amini,
M. M., B. Alidaee and G. A. Kochenberger, (1999), "A scatter search
approach to unconstrained quadratic binary programs", In (Corne, D., M.
Dorigo and F. W. Glover, ed.), New ideas in optimization, McGrawHill, pp
317329.


Balas,
E. and R. Jeroslow, (1972), "Canonical cuts on the unit
hypercube", SIAM J. Appl. Math. 23(1), pp 6169, July.


Barahona,
F., (1986), "A solvable case of quadratic 01 programming",
Discrete Appl. Math. 13(1), pp 2326.


Barahona,
F., M. Grötschel, M. Jünger and G. Reinelt, (1988), "An application
of combinatorial optimization to statistical physics and circuit layout
design.", Oper. Res. 36(3), pp 493513, May/Jun.


Barahona,
F., M. Jünger and G. Reinelt, (1989), "Experiments in quadratic 01
programming", Math. Program. 44, pp 127137.


Beasley,
J. E., (1998), "Heuristic algorithms for the unconstrained binary
quadratic programming problem", Technical Report,
Management
School
,
Imperial
College
,
December.


Billionnet,
A. and A. Faye, (1997), "A lower bound for a constrained quadratic 01
minimization problem", Discrete Appl. Math. 74(2), pp 135146, April.


Billionnet,
A. and A. Sutter, (1994), "Minimization of a quadratic pseudoBoolean
function", Eur. J. Oper. Res. 78(1), pp 106115, October.


Billionnet,
A. and B. Jaumard, (1989), "A decomposition method for minimizing
quadratic pseudoBoolean functions", Oper. Res. Lett. 8(3), pp 161163,
June.


Billionnet,
A. and M. Minoux, (1985), "Maximizing a supermodular pseudoboolean
function: A polynomial algorythm for supermodular cubic functions",
Discrete Appl. Math. 12, pp 111.


Borchers,
B. and J. Furman, (1998), "A twophase exact algorithm for MAXSAT and
weighted MAXSAT problems", Journal of Combinatorial Optimization 2(4),
pp 299306.


Boros,
E. and P. L. Hammer, (1989), "A maxflow approach to improved
roofduality in quadratic 01 minimization", RUTCOR Research Report RRR
151989, RUTCOR 
Rutgers
Center
for Operations Research,
Rutgers
University
,
March.


Boros,
E. and P. L. Hammer, (1993), "Cutpolytopes, Boolean quadric polytopes
and nonnegative quadratic pseudoBoolean functions", Mathematics of
Operations Research 18(1), pp 245253, February.


Boros,
E. and P. L. Hammer, (2002), "PseudoBoolean optimization",
Discrete Appl. Math. 123, pp 155225.


Boros,
E., I. Lari and B. Simeone, (2000), "Block linear majorants in
quadratic 01 optimization", RUTCOR Research Report RRR 182000, RUTCOR
 Rutgers Center for Operations Research, Rutgers University, March.


Boros,
E., P. L. Hammer and X. Sun, (1989), "The DDT method for quadratic 01
optimization", RUTCOR Research Report RRR 391989, RUTCOR  Rutgers
Center for Operations Research, Rutgers University, October.


Boros,
E., P. L. Hammer, M. Minoux, D. J. Rader and Jr., (1998), "Optimal cell
flipping to minimize channel density in VLSI design and pseudoBoolean
optimization", RUTCOR Research Report RRR 31998, RUTCOR  Rutgers
Center for Operations Research, Rutgers University, January.


Boros,
E., Y. Crama and P. L. Hammer, (1990), "Upperbounds for quadratic 01
maximization", Oper. Res. Lett. 9, pp 7379.


Boros,
E., Y. Crama and P. L. Hammer, (1992), "Chvátal cuts and odd cycle
inequalities in quadratic 01 optimization",
SIAM Journal on Discrete Mathematics 5(2), pp 163177, May.


Bourjolly,
J.M., P. Gill, G. Laporte and H. Mercure, (1996), "An exact quadratic
01 algorithm for the stable set problem", In (Johnson, D. S. and M. A.
Trick, ed.), Cliques, coloring, and satisfiability, American Mathematical
Society,
Providence
,
pp 5373.


Bourjolly,
J.M., P. L. Hammer, W. R. Pulleyblank and B. Simeone, (1989),
"Combinatorial methods for bounding quadratic pseudoBoolean
functions", Research Report CORR 8921, Faculty of Mathematics,
University of Waterloo, May.


Bourjolly,
J.M., P. L. Hammer, W. R. Pulleyblank and B. Simeone, (1989),
"Combinatorial methods for bounding quadratic pseudoBoolean
functions", RUTCOR Research Report RRR 271989, RUTCOR  Rutgers Center
for Operations Research, Rutgers University, August.


Bourjolly,
J.M., P. L. Hammer, W. R. Pulleyblank and B. Simeone, (1992),
"Booleancombinatorial bounding of maximum 2satisfiability",
Serie A no. 9, Department of Statistics, "La Sapienza" University.


Carraresi,
P., F. Farinaccio and F. Malucelli, (1995), "Testing optimality for
quadratic 01 problems", Technical Report TR9511, Dipartimento di
Informatica, Universitŕ di Pisa, December.


Carraresi,
P., F. Farinaccio and F. Malucelli, (1999), "Testing optimality for
quadratic 01 problems", Math. Program. 85(2), pp 407421.


Carraresi,
P., F. Malucelli and M. Pappalardo, (1995), "Testing optimality for
quadratic 01 unconstrained problems", ZOR Math. Methods Oper. Res.
42(3), pp 295311.


Carter,
M. W., (1984), "The indefinite zeroone quadratic problem",
Discrete Appl. Math. 7(1), pp 2344, January.


Chakradhar,
S. T. and M. L. Bushnell, (1992), "A solvable class of quadratic 01
programming", Discrete Appl. Math. 36(3), pp 233251, May.


Chardaire,
P. and A. Sutter, (1995), "A decomposition method for quadratic
zeroone programming", Manage. Sci. 41(4), pp 704712.


Crama,
Y. and P. L. Hammer, (2002), "PseudoBoolean optimization", In (Pardalos,
P. M. and M. G. C. Resende, ed.), Handbook of applied optimization, Oxford
University Press, pp 445450.


Crama,
Y., (1993), "Concave extensions for nonlinear 01 maximization
problems", Math. Program. 61, pp 5360.


Crama,
Y., P. Hansen and B. Jaumard, (1990), "The basic algorithm for
pseudoBoolean programming revisited", Discrete Appl. Math. 29, pp
171185.


Crama,
Y., P. L. Hammer and R. Holzman, (1989), "A characterization of a cone
of pseudoBoolean functions via supermodularitytype inequalities.", In
(Kall, P., J. Kohlas, W. Popp and C. A. Zehnder, ed.), Quantitative Methoden
in den Wirtschaftswissenschaften, SpringerVerlag, Berlin, pp 5355.


Crama,
Y., P. L. Hammer and T. Ibaraki, (1986), "Strong unimodularity for
matrices and hypergraphs", Discrete Appl. Math. 15(23), pp 221239.


Crama,
Y., P. L. Hammer, B. Jaumard and B. Simeone, (1987), "Product form
parametric representation of the solutions to a quadratic Boolean
equation", RAIRO Rech. Oper. 21(4), pp 287306, November.


Fraenkel,
A. S. and P. L. Hammer, (1984), " PseudoBoolean functions and their
graphs", Ann. Discrete Math. 20, pp 137146.


Glover,
F. W., B. Alidaee, C. Rego and G. A. Kochenberger, (2000), "Onepass
heuristics for largescale unconstrained binary quadratic problems",
Eur. J. Oper. Res. 137(2), pp 272287, March.


Glover,
F. W., G. A. Kochenberger and B. Alidaee, (1998), "Adaptive memory tabu
search for binary quadratic programs", Manage. Sci. 44(3), pp 336345,
March.


Glover,
F. W., G. A. Kochenberger, B. Alidaee and M. M. Amini, (1998), "Tabu
search with critical event memory: An enhaced application for binary
quadratic programs", In (Voß, S., S. Martello, I. H. Osman and C.
Roucairol, ed.), Metaheuristics: Advancesand trends in local search
paradigms for optimization, Kluwer Academic Publishers, pp 93109.


Gueye,
S. and P. Michelon, (2001), "A linearization framework for
unconstrained quadratic (01) problems", Research Paper, Laboratoire
d'Informatique d'Avignon, Université d'Avignon et des Pays de Vaucluse,
November.


Guignard,
M. and K. Spielberg, (1981), "Logical reduction methods in zeroone
programming: Minimal preferred variables", Oper. Res. 29(1), pp 4974,
Jan.Feb..


Gulati,
V. P., S. K. Gupta and A. K. Mittal, (1984), "Unconstrained quadratic
bivalent programming problem", Eur. J. Oper. Res. 15(1), pp 121125.


Hammer,
P. L. and B. Kalantari, (1987), "A bound on the roof duality gap",
RUTCOR Research Report RRR 461987, RUTCOR 
Rutgers
Center
for Operations Research,
Rutgers
University
,
December.


Hammer,
P. L. and B. Kalantari, (1989), "A bound on the roof duality gap",
Combinatorial Optimization, Lecture Notes in Mathematics 1403, pp 254257.


Hammer,
P. L. and B. Simeone, (1987), "Quadratic functions of binary
variables", RUTCOR Research Report RRR 201987, RUTCOR  Rutgers Center
for Operations Research, Rutgers University.


Hammer,
P. L. and B. Simeone, (1989), "Quadratic functions of binary
variables", Combinatorial Optimization, Lecture Notes in Mathematics
1403, pp 156.


Hammer,
P. L. and P. Hansen, (1981), "Logical relations in quadratic 01
programming", Romanian Journal of Pure and Applied Mathematics 26(3),
pp 421429.


Hammer,
P. L. and R. Holzman, (1992), "Approximations of pseudoBoolean
functions; Applications to game theory", ZOR Math. Methods Oper. Res.
36(1), pp 321.


Hammer,
P. L. and U. N. Peled, (1972), "On the maximization of a pseudoBoolean
function", Journal of the
Association for Computing Machinery 19, pp 265282.


Hammer,
P. L., (1965), "Some network flow problems solved with pseudoBoolean
programming", Oper. Res. 13, pp 388399.


Hammer,
P. L., P. Hansen and B. Simeone, (1984), "Roof duality, complementation
and persistency in quadratic 01 optimization", Math. Program. 28, pp
121155.


Hansen,
P. and B. Jaumard, (1990), "Algorithms for the maximum satisfiabilty
problem", Computing 44, pp 279303.


Hansen,
P., B. Jaumard and C. Meyer, (2000), "A simple enumerative algorithm
for unconstrained 01 quadratic programming", SFB Report No 203,
Department of Mathematics, Graz University of Technology, November.


Hasan,
M., T. M. AlKhamis and J. Ali, (2000), "A comparison between simulated
annealing, genetic algorithm and tabu search methods for the unconstrained
quadratic PseudoBoolean function", Computers & Industrial
Engineering 38(3), pp 323340, October.


Hui,
L. S., (1984), "An improved enumerative algorithm for solving quadratic
zeroone programming", Eur. J. Oper. Res. 15(1), pp 110120, January.


Johnson,
D. S. and M. A. Trick, (1996), Cliques, coloring, and satisfiability,
American Mathematical Society,
Providence
.


Johnson,
E. L. and M. W. Padberg, (1982), "Degreetwo inequalities, clique
facets, and biperfect graphs", Ann. Discrete Math. 16, pp 169187.


Kalantari,
B. and A. Baghchi, (1990), "An algorithm for quadratic zeroone
programs", Nav. Res. Logist. 37, pp 527538.


Kalantari,
B., (1986), "Quadratic functions with exponential number of local
maxima", Oper. Res. Lett. 5(1), pp 4749.


Katayama,
K. and H. Narihisa, (2001), "Performance of simulated annealingbased
heuristic for the unconstrained binary quadratic programming problem",
Eur. J. Oper. Res. 134(1), pp 103119.


Katayama,
K., M. Tani and H. Narihisa, (2000), "Solving large binary quadratic
programming problems by effective genetic local search algorithm",
Proceedings of the 2000 genetic and evolutionary computation conference
(GECCO2000), pp 643650.


Kochenberger,
G. A., F. W. Glover, B. Alidaee and C. Rego, (2003), "An unconstrained
quadratic binary programming approach to the vertex coloring problem",
Working Paper HCES0103, Hearin Center for Enterprise Science, University
of Mississipi, February.


Kochenberger,
G. A., F. W. Glover, B. Alidaee and C. Rego, (2003), "Solving
combinatorial optimization problems via reformulation and adaptive memory
metaheuristics", Working Paper HCES0303, Hearin Center for Enterprise
Science, University of Mississipi, February.


Kochenberger,
G. A., F. W. Glover, B. Alidaee and H. Wang, (2004), "Solving the
maximum edge weight clique problem via unconstrained quadratic
programming", Working Paper HCES0504, Hearin Center for Enterprise
Science, University of Mississipi, July.


Körner,
F., (1988), "A tight bound for the Boolean quadratic optimization
problem and its use in a branch and bound algorithm", Optimization
19(5), pp 711721.


Laughhunn,
D. J., (1970), "Quadratic binary programming with applications to
capital budgeting problems", Oper. Res. 18(3), pp 454461, May/Jun.


Lewis,
M., B. Alidaee and G. A. Kochenberger, (2003), "Modeling and solving
the task allocation problem as an unconstrained quadratic binary
program", Working Paper HCES0903,
Hearin
Center
for Enterprise Science,
University
of
Mississipi
,
December.


Lodi
,
A., K. Allemand and T. M. Liebling, (1999), "An evolutionary heuristic
for quadratic 01 programming", Eur. J. Oper. Res. 119(3), pp 662670,
December.


Lu,
S. H. and A. C. Williams, (1987), "Roof duality for polynomial 01
optimization", Math. Program. 37, pp 357360.


Maaren,
H. v. and J. P. Warners, (2000), "Bounds and fast approximation
algorithms for binary quadratic optimization problems with application to
MAX 2SAT", Discrete Appl. Math. 107(13), pp 225239.


Marichal,
J.L., (2000), "The influence of variables on pseudoBoolean functions
with applications to game theory and multicriteria decision making",
Discrete Appl. Math. 107(13), pp 139164, December.


Merz,
P. and B. Freisleben, (1999), "Genetic algorithms for binary quadratic
programming", Proceedings of the 1999 international genetic and
evolutionary computation conference (GECCO1999), Morgan Kaufman Publishers,
pp 417424.


Merz,
P. and B. Freisleben, (2002), "Greedy and local search heuristics for
the unconstrained binary quadratic programming problem", Journal of
Heuristics 8(2), pp 197213.


Merz,
P. and K. Katayama, (2004), "Memetic algorithms for the unconstrained
binary quadratic programming problem", Bio Systems.


Merz,
P., (2003), "The compact memetic algorithm", Presented at: (WOMA
IV) in Fourth workshop on memetic algorithms,
Chicago
,
United
States of America
.


Padberg,
M. W., (1989), "The Boolean quadric polytope: Some characteristics,
facets and relatives", Math. Program. 45, pp 139172.


Palubeckis,
G. and A. Tomkevičius, (2002), "GRASP implementations for the
uncostrained binary quadratic optimization problem", Information
Technology and Control 3, pp 1420.


Palubeckis,
G., (1990), "Quadratic 01 optimization", Informatica 1(1), pp
89106.


Palubeckis,
G., (1992), "Heuristics with a worstcase bound for unconstrained
quadratic 01 programming", Informatica 3(2), pp 225240.


Palubeckis,
G., (1995), "A heuristicbased branch and bound algorithm for
unconstrained quadratic zeroone programming", Computing 54, pp
283301.


Palubeckis,
G., (2004), "Multistart tabu search strategies for the unconstrained
binary quadratic optimization problem", Ann. Oper. Res. 131, pp
259282, October.


Pardalos,
P. M. and G. P. Rodgers, (1990), "Computational aspects of a branch and
bound algorithm for quadratic zeroone programming", Computing 45, pp
131144.


Pardalos,
P. M. and G. Schnitger, (1988), "Checking local optimality in
constrained quadratic programming is NPhard", Oper. Res. Lett. 7(1),
pp 3335, February.


Pardalos,
P. M. and
S.
Jha
,
(1992), "Complexity of uniqueness and local search in quadratic 01
programming", Oper. Res. Lett. 11(2), pp 119123, March.


Pardalos,
P. M., (1987), "Generation of largescale quadratic programs for use as
global optimization test problems", ACM Transactions on Mathematical
Software 13(2), pp 133137, June.


Pardalos,
P. M., (1991), "Construction of test problems in quadratic bivalent
programming", ACM Transactions on Mathematical Software 17(1), pp
7487, March.


Rosenberg,
I. G., (1974), "Minimization of pseudoBoolean functions by binary
development", Discrete Math. 7, pp 151165.


Sutter,
A. and A. Billionnet, (1992), "Persistency in quadratic 01
optimization", Math. Program. 54, pp 115119.


Williams,
A. C., (1985), "Quadratic 01 programming using the roof dual with
computational results", RUTCOR Research Report RRR 81985, RUTCOR 
Rutgers Center for Operations Research, Rutgers University, December.


Zhang,
H., H. Shen and F. Manyŕ, (2003), "Exact Algorithms for MAXSAT",
Electronic Notes in Theoretical Computer Science 86(1), pp 114, May.

