Mathematical Programming Models and Exact Algorithms
type: Item
instance of: scholarly article
title: Mathematical Programming Models and Exact Algorithms
zbMATH Open document ID: 1506.90198
DOI: 10.1007/978-3-031-04520-2_6
author: Abraham P. Punnen
author: Renata Sotirov
published in: The Quadratic Unconstrained Binary Optimization Problem
publication date: 2022-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 7616614
zbMATH Keywords: semidefinite programming approaches
zbMATH Keywords: mixed integer linear programming formulations
describes a project that uses: Biq Mac
describes a project that uses: CPLEX
describes a project that uses: BiqCrunch
describes a project that uses: SDPNAL+
describes a project that uses: SCIP
describes a project that uses: Gurobi
MaRDI profile type: Publication
full work available at URL: 978-3-031-04520-2 6
OpenAlex ID: W4285026753
cites work: SCIP: solving constraint integer programs
cites work: On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
cites work: A simple recipe for concise mixed 0-1 linearizations
cites work: Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
cites work: A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
cites work: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
cites work: Handbook on semidefinite, conic and polynomial optimization
cites work: Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
cites work: Experiments in quadratic 0-1 programming
cites work: Q5527032
cites work: Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
cites work: Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
cites work: Upper-bounds for quadratic 0-1 maximization
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Solving Lift-and-Project Relaxations of Binary Integer Programs
cites work: A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems
cites work: The indefinite zero-one quadratic problem
cites work: A new linearization technique for multi-quadratic 0-1 programming problems.
cites work: A Decomposition Method for Quadratic Zero-One Programming
cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables
cites work: Laplacian eigenvalues and the maximum cut problem
cites work: Application of cut polyhedra. I
cites work: Applications of cut polyhedra. II
cites work: Semidefinite programming relaxations for graph coloring and maximal clique problems
cites work: Decomposition and linearization for 0-1 quadratic programming
cites work: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
cites work: Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners
cites work: Q3270229
cites work: Solving VLSI design and DNA sequencing problems using bipartization of graphs
cites work: On the Lovász theta function and some variants
cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
cites work: The Generalized Lattice-Point Problem
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Technical Note—Linearization in 0-1 Variables: A Clarification
cites work: Geometric algorithms and combinatorial optimization
cites work: Computational Experience with Stable Set Relaxations
cites work: A linearization framework for unconstrained quadratic (0-1) problems
cites work: Unconstrained quadratic bivalent programming problem
cites work: Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
cites work: Q3907407
cites work: Q5538300
cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization
cites work: Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
cites work: An improved linearization technique for a class of quadratic 0-1 programming problems
cites work: Approximation of the stability number of a graph via copositive programming
cites work: Fixing Variables in Semidefinite Relaxations
cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: Q3840376

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: The spectral bundle method with second-order information

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: The maximum \(k\)-colorable subgraph problem and orbitopes

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: An algorithm for quadratic zero-one programs

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Improved semidefinite bounding procedure for solving max-cut problems to optimality

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: BiqCrunch

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: The Maximum k-Colorable Subgraph Problem and Related Problems

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Global optimization with polynomials and the problem of moments

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Q4537750

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: A MAX-CUT formulation of 0/1 programs

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: On a positive semidefinite relaxation of the cut polytope

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Connection between semidefinite relaxations of the max-cut and stable set problems

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Compact linearization for binary quadratic problems

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: On the Shannon capacity of a graph

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Q3745276

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: An improved enumerative algorithm for solving quadratic zero-one programming

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Q5202209

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Q3348433

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Q4324980

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: ADMM for the SDP relaxation of the QAP

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: A global continuation algorithm for solving binary quadratic programming problems

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Seizure warning algorithm based on optimization and nonlinear dynamics

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Nonpolyhedral Relaxations of Graph-Bisection Problems

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Bounds for the quadratic assignment problem using the bundle method

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: A comparison of the Delsarte and Lovász bounds

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: A maximum edge-weight clique extraction algorithm based on branch-and-bound

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: A branch-and-cut method for 0-1 mixed convex programming

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Analyzing quadratic unconstrained binary optimization problems via multicommodity flows

Mathematical Programming Models and Exact Algorithms (cites work)
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications