Related publications (5)

Complexity of linear relaxations in integer programming

Matthias Schymura

For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity rc(X). This parameter was introduced by Kaibel & Weltge (2015) and captures the ...
2020

On the lifting of the Dade group

Jacques Thévenaz, Caroline Lassueur

For the group of endo-permutation modules of a finite p-group, there is a surjective reduction homomorphism from a complete discrete valuation ring of characteristic 0 to its residue field of characteristic p. We prove that this reduction map always has a ...
2019

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.