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 48 items.

• \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
• Combinatorial and geometric properties of the max-cut and min-cut problems (Q393848) (← 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)
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← 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)
• Easy and difficult objective functions for max cut (Q1411627) (← links)
• On decomposability of multilinear sets (Q1659675) (← links)
• On graphs of the cone decompositions for the min-cut and max-cut problems (Q1751487) (← links)
• The generalized vertex cover problem and some variations (Q1756348) (← links)
• Minimization of ordered, symmetric half-products (Q1763481) (← links)
• A MAX-CUT formulation of 0/1 programs (Q1785732) (← 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)
• Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← 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)
• Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
• A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
• New quadratic models for the maximum weighted cut problem (Q2501328) (← links)
• QUBO formulations of the longest path problem (Q2658047) (← links)
• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs (Q2784422) (← links)
• Optimal allocation problem with quadratic utility functions and its relationship with graph cut problem (Q2869513) (← links)
• New bounds for the maximum cut problem (Q3439502) (← links)
• Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization (Q4012442) (← links)
• Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
• Introduction to QUBO (Q5050141) (← links)
• Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
• (Q5075808) (← links)
• A filled function method for quadratic programs with binary constraints† (Q5193139) (← links)
• Algorithms – ESA 2005 (Q5475891) (← links)
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5918755) (← links)
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5919301) (← 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)
• New advances for quantum-inspired optimization (Q6609695) (← links)