Concept

Knapsack problem

Related publications (775)

Graph Chatbot

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.

Indiscreet discrete logarithms

Robert Granger

In 2013 and 2014 a revolution took place in the understanding of the discrete logarithm problem (DLP) in finite fields of small characteristic. Consequently, many cryptosystems based on cryptographic pairings were rendered completely insecure, which serves ...

2017

Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions

Rémy Glardon, Nicolas Zufferey

This paper presents an integrated approach for short-term supply chain management (SCM) at a fast moving consumer goods production plant. The problem is to determine the production quantities, to provide a detailed production schedule, to trigger the relev ...

Springer2017

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

MATHICSE Technical Report : Automatic reduction of PDEs defined on domains with variable shape

Andrea Manzoni, Federico Negri

In this work we propose a new, general and computationally cheap way to tackle parametrized PDEs defined on domains with variable shape when relying on the reduced basis method. We easily describe a domain by boundary parametrizations, and obtain domain de ...

MATHICSE2016

Multi-index Stochastic Collocation for random PDEs

Fabio Nobile, Lorenzo Tamellini

In this work we introduce the Multi-Index Stochastic Collocation method (MISC) for computing statistics of the solution of a PDE with random data. MISC is a combination technique based on mixed differences of spatial approximations and quadratures over the ...

2016

Multiple Query Optimization on the D-Wave 2X Adiabatic Quantum Computer

Christoph Koch, Immanuel Trummer

The D-Wave adiabatic quantum annealer solves hard combinatorial optimization problems leveraging quantum physics. The newest version features over 1000 qubits and was released in August 2015. We were given access to such a machine, currently hosted at NASA ...

Assoc Computing Machinery2016

Pattern formation with voluminous processes

Alexandre David Olivier Maurer

When a shoal of small fishes notices a predator, they typically change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. This motivates us to design algorithms with similar properties. In this p ...

EPFL2016

Distributed wireless video caching placement for dynamic adaptive streaming

Pascal Frossard, Chenglin Li

Caching at edge servers can smooth the temporal traffic variability and reduce the service load of base stations in wireless streaming. However, the assignment of the cached content for possibly multiple versions of different video sequences is still a cha ...

2016

Nematodynamics and random homogenization

Tudor Ratiu

We study the homogenization problem for the system of equations of dynamics of a mixture of liquid crystals with random structure. We consider a simplified form of the Ericksen-Leslie equations for an incompressible medium with inhomogeneous density with r ...

Taylor & Francis2016

Submodular Stochastic Probing on Matroids

Justin Dean Ward, Marek Adamczyk

In a stochastic probing problem we are given a universe E, and a probability that each element e in E is active. We determine if an element is active by probing it, and whenever a probed element is active, we must permanently include it in our solution. Mo ...

INFORMS2016