Pages that link to "Item:Q1179735"

The following pages link to The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735):

Displaying 27 items.

• \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
• A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
• Separator-based data reduction for signed graph balancing (Q613659) (← links)
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
• Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
• Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
• The line index and minimum cut of weighted graphs (Q1303736) (← links)
• On decomposability of multilinear sets (Q1659675) (← links)
• The generalized vertex cover problem and some variations (Q1756348) (← links)
• Minimization of ordered, symmetric half-products (Q1763481) (← links)
• Applications of cut polyhedra. II (Q1891020) (← links)
• A new penalty parameter for linearly constrained 0--1 quadratic programming problems (Q1947625) (← links)
• Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
• Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
• On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
• Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
• A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
• QUBO formulations of the longest path problem (Q2658047) (← links)
• Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation (Q6047870) (← links)
• On optimization problems in acyclic hypergraphs (Q6161450) (← links)