A new separation algorithm for the Boolean quadric and cut polytopes
DOI10.1016/J.DISOPT.2014.07.002zbMATH Open1308.90209DBLPjournals/disopt/LetchfordS14OpenAlexW2006798861WikidataQ57702137 ScholiaQ57702137MaRDI QIDQ2339832FDOQ2339832
Adam N. Letchford, Michael Malmros Sørensen
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2014.07.002
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- Geometric algorithms and combinatorial optimization
- Geometry of cuts and metrics
- Pseudo-Boolean optimization
- On the cut polytope
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Enhancing RLT relaxations via a new class of semidefinite cuts
- On a positive semidefinite relaxation of the cut polytope
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- New facets and a branch-and-cut algorithm for the weighted clique problem.
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- The cut polytope and the Boolean quadric polytope
- Fifty-Plus Years of Combinatorial Integer Programming
- Separating subdivision of bicycle wheel inequalities over cut polytopes
- Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope
- Lifting and separation procedures for the cut polytope
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Experiments in quadratic 0-1 programming
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- On disjunctive cuts for combinatorial optimization
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Max-cut in circulant graphs
Cited In (14)
- The cut polytope and the Boolean quadric polytope
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- A Separation Algorithm for b-Matching Degree-Sequence Polyhedra
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
- Volume computation for sparse Boolean quadric relaxations
- Generalised 2-circulant inequalities for the max-cut problem
- The Boolean Quadric Polytope
- Exact and heuristic algorithms for the weighted total domination problem
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
- A note on the 2-circulant inequalities for the MAX-cut problem
- Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Dendrograms, minimum spanning trees and feature selection
- Extended formulations for convex hulls of some bilinear functions
Uses Software
This page was built for publication: A new separation algorithm for the Boolean quadric and cut polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339832)
