Publications associées à On the computational complexity of periodic scheduling

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

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

On the computational complexity of periodic scheduling

Graph Chatbot

Chattez avec Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

Channel-Aware 5G RAN Slicing with Customizable Schedulers

Discrete Optimal Transport with Independent Marginals is #P-Hard

Minimum Cost Intervention Design for Causal Effect Identification

The double exponential runtime is tight for 2-stage stochastic ILPs

Flow Time Scheduling and Prefix Beck-Fiala

New Results in Integer and Lattice Programming

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Fully dynamic bin packing revisited

Graph fragmentation problem: analysis and synthesis

Channel-Aware 5G RAN Slicing with Customizable Schedulers

Minimum Cost Intervention Design for Causal Effect Identification

The double exponential runtime is tight for 2-stage stochastic ILPs

Results on Sparse Integer Programming and Geometric Independent Sets

New Results in Integer and Lattice Programming

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Flow Time Scheduling and Prefix Beck-Fiala

Discrete Optimal Transport with Independent Marginals is #P-Hard

Graph fragmentation problem: analysis and synthesis

Fully dynamic bin packing revisited