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...

Celý popis

Podrobná bibliografie

Vydáno v:	Networks Ročník 77; číslo 1; s. 21 - 49
Hlavní autor:	Hochbaum, Dorit S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Hoboken, USA John Wiley & Sons, Inc 01.01.2021 Wiley Subscription Services, Inc
Témata:	Algorithms Combinatorial analysis image segmentation Integer programming Modelling monotone inequalities network flow parametric cut Polynomials ratio problems
ISSN:	0028-3045, 1097-0037
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!