Pages that link to "Item:Q3790963"

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

Displayed 50 items.

• The inequicut cone (Q688255) ‎ (← links)
• Pseudo-Boolean optimization (Q697569) ‎ (← links)
• An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) ‎ (← links)
• Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) ‎ (← links)
• A successive quadratic programming algorithm for SDP relaxation of Max-Bisection (Q933068) ‎ (← links)
• A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) ‎ (← links)
• Maximum cut in fuzzy nature: models and algorithms (Q964947) ‎ (← links)
• A new branch and bound method with pretreatment for the binary quadratic programming (Q990519) ‎ (← links)
• Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) ‎ (← links)
• A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949) ‎ (← links)
• A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) ‎ (← links)
• Maximization of submodular functions: theory and enumeration algorithms (Q1027590) ‎ (← links)
• Decomposition and optimization over cycles in binary matroids (Q1089347) ‎ (← links)
• Facets of the balanced (acyclic) induced subgraph polytope (Q1122491) ‎ (← links)
• A cutting plane algorithm for a clustering problem (Q1122492) ‎ (← links)
• Experiments in quadratic 0-1 programming (Q1123806) ‎ (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) ‎ (← links)
• Compositions in the bipartite subgraph polytope (Q1199475) ‎ (← links)
• Facets for the cut cone. I (Q1199749) ‎ (← links)
• Facets for the cut cone. II: Clique-web inequalities (Q1199750) ‎ (← links)
• The node capacitated graph partitioning problem: A computational study (Q1290618) ‎ (← links)
• A technique for speeding up the solution of the Lagrangean dual (Q1315429) ‎ (← links)
• Laplacian eigenvalues and the maximum cut problem (Q1319025) ‎ (← links)
• Node and edge relaxations of the max-cut problem (Q1319044) ‎ (← links)
• Two-edge connected spanning subgraphs and polyhedra (Q1330901) ‎ (← links)
• A branch-and-cut algorithm for the equicut problem (Q1373750) ‎ (← links)
• Minimizing breaks by maximizing cuts. (Q1400343) ‎ (← links)
• Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) ‎ (← links)
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) ‎ (← links)
• Solution of large weighted equicut problems (Q1609912) ‎ (← 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)
• 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)
• A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188) ‎ (← 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)