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.

• \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
• An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
• Lifting and separation procedures for the cut polytope (Q403653) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
• Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
• A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
• Solving the maxcut problem by the global equilibrium search (Q466339) (← links)
• NP-hardness of the Euclidean Max-Cut problem (Q471386) (← links)
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
• A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
• A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
• A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
• The inequicut cone (Q688255) (← links)
• Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
• Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) (Q830923) (← links)
• Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
• Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel (Q895077) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← 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)
• An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)