Tracklet-based Multi-Commodity Network Flow for Tracking Multiple People

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.

Integer programs (IPs) are one of the fundamental tools used to solve combinatorial problems in theory and practice. Understanding the structure of solutions of IPs is thus helpful to argue about the existence of solutions with a certain simple structure, ...

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Many of the currently best-known approximation algorithms for NP-hard optimization problems are based on Linear Programming (LP) and Semi-definite Programming (SDP) relaxations. Given its power, this class of algorithms seems to contain the most favourable ...

Linear programming (LP) has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algorithmic me ...

Approximation algorithms are a commonly used tool for designing efficient algorithmic solutions for intractable problems, at the expense of the quality of the output solution. A prominent technique for designing such algorithms is the use of Linear Program ...

Given the challenges related to climate change and dependency from fossil fuels, modification of the energy systems infrastructure to increase the share of renewable energy is a priority in urban energy planning. The high heating density in cities makes it ...

Receding horizon control requires the solution of an optimization problem at every sampling instant. We present efficient interior point methods tailored to convex multistage problems, a problem class which most relevant MPC problems with linear dynamics c ...

A linear programming approach is proposed to tune fixed-order linearly parameterized gain-scheduled controllers for stable SISO linear parameter varying (LPV) plants. The method is based on the shaping of the open-loop transfer functions in the Nyquist dia ...

Tracklet-based Multi-Commodity Network Flow for Tracking Multiple People

Chat with Graph Search

Using Structural Properties for Integer Programs

Dynamic Facility Location via Exponential Clocks

Strengths and Limitations of Linear Programming Relaxations

LP-Based Algorithms For Capacitated Facility Location

Applications of Strong Convex Relaxations to Allocation Problems

Spatial clustering for district heating integration in urban energy systems: application to geothermal energy

Efficient Interior Point Methods for Multistage Problems Arising in Receding Horizon Control

Gain-Scheduled Controller Design by Linear Programming