scientific article; zbMATH DE number 2159019
From MaRDI portal
zbMath1059.90147MaRDI QIDQ4668573
Michael Jünger, Giovanni Rinaldi, Frauke Liers, Gerhard Reinelt
Publication date: 19 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44)
Related Items
An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization, BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints, On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems, MARLEDA: effective distribution estimation through Markov random fields, QUBO Software, Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations, Speeding up IP-based algorithms for constrained quadratic 0-1 optimization, Increasing the attraction area of the global minimum in the binary optimization problem, Computational study of valid inequalities for the maximum \(k\)-cut problem, SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances, A class of spectral bounds for max \(k\)-cut, Partial Lasserre relaxation for sparse Max-Cut, Quantum Annealing versus Digital Computing, Lifting and separation procedures for the cut polytope, The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>, Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B, Crossing Minimization in Storyline Visualization, Partitioning planar graphs: a fast combinatorial approach for max-cut, A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem, Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches, \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM, Valuated matroid-based algorithm for submodular welfare problem, A framework for solving mixed-integer semidefinite programs, A multiple search operator heuristic for the max-k-cut problem, Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints, Computational Approaches to Max-Cut, Global Approaches for Facility Layout and VLSI Floorplanning, Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations, New approaches for optimizing over the semimetric polytope, Complexity of the weighted max-cut in Euclidean space
Uses Software
