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)- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
- A linearization framework for unconstrained quadratic (0-1) problems
- Maximization of submodular functions: theory and enumeration algorithms
- Decomposition and optimization over cycles in binary matroids
- Facets of the balanced (acyclic) induced subgraph polytope
- A cutting plane algorithm for a clustering problem
- Experiments in quadratic 0-1 programming
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Compositions in the bipartite subgraph polytope
- Facets for the cut cone. I
- Facets for the cut cone. II: Clique-web inequalities
- The node capacitated graph partitioning problem: A computational study
- A technique for speeding up the solution of the Lagrangean dual
- Laplacian eigenvalues and the maximum cut problem
- Node and edge relaxations of the max-cut problem
- Two-edge connected spanning subgraphs and polyhedra
- A branch-and-cut algorithm for the equicut problem
- Minimizing breaks by maximizing cuts.
- Cardinality constrained minimum cut problems: complexity and algorithms.
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Solution of large weighted equicut problems
- An effective iterated tabu search for the maximum bisection problem
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- The maximum cardinality cut problem in co-bipartite chain graphs
- Finding the maximum cut by the greedy algorithm
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs
- A discrete dynamic convexized method for the max-cut problem
- Approximating graph-constrained max-cut
- Application of cut polyhedra. I
- Applications of cut polyhedra. II
- The expected relative error of the polyhedral approximation of the max- cut problem
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- Solving the max-cut problem using eigenvalues
- Intractability of min- and max-cut in streaming graphs
- Exact ground states of two-dimensional \(\pm J\) Ising spin glasses
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
- Greedy differencing edge-contraction heuristic for the max-cut problem
- On computational capabilities of Ising machines based on nonlinear oscillators
- A class of spectral bounds for max \(k\)-cut
- Cuts in undirected graphs. I
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- Ising formulations of some graph-theoretic problems in psychological research: models and methods
- A novel formulation of the max-cut problem and related algorithm
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Approximating max-cut under graph-MSO constraints
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
- Speeding up a memetic algorithm for the max-bisection problem
- Building an iterative heuristic solver for a quantum annealer
- Round robin scheduling -- a survey
- A tight lower bound for a special case of quadratic 0-1 programming
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
- New approaches for optimizing over the semimetric polytope
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT
- The equipartition polytope. I: Formulations, dimension and basic facets
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- Probabilistic nonunitary gate in imaginary time evolution
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- f-flip strategies for unconstrained binary quadratic programming
- A projected gradient algorithm for solving the maxcut SDP relaxation
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- From Graph Orientation to the Unweighted Maximum Cut
- Engineering branch-and-cut algorithms for the equicut problem
- Efficient polynomial-time algorithms for special graph partitioning problems
- Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
- Via Minimization with Pin Preassignments and Layer Preference
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Spectral bounds for the maximum cut problem
- scientific article; zbMATH DE number 3985121 (Why is no real title available?)
- Lifting and separation procedures for the cut polytope
- The unconstrained binary quadratic programming problem: a survey
- Solving VLSI design and DNA sequencing problems using bipartization of graphs
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- scientific article; zbMATH DE number 1058028 (Why is no real title available?)
- Approximation algorithms
- A new discrete filled function method for solving large scale max-cut problems
- Randomized heuristics for the Max-Cut problem
- Bounds for random binary quadratic programs
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- Solving the maxcut problem by the global equilibrium search
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- NP-hardness of the Euclidean Max-Cut problem
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- COMBINATORIAL PHYSICS AND THE PROCESS OF INNOVATION
- Introduction to QUBO
- Fast Distributed Approximation for Max-Cut
- Quantum annealing versus digital computing. An experimental comparison
- Maximum cut parameterized by crossing number
- A multiple search operator heuristic for the max-k-cut problem
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- scientific article; zbMATH DE number 4193718 (Why is no real title available?)
- Aspects of stability for multicriteria quadratic problems of Boolean programming
- Complexity of the weighted max-cut in Euclidean space
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems
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)
