Extensions on ellipsoid bounds for quadratic integer programming

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Journal of Global Optimization

• Publication date

  2018-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10898-017-0557-2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On global optimization with indefinite quadratics

  2017cited by this paper
• Ellipsoid Bounds for Convex Quadratic Integer Programming

  2015influential reference
• A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations

  2015cited by this paper
• When is rounding allowed in integer nonlinear optimization?

  2014cited by this paper
• An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations

  2013cited by this paper
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

  2011cited by this paper
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

  2011cited by this paper
• An effective branch-and-bound algorithm for convex quadratic integer programming

  2010influential reference
• Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations

  2010cited by this paper
• Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

  2009cited by this paper
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

  2008cited by this paper
• The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems

  2005cited by this paper
• Ellipsoidal Approach to Box-Constrained Quadratic Problems

  2004cited by this paper
• DC Programming: Overview

  1999cited by this paper
• A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

  1998cited by this paper
• A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems

  1998cited by this paper
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

  1995cited by this paper
• A continuous method for computing bounds in integer quadratic optimization problems

  1992cited by this paper
• Cones of Matrices and Set-Functions and 0-1 Optimization

  1991cited by this paper
• Improved methods for calculating vectors of short length in a lattice

  1985cited by this paper
• On the Shannon capacity of a graph

  1979cited by this paper
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

  1976cited by this paper
• Institute for Mathematical Physics Semidefinite Programming versus the Reformulation–linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming Semidefinite Programming versus the Reformulation-linearization Technique for Nonconvex Quadratically Constrained

  year unknowncited by this paper

• 1-bit Massive MIMO Signal Detector Based on Convex Integral Quadratic Programming

  2024cites this paper
• Efficient Local and Tabu Search Strategies for Large-Scale Quadratic Integer Programming

  2024cites this paper
• Preface to the Special Issue “GOW’16”

  2018cites this paper