Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting
METADATA ONLY
Loading...
Author / Producer
Date
2018
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Permanent link
Publication status
published
External links
Editor
Book title
Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)
Journal / series
Volume
Pages / Article No.
788 - 807
Publisher
SIAM
Event
29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
extension complexity; mixed-integerprograms; extended formulations
Organisational unit
09487 - Zenklusen, Rico / Zenklusen, Rico
Notes
Funding
165866 - New Approaches to Constrained Submodular Maximization (SNF)