Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs

Matthias Walter*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Downloads (Pure)

Abstract

Cutting planes are a key ingredient to successfully solve mixed-integer linear programs. For specific problems, their strength is often theoretically assessed by showing that they are facet-defining for the corresponding mixed-integer hull. In this paper we experimentally investigate the dimensions of faces induced by general-purpose cutting planes generated by a state-of-the-art solver. Therefore, we relate the dimension of each cutting plane to its impact in a branch-and-bound algorithm.

Original languageEnglish
Title of host publicationInteger Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Proceedings
EditorsMohit Singh, David P. Williamson
PublisherSpringer
Pages399-412
Number of pages14
ISBN (Print)9783030738785
DOIs
Publication statusPublished - 2021
Event22nd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2021 - Virtual, Online
Duration: 19 May 202121 May 2021
Conference number: 22

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12707 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2021
Abbreviated titleIPCO 2021
CityVirtual, Online
Period19/05/2121/05/21

Fingerprint

Dive into the research topics of 'Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs'. Together they form a unique fingerprint.

Cite this