New Results in the Theory of Linear and Integer Programming
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.
In this paper, we show that tracking different kinds of interacting objects can be formulated as a network-flow Mixed Integer Program. This is made possible by tracking all objects simultaneously and expressing the fact that one object can appear or disapp ...
Let T be a triangulated surface given by the list of vertex-triples of its triangles, called rooms. A room-partitioning for T is a subset R of the rooms such that each vertex of T is in exactly one room in R. Given a room-partitioning R for T, the exchange ...
In this paper, we present a heuristic algorithm for solving exact, as well as approximate, shortest vector and closest vector problems on lattices. The algorithm can be seen as a modified sieving algorithm for which the vectors of the intermediate sets lie ...
We consider the estimation of the acoustic source position in a known room from recordings by a microphone array. We propose an algorithm that does not require the room to be convex, nor a line-of-sight path between the microphone array and the source to b ...
We propose a novel algorithm for automatic text line extraction on color and grayscale manuscript pages without prior binarization.
Our algorithm is based on seam carving to compute separating seams between text lines.
Seam carving is likely to produce ...
We show that the maximum total perimeter of k plane convex bodies with disjoint interiors lying inside a given convex body C is equal to , in the case when C is a square or an arbitrary triangle. A weaker bound is obtained for general plane convex bodies. ...
A recent approximation to the three-parameter infiltration was compared with an existing approximation. The new approximation has a minimum relative error that is two orders of magnitude greater than the maximum relative error of the existing approximation ...
We describe an approximate dynamic programming method for stochastic control problems on infinite state and input spaces. The optimal value function is approximated by a linear combination of basis functions with coefficients as decision variables. By rela ...
In a previous work we developed a convex infinite dimensional linear programming (LP) approach to approximating the region of attraction (ROA) of polynomial dynamical systems subject to compact basic semialgebraic state constraints. Finite dimensional rela ...
FETI-DP is a dual iterative, nonoverlapping domain decomposition method. By a Schur complement procedure, the solution of a boundary value problem is reduced to solving a symmetric and positive definite dual problem in which the variables are directly rela ...
