Publications related to New Results in the Theory of Linear and Integer Programming

A unifying framework for form-finding and topology-finding of tensegrity structures

This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member conne ...

PERGAMON-ELSEVIER SCIENCE LTD2021

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

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

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

A general framework for the integration of complex choice models into mixed integer optimization

Meritxell Pacheco Paneque

The objective of this thesis is to develop a general methodology to incorporate a disaggregate demand representation in supply-oriented optimization problems that allows to capture the interplay between the behavior of individuals and the decisions to be o ...

EPFL2020

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Mikhail Kapralov, Slobodan Mitrovic, Ashkan Norouzi Fard, Jakab Tardos

Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...

ASSOC COMPUTING MACHINERY2020

Matrix recovery from bilinear and quadratic measurements

Martin Vetterli, Adam James Scholefield, Michalina Wanda Pacholska, Karen Adam

Matrix (or operator) recovery from linear measurements is a well-studied problem. However, there are situations where only bilinear or quadratic measurements are available. A bilinear or quadratic problem can easily be transformed into a linear one, but it ...

ArXiv2020

A note on the integrality gap of the configuration LP for restricted Santa Claus

Klaus Jansen, Lars Rohwedder

In the restricted Santa Claus problem we are given resources R and players P. Every resource j is an element of R. has a value v(j) and every player i is an element of P desires a set of resources R(i). We are interested in distributing the resources to pl ...

ELSEVIER2020

A Novel Decomposition Solution Approach for the Restoration Problem in Distribution Networks

Hossein Sekhavatmanesh

The distribution network restoration problem is by nature a mixed integer and non-linear optimization problem due to the switching decisions and Optimal Power Flow (OPF) constraints, respectively. The link between these two parts involves logical implicati ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) described a deterministic single-exponential time algorithm for the closest vector problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given ...

SPRINGER HEIDELBERG2020

New Results in the Theory of Linear and Integer Programming

Graph Chatbot

Chat with Graph Search

A unifying framework for form-finding and topology-finding of tensegrity structures

New Results in Integer and Lattice Programming

Complexity of linear relaxations in integer programming

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

A general framework for the integration of complex choice models into mixed integer optimization

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Matrix recovery from bilinear and quadratic measurements

A note on the integrality gap of the configuration LP for restricted Santa Claus

A Novel Decomposition Solution Approach for the Restoration Problem in Distribution Networks

On compact representations of Voronoi cells of lattices

New Results in Integer and Lattice Programming

A unifying framework for form-finding and topology-finding of tensegrity structures

A general framework for the integration of complex choice models into mixed integer optimization

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Complexity of linear relaxations in integer programming

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

A Novel Decomposition Solution Approach for the Restoration Problem in Distribution Networks

On compact representations of Voronoi cells of lattices

Matrix recovery from bilinear and quadratic measurements

A note on the integrality gap of the configuration LP for restricted Santa Claus