A solvable case of quadratic 0-1 programming
Discrete Applied Mathematics
The construction of test problems in integer-value programming with binary unknowns
USSR Computational Mathematics and Mathematical Physics
Constrained global optimization: algorithms and applications
Constrained global optimization: algorithms and applications
Experiments in quadratic 0-1 programming
Mathematical Programming: Series A and B
Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
Annals of Operations Research
Generation of large-scale quadratic programs for use as global optimization test problems
ACM Transactions on Mathematical Software (TOMS)
A test problem generator for the Steiner problem in graphs
ACM Transactions on Mathematical Software (TOMS)
Test Functions with Variable Attraction Regions for GlobalOptimization Problems
Journal of Global Optimization
A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints
Journal of Global Optimization
Journal of VLSI Signal Processing Systems
ACM Transactions on Mathematical Software (TOMS)
Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming
Computational Optimization and Applications
Global equilibrium search applied to the unconstrained binary quadratic optimization problem
Optimization Methods & Software
An algorithm for nonlinear optimization problems with binary variables
Computational Optimization and Applications
Complexity of uniqueness and local search in quadratic 0-1 programming
Operations Research Letters
A new linearization technique for multi-quadratic 0-1 programming problems
Operations Research Letters
On duality gap in binary quadratic programming
Journal of Global Optimization
Particle Algorithms for Optimization on Binary Spaces
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special Issue on Monte Carlo Methods in Statistics
| Hi-index | 0.00 |
A method of constructing test problems for constrained bivalent quadratic programming is presented. For any feasible integer point for a given domain, the method generates quadratic functions whose minimum over the given domain occurs at the selected point.Certain properties of unconstrained quadratic zero-one programs that determine the difficulty of the test problems are also discussed. In addition, a standardized random test problem generator for unconstrained quadratic zero-one programming is given.