scientific article
From MaRDI portal
Publication:3270229
zbMath0093.32704MaRDI QIDQ3270229
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Graph, clique and facet of Boolean logical polytope, Mixed integer formulations using natural variables for single machine scheduling around a common due date, Introduction to QUBO, Mathematical Programming Models and Exact Algorithms, Matroid optimisation problems with nested non-linear monomials in the objective function, An algorithm for indefinite integer quadratic programming, The Boolean quadratic polytope: Some characteristics, facets and relatives, Strong valid inequalities for Boolean logical pattern generation, Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints, Nonlinear 0–1 programming: I. Linearization techniques, Reconstructing convex matrices by integer programming approaches, Advanced network connectivity features and zonal requirements in covering location problems, Inductive linearization for binary quadratic programs with linear constraints, Knapsack problem with probability constraints, Best second order bounds for two-terminal network reliability with dependent edge failures, Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations, A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints, A note on representations of linear inequalities in non-convex mixed-integer quadratic programs, Compact linearization for binary quadratic problems subject to assignment constraints, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, An improved linearization strategy for zero-one quadratic programming problems, A network approach for specially structured linear programs arising in 0-1 quadratic optimization, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Dominance inequalities for scheduling around an unrestrictive common due date, Global solution of non-convex quadratically constrained quadratic programs, Berge-acyclic multilinear 0-1 optimization problems, Quadratic reformulations of nonlinear binary optimization problems, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, A class of valid inequalities for multilinear 0-1 optimization problems, RLT insights into lift-and-project closures, Pseudo-Boolean optimization, A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation, The Multistatic Sonar Location Problem and Mixed-Integer Programming, Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem, An algorithm for the quadratic assignment problem using Benders' decomposition, \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, A binarisation heuristic for non-convex quadratic programming with box constraints, The trunk in the topology of electrical networks, Solving multistatic sonar location problems with mixed-integer programming, A decision model for interdependent information system project selection, Convex hull representations of special monomials of binary variables, Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method, A linearization framework for unconstrained quadratic (0-1) problems, Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem, Matroid optimization problems with monotone monomials in the objective, A new separation algorithm for the Boolean quadric and cut polytopes, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems, ``Miniaturized linearizations for quadratic 0/1 problems
