scientific article
From MaRDI portal
Publication:3802912
zbMATH Open0655.90088MaRDI QIDQ3802912
J.-K. L. Matitskas, G. S. Palubetskis
Publication date: 1986
Title of this publication is not available (Why is that?)
inequalitiesbranch-and-boundquadratic objective functionheuristictwo constraintsgraph cuttingtree cutting
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09)
Related Items (5)
Graph separation techniques for quadratic zero-one programming ⋮ The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds ⋮ Title not available (Why is that?) ⋮ Algorithms – ESA 2005 ⋮ Optimal allocation problem with quadratic utility functions and its relationship with graph cut problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3802912)
