On The Boolean Quadric Forest Polytope

DOI10.1080/03155986.2004.11732696MaRDI QIDQ6039363

Janny M. Y. Leung, Jon Lee

Publication date: 5 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

zbMATH Keywords

polytopespanning treeseparationfacetinteger programforestBoolean quadric polytope

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items

Matroid optimisation problems with nested non-linear monomials in the objective function, Lower bounds and exact algorithms for the quadratic minimum spanning tree problem, Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Combinatorial optimization with one quadratic term: spanning trees and forests, Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem, Volume computation for sparse Boolean quadric relaxations