An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The node capacitated graph partitioning problem: A computational study
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
- Solution of large weighted equicut problems
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- The expected relative error of the polyhedral approximation of the max- cut problem
- On optimization problems in acyclic hypergraphs
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Complexity of local search for Euclidean clustering problems
- Via Minimization with Pin Preassignments and Layer Preference
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
- Bounds for random binary quadratic programs
- Aspects of stability for multicriteria quadratic problems of Boolean programming
- Approximating max-cut under graph-MSO constraints
- The maximum cardinality cut problem in co-bipartite chain graphs
- From Graph Orientation to the Unweighted Maximum Cut
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
- Facets of the balanced (acyclic) induced subgraph polytope
- Building an iterative heuristic solver for a quantum annealer
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
- Probabilistic nonunitary gate in imaginary time evolution
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
- A successive quadratic programming algorithm for SDP relaxation of Max-Bisection
- Two-edge connected spanning subgraphs and polyhedra
- Efficient polynomial-time algorithms for special graph partitioning problems
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- A multiple search operator heuristic for the max-k-cut problem
- Finding the maximum cut by the greedy algorithm
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT
- A technique for speeding up the solution of the Lagrangean dual
- Approximation algorithms
- Algorithm unions for solving discrete optimization problems
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
- Round robin scheduling -- a survey
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- Lifting and separation procedures for the cut polytope
- Engineering branch-and-cut algorithms for the equicut problem
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- Spectral bounds for the maximum cut problem
- Fast Distributed Approximation for Max-Cut
- Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\)
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- New approaches for optimizing over the semimetric polytope
- The inequicut cone
- The equipartition polytope. I: Formulations, dimension and basic facets
- Optimal cuts in graphs and statistical mechanics
- f-flip strategies for unconstrained binary quadratic programming
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- A simple iterative algorithm for maxcut
- A linearization framework for unconstrained quadratic (0-1) problems
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
- Complexity of maximum cut on interval graphs
- The unconstrained binary quadratic programming problem: a survey
- Pseudo-Boolean optimization
- Solving the max-cut problem using eigenvalues
- A discrete filled function algorithm for approximate global solutions of max-cut problems
- On 1-skeleton of the cut polytopes
- Introduction to QUBO
- An effective iterated tabu search for the maximum bisection problem
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- scientific article; zbMATH DE number 4193718 (Why is no real title available?)
- Complexity of maximum cut on interval graphs
- An experimental evaluation of semidefinite programming and spectral algorithms for max cut
- A branch-and-cut algorithm for the equicut problem
- A tight lower bound for a special case of quadratic 0-1 programming
- Experiments in quadratic 0-1 programming
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- A new discrete filled function method for solving large scale max-cut problems
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- Canonical dual approach to solving the maximum cut problem
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Graph partitioning: an updated survey
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Minimizing breaks by maximizing cuts.
- Ising formulations of some graph-theoretic problems in psychological research: models and methods
- New bounds for the -k-cut and chromatic number of a graph
- Speeding up a memetic algorithm for the max-bisection problem
- Maximum cut in fuzzy nature: models and algorithms
- Exact ground states of two-dimensional \(\pm J\) Ising spin glasses
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- A class of spectral bounds for max \(k\)-cut
- Approximating graph-constrained max-cut
- A universal quantum algorithm for weighted maximum cut and Ising problems
- MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems
- Compositions in the bipartite subgraph polytope
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs
- Application of cut polyhedra. I
- Applications of cut polyhedra. II
- A family of spanning-tree formulations for the maximum cut problem
- Randomized heuristics for the Max-Cut problem
- Laplacian eigenvalues and the maximum cut problem
- scientific article; zbMATH DE number 3985121 (Why is no real title available?)
This page was built for publication: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3790963)
