The following pages link to (Q4668573):
Displaying 31 items.
- MARLEDA: effective distribution estimation through Markov random fields (Q290534) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Increasing the attraction area of the global minimum in the binary optimization problem (Q2392132) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (Q2826815) (← links)
- An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization (Q2883644) (← links)
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
- Crossing Minimization in Storyline Visualization (Q2961530) (← links)
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- QUBO Software (Q5050151) (← links)
- Quantum Annealing versus Digital Computing (Q5102052) (← links)
- Complexity of the weighted max-cut in Euclidean space (Q5264746) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
- The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645) (← links)
