About strongly polynomial time algorithms for quadratic optimization over submodular constraints
type: Item
instance of: scholarly article
title: About strongly polynomial time algorithms for quadratic optimization over submodular constraints
zbMATH Open document ID: 0844.90061
author: Dorit S. Hochbaum
author: Sung-Pil Hong
published in: Mathematical Programming. Series A. Series B
publication date: 1996-04-10T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 52B12
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 849128
zbMATH Keywords: Kuhn-Tucker conditions
zbMATH Keywords: lexicographically optimal flow
zbMATH Keywords: parametric maximum flow
zbMATH Keywords: strongly polynomial algorithms
zbMATH Keywords: convex separable quadratic minimization over submodular constraints
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 849128