Pages that link to "Item:Q3790963"

The following pages link to An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design (Q3790963):

Displaying 50 items.

• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• The maximum cardinality cut problem in co-bipartite chain graphs (Q1698075) (← links)
• Finding the maximum cut by the greedy algorithm (Q1711379) (← links)
• A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
• A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
• Approximating graph-constrained max-cut (Q1800989) (← links)
• Application of cut polyhedra. I (Q1891019) (← links)
• Applications of cut polyhedra. II (Q1891020) (← links)
• The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)
• An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
• Solving the max-cut problem using eigenvalues (Q1900149) (← links)
• Intractability of min- and max-cut in streaming graphs (Q1944060) (← links)
• Exact ground states of two-dimensional \(\pm J\) Ising spin glasses (Q1946872) (← links)
• A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section (Q1954820) (← links)
• Greedy differencing edge-contraction heuristic for the max-cut problem (Q2060537) (← links)
• On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
• A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
• Cuts in undirected graphs. I (Q2215599) (← links)
• Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
• Ising formulations of some graph-theoretic problems in psychological research: models and methods (Q2244634) (← links)
• A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
• Approximating max-cut under graph-MSO constraints (Q2294245) (← links)
• Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
• Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• Round robin scheduling -- a survey (Q2475809) (← links)
• A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
• Approximation algorithms for the bi-criteria weighted MAX-CUT problem (Q2499589) (← links)
• Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm (Q2500052) (← links)
• A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
• A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem (Q2569153) (← links)
• New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
• A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592) (← links)
• The equipartition polytope. I: Formulations, dimension and basic facets (Q2639779) (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
• Probabilistic nonunitary gate in imaginary time evolution (Q2690483) (← links)
• A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
• A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188) (← links)
• Computational methods for solving nonconvex block-separable constrained quadratic problems (Q2810546) (← links)
• From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
• Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
• Efficient polynomial-time algorithms for special graph partitioning problems (Q2877347) (← links)
• Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA (Q3057146) (← links)
• Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718) (← links)
• Via Minimization with Pin Preassignments and Layer Preference (Q3197850) (← links)
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
• Spectral bounds for the maximum cut problem (Q3632965) (← links)
• Approximation algorithms (Q4374975) (← links)