Publications associées à Sparse Group Covers and Greedy Tree Approximations

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

Sparse Group Covers and Greedy Tree Approximations

Graph Chatbot

Chattez avec Graph Search

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Distributionally Robust Optimization with Markovian Data

Bayesian Decision Making in Groups is Hard

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

New Results in Integer and Lattice Programming

MATHICSE Technical Report : Frequency-domain non-intrusive greedy Model Order Reduction based on minimal rational approximation

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems

A Reinforcement Learning Approach to Train Routing and Scheduling

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

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

New Results in Integer and Lattice Programming

MATHICSE Technical Report : Frequency-domain non-intrusive greedy Model Order Reduction based on minimal rational approximation

Bayesian Decision Making in Groups is Hard

Distributionally Robust Optimization with Markovian Data

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

A Reinforcement Learning Approach to Train Routing and Scheduling

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

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Efficient Allocations in Constant Time: Towards Scalable Solutions in the Era of Large Scale Intelligent Systems