Strengthening convex relaxations of 0/1-sets using Boolean formulas

In convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points. On the one hand, there exist several general-purpose methods that strengthen relaxations without specific knowledge of the set S of feasible integer points, such as popul...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 190; číslo 1-2; s. 467 - 482
Hlavní autori:	Fiorini, Samuel, Huynh, Tony, Weltge, Stefan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2021 Springer Nature B.V
Predmet:	Boolean Boolean algebra Calculus of Variations and Optimal Control; Optimization Combinatorial analysis Combinatorics Full Length Paper Hierarchies Integer programming Linear programming Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Theoretical 90Cxx 68Q06 52Bxx
ISSN:	0025-5610, 1436-4646
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!