Pages that link to "Item:Q4371734"
From MaRDI portal
The following pages link to Construction of test problems in quadratic bivalent programming (Q4371734):
Displaying 26 items.
- On duality gap in binary quadratic programming (Q454277) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- An improved linearization technique for a class of quadratic 0-1 programming problems (Q691407) (← links)
- A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
- An algorithm for nonlinear optimization problems with binary variables (Q711384) (← links)
- Unconstrained quadratic bivalent programming problem (Q792219) (← links)
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions (Q985310) (← links)
- Improving directions of negative curvature in an efficient manner (Q1026565) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
- Generating quadratic assignment test problems with known optimal permutations (Q1203071) (← links)
- Test case generators and computational results for the maximum clique problem (Q1310979) (← links)
- A new technique for generating quadratic programming test problems (Q1315416) (← links)
- On the construction of test problems for concave minimization algorithms (Q1342905) (← links)
- The quadratic M-convexity testing problem (Q1701120) (← links)
- On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
- Test problem construction for linear bilevel programming problems (Q1815062) (← links)
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147) (← links)
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems (Q1947625) (← links)
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints (Q2433932) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
- On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)
- Optimality Conditions for the Minimization of Quadratic 0-1 Problems (Q2945127) (← links)
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS (Q3439884) (← links)
- QUBO Software (Q5050151) (← links)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)