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

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Operations Research Letters

• Publication date

  2015-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.orl.2015.05.001
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• TRUST REGION METHODS

  2017cited by this paper
• A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation

  2014cited by this paper
• The generalized trust region subproblem

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

  2013cited by this paper
• Semidefinite relaxations for non-convex quadratic mixed-integer programming

  2012cited by this paper
• Reduced RLT representations for nonconvex polynomial programming problems

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

  1998cited by this paper
• A recipe for semidefinite relaxation for (0,1)-quadratic programming

  1995cited by this paper
• Generalizations of the trust region problem

  1993cited by this paper

• Using dual relaxations in multiobjective mixed-integer convex quadratic programming

  2024cites this paper
• A decision space algorithm for multiobjective convex quadratic integer optimization

  2021cites this paper
• The State Interval Estimation Based on Ellipsoid Minkowski Sum and Intersection

  2019cites this paper
• Extensions on ellipsoid bounds for quadratic integer programming

  2018cites this paper
• An Algorithm for Integer Least-squares with Equality, Sparsity and Rank Constraints

  2018cites this paper
• Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability

  2017cites this paper
• Extensions on ellipsoid bounds for quadratic integer programming

  2017cites this paper