Pages that link to "Item:Q3790963"
From MaRDI portal
The following pages link to An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design (Q3790963):
Displayed 24 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)