Publications associées à Group-Sparse Model Selection: Hardness and Relaxations

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

Group-Sparse Model Selection: Hardness and Relaxations

Graph Chatbot

Chattez avec Graph Search

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

New Results in Integer and Lattice Programming

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

Learning (from) the Electron Density: Transferability, Conformational and Chemical Diversity

Machine learning models of the energy curvature vs particle number for optimal tuning of long-range corrected functionals

New Graph Algorithms via Polyhedral Techniques

On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing

No Small Linear Program Approximates Vertex Cover Within a Factor 2-epsilon

Fitting Markovian binary trees using global and individual demographic data

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

New Results in Integer and Lattice Programming

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

On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing

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

Learning (from) the Electron Density: Transferability, Conformational and Chemical Diversity

New Graph Algorithms via Polyhedral Techniques

No Small Linear Program Approximates Vertex Cover Within a Factor 2-epsilon

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Machine learning models of the energy curvature vs particle number for optimal tuning of long-range corrected functionals

Fitting Markovian binary trees using global and individual demographic data