Applications and efficient algorithms for integer programming problems on monotone constraints

We present here classes of integer programming problems that are solvable efficiently and with combinatorial flow algorithms. The problems are characterized by constraints that have either at most two variables per inequality that appear with opposite sign coefficients, or have in addition a third v...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Networks Jg. 77; H. 1; S. 21 - 49
1. Verfasser:	Hochbaum, Dorit S.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken, USA John Wiley & Sons, Inc 01.01.2021 Wiley Subscription Services, Inc
Schlagworte:	Algorithms Combinatorial analysis image segmentation Integer programming Modelling monotone inequalities network flow parametric cut Polynomials ratio problems
ISSN:	0028-3045, 1097-0037
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!