scientific article; zbMATH DE number 3335677
From MaRDI portal
Publication:5613011
zbMath0211.52104MaRDI QIDQ5613011
Publication date: 1970
Full work available at URL: https://eudml.org/doc/104505
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Quadratic functions with exponential number of local maxima, Introduction to QUBO, The Random QUBO, Non-linear integer programming: Sensitivity analysis for branch and bound, A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization, A model for clustering data from heterogeneous dissimilarities, Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem, Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming, Reconstructing convex matrices by integer programming approaches, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, Ellipsoid Bounds for Convex Quadratic Integer Programming, On tail dependence matrices. The realization problem for parametric families, An exact cutting plane method for the Euclidean max-sum diversity problem, A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs, Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations, Extending the QCR method to general mixed-integer programs, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, Global solution of non-convex quadratically constrained quadratic programs, The MIN-cut and vertex separator problem, Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint, The demand weighted vehicle routing problem, Quadratic convex reformulation for quadratic programming with linear on-off constraints, Concave extensions for nonlinear 0-1 maximization problems, Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints, A computational study on the quadratic knapsack problem with multiple constraints, Pseudo-Boolean optimization, The indefinite zero-one quadratic problem, Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems, A language and a program for stating and solving combinatorial problems, A binarisation heuristic for non-convex quadratic programming with box constraints, Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, On simultaneous approximation in quadratic integer programming, Ranking in quadratic integer programming problems, Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations, Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems, Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT, Compact mixed-integer programming formulations in quadratic optimization
