\texttt{EXPEDIS}: an exact penalty method over discrete sets

DOI10.1016/j.disopt.2021.100622OpenAlexW3125201115MaRDI QIDQ2673244

Angelika Wiegele, Nicolò Gusmeroli

Publication date: 9 June 2022

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.09739

zbMATH Keywords

quadratic programmingsemidefinite programmingcombinatorial optimizationbranch-and-boundexact penalty method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Combinatorial optimization (90C27)

Related Items

BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints, Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B

Uses Software

• SCIP
• CPLEX
• Gurobi
• Biq Mac
• MIQCR-CB
• BiqCrunch

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• The unconstrained binary quadratic programming problem: a survey
• Handbook on semidefinite, conic and polynomial optimization
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• A MAX-CUT formulation of 0/1 programs
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
• Gap inequalities for the cut polytope
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
• An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations
• BiqCrunch
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Branching and bounds tighteningtechniques for non-convex MINLP
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow
• Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
• Handbook of semidefinite programming. Theory, algorithms, and applications