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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 190; no. 1-2; pp. 467 - 482
Main Authors:	Fiorini, Samuel, Huynh, Tony, Weltge, Stefan
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2021 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!