Construction of test problems in quadratic bivalent programming

DOI10.1145/103147.103156zbMath0900.65183OpenAlexW2009042960MaRDI QIDQ4371734

Panos M. Pardalos

Publication date: 9 February 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1991-17/

zbMATH Keywords

global optimizationtest problemsinteger quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Quadratic programming (90C20)

Related Items

QUBO Software, On the construction of test problems for concave minimization algorithms, A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming, Optimality Conditions for the Minimization of Quadratic 0-1 Problems, A new penalty parameter for linearly constrained 0--1 quadratic programming problems, Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints, On linearization techniques for budget-constrained binary quadratic programming problems, On duality gap in binary quadratic programming, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Complexity of uniqueness and local search in quadratic 0-1 programming, Generating quadratic assignment test problems with known optimal permutations, An improved linearization technique for a class of quadratic 0-1 programming problems, A new linearization technique for multi-quadratic 0-1 programming problems., An algorithm for nonlinear optimization problems with binary variables, Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions, Lower bound improvement and forcing rule for quadratic binary programming, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, Test problem construction for linear bilevel programming problems, Improving directions of negative curvature in an efficient manner, On linear conic relaxation of discrete quadratic programs, Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems, Test case generators and computational results for the maximum clique problem, CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS, A new technique for generating quadratic programming test problems