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.

An optimization framework for the development of efficient one-way car-sharing systems

Nikolaos Geroliminis, Burak Boyaci, Konstantinos Zografos

Electric vehicle-sharing systems have been introduced to a number of cities as a means of increasing mobility, reducing congestion, and pollution. Electric vehicle-sharing systems can offer one or two-way services. One-way systems provide more flexibility ...

Elsevier2015

Capacity and Data Complexity in Multidimensional Linear Attack

Serge Vaudenay, Jialin Huang

Multidimensional linear attacks are one of the most powerful variants of linear cryptanalytic techniques now. However, there is no knowledge on the key-dependent capacity and data complexity so far. Their values were assumed to be close to the average valu ...

Springer2015

Quantization Design for Distributed Optimization

Colin Neil Jones, Ye Pu, Melanie Nicole Zeilinger

We consider the problem of solving a distributed optimization problem using a distributed computing platform, where the communication in the network is limited: each node can only communicate with its neighbours and the channel has a limited data-rate. A c ...

2015

The L-1-Potts Functional For Robust Jump-Sparse Reconstruction

Martin Kurt Storath

We investigate the nonsmooth and nonconvex L-1-Potts functional in discrete and continuous time. We show Gamma-convergence of discrete L-1-Potts functionals toward their continuous counterpart and obtain a convergence statement for the corresponding minimi ...

Siam Publications2015

Pliable Index Coding

Christina Fragouli, Siddhartha Brahma

We formulate a new variant of the index coding problem, where instead of demanding a specific message, clients are pliable, and are interested in receiving any t messages that they do not have. We term this problem pliable index coding or PICOD(t). We prov ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Maximizing Symmetric Submodular Functions

Moran Feldman

Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and hypergraphs. In this work, we identify submodular maximization problems for which one can get a better app ...

Springer Int Publishing Ag2015

Optimal polynomial blow up range for critical wave maps

Can Gao

We prove that the critical Wave Maps equation with target

S^2

and origin ℝ

^{2+1}

admits energy class blow up solutions of the form [ u(t, r) = Q(\lambda(t)r) + \epsilon(t, r) ] where

Q:ℝ²\rightarrow S^2

is the ground state harmonic map and $\lambda ...

EPFL2015

Process Design and Optimization (MLS-S03): a Journey in Modeling, Optimization and Regression

Julien Léo Billeter

This lecture describes the following topics: • Preamble on Linear Algebra • Dynamic and Static Models • Solving Dynamic and Static Models • Solving Optimization Problems • Solving Regression Problems ...

2015

Transfer Learning Through Greedy Subset Selection

Barbara Caputo, Ilja Kuzborskij

We study the binary transfer learning problem, focusing on how to select sources from a large pool and how to combine them to yield a good performance on a target task. In particular, we consider the transfer learning setting where one does not have direct ...

Springer Int Publishing Ag2015

A Convex Solution to Disparity Estimation from Light Fields via the Primal-Dual Method

Pierre Vandergheynst, Mahdad Hosseini Kamal

We present a novel approach to the reconstruction of depth from light field data. Our method uses dictionary representations and group sparsity constraints to derive a convex formulation. Although our solution results in an increase of the problem dimensio ...

Springer-Verlag Berlin2015