Publications associées à Knapsack and Subset Sum with Small Items

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

Knapsack and Subset Sum with Small Items

Graph Chatbot

Chattez avec Graph Search

A ride time-oriented scheduling algorithm for dial-a-ride problems

Results on Sparse Integer Programming and Geometric Independent Sets

Approximation Algorithms for Allocation and Network Design

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Minimum Cost Intervention Design for Causal Effect Identification

New Results in Integer and Lattice Programming

Conditional gradient methods for stochastically constrained convex minimization

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

New Graph Algorithms via Polyhedral Techniques

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

A ride time-oriented scheduling algorithm for dial-a-ride problems

Results on Sparse Integer Programming and Geometric Independent Sets

New Graph Algorithms via Polyhedral Techniques

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Approximation Algorithms for Allocation and Network Design

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

Minimum Cost Intervention Design for Causal Effect Identification

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

New Results in Integer and Lattice Programming

Conditional gradient methods for stochastically constrained convex minimization