Mathematical Programming Models and Exact Algorithms (Q5050146)

scientific article; zbMATH DE number 7616614

Language	Label	Description	Also known as
English	Mathematical Programming Models and Exact Algorithms	scientific article; zbMATH DE number 7616614

Statements

instance of

scholarly article

0 references

title

Mathematical Programming Models and Exact Algorithms (English)

0 references

zbMATH Open document ID

1506.90198

0 references

DOI

10.1007/978-3-031-04520-2_6

0 references

0 references

0 references

The Quadratic Unconstrained Binary Optimization Problem

0 references

publication date

15 November 2022

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

semidefinite programming approaches

0 references

mixed integer linear programming formulations

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-04520-2_6

0 references

OpenAlex ID

W4285026753

0 references

cites work

SCIP: solving constraint integer programs

0 references

On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems

0 references

A simple recipe for concise mixed 0-1 linearizations

0 references

Base-2 Expansions for Linearizing Products of Functions of Discrete Variables

0 references

A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems

0 references

A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems

0 references

Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs

0 references

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

0 references

Handbook on semidefinite, conic and polynomial optimization

0 references

Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem

0 references

Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems

0 references

Experiments in quadratic 0-1 programming

0 references

Q5527032

0 references

Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review

0 references

Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem

0 references

Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations

0 references

Upper-bounds for quadratic 0-1 maximization

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

Solving Lift-and-Project Relaxations of Binary Integer Programs

0 references

A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems

0 references

The indefinite zero-one quadratic problem

0 references

A new linearization technique for multi-quadratic 0-1 programming problems.

0 references

A Decomposition Method for Quadratic Zero-One Programming

0 references

On the Significance of Solving Linear Programming Problems with Some Integer Variables

0 references

Laplacian eigenvalues and the maximum cut problem

0 references

Application of cut polyhedra. I

0 references

Applications of cut polyhedra. II

0 references

Semidefinite programming relaxations for graph coloring and maximal clique problems

0 references

Decomposition and linearization for 0-1 quadratic programming

0 references

Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition

0 references

Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners

0 references

Q3270229

0 references

Solving VLSI design and DNA sequencing problems using bipartization of graphs

0 references

On the Lovász theta function and some variants

0 references

Improved Linear Integer Programming Formulations of Nonlinear Integer Problems

0 references

The Generalized Lattice-Point Problem

0 references

Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program

0 references

Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Technical Note—Linearization in 0-1 Variables: A Clarification

0 references

Geometric algorithms and combinatorial optimization

0 references

Computational Experience with Stable Set Relaxations

0 references

A linearization framework for unconstrained quadratic (0-1) problems

0 references

Unconstrained quadratic bivalent programming problem

0 references

Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

0 references

Q3907407

0 references

Q5538300

0 references

Roof duality, complementation and persistency in quadratic 0–1 optimization

0 references

Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem

0 references

An improved linearization technique for a class of quadratic 0-1 programming problems

0 references

Approximation of the Stability Number of a Graph via Copositive Programming

0 references

Fixing Variables in Semidefinite Relaxations

0 references

Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

0 references

A Spectral Bundle Method for Semidefinite Programming

0 references

Q3840376

0 references

The spectral bundle method with second-order information

0 references

\texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM

0 references

The maximum \(k\)-colorable subgraph problem and orbitopes

0 references

Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry

0 references

An algorithm for quadratic zero-one programs

0 references

Improved semidefinite bounding procedure for solving max-cut problems to optimality

0 references

BiqCrunch

0 references

The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems

0 references

Global Optimization with Polynomials and the Problem of Moments

0 references

Q4537750

0 references

A MAX-CUT formulation of 0/1 programs

0 references

A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming

0 references

On a positive semidefinite relaxation of the cut polytope

0 references

Connection between semidefinite relaxations of the max-cut and stable set problems

0 references

An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach

0 references

Compact linearization for binary quadratic problems

0 references

On the Shannon capacity of a graph

0 references

Q3745276

0 references

Cones of Matrices and Set-Functions and 0–1 Optimization

0 references

An improved enumerative algorithm for solving quadratic zero-one programming

0 references

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem

0 references

Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

0 references

Q5202209

0 references

Q3348433

0 references

Q4324980

0 references

ADMM for the SDP relaxation of the QAP

0 references

A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems

0 references

The Boolean quadratic polytope: Some characteristics, facets and relatives

0 references

A global continuation algorithm for solving binary quadratic programming problems

0 references

Computational aspects of a branch and bound algorithm for quadratic zero- one programming

0 references

Seizure warning algorithm based on optimization and nonlinear dynamics

0 references

Nonpolyhedral Relaxations of Graph-Bisection Problems

0 references

Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems

0 references

Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

0 references

Bounds for the quadratic assignment problem using the bundle method

0 references

A comparison of the Delsarte and Lovász bounds

0 references

A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

0 references

A maximum edge-weight clique extraction algorithm based on branch-and-bound

0 references

A branch-and-cut method for 0-1 mixed convex programming

0 references

SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)

0 references

Analyzing quadratic unconstrained binary optimization problems via multicommodity flows

0 references

Handbook of semidefinite programming. Theory, algorithms, and applications

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5050146