Publications related to A Distributed Algorithm for Partitioned Robust Submodular Maximization

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

An integer programming approach to scheduling the transshipment of products at cross-docks in less-than-truckload industries

Mohammad Yousef Maknoon

This paper introduces an exact method to schedule the internal transshipment process at cross-docks in less-than-truckload industries. An integer programming formulation is presented to minimize the cost of double handling by synchronizing two types of dec ...

Pergamon-Elsevier Science Ltd2017

AC OPF in radial distribution networks – Part II: An augmented Lagrangian-based OPF algorithm, distributable via primal decomposition

Jean-Yves Le Boudec, Mario Paolone, Dan-Cristian Tomozei, Konstantina Christakou

In the first part of this two-part paper we show that the branch-flow convexification of the OPF problem is not exact and that the ADMM-based decomposition of the OPF fails to converge in specific scenarios. Therefore, there is a need to develop algorithms ...

Elsevier2017

Drug Combination for Treatment of Proliferative Diseases

Paul Joseph Dyson, Hubert van den Bergh, Patrycja Nowak-Sliwinska

Angiogenesis inhibitory drug combination obtained according to a specific algorithm, preferably a FSC, in which an initial combination of drugs is iteratively adjusted. The drug combination according to the invention may advantageously comprise a RAPTA-C c ...

2017

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

We present an iterative retrieval algorithm based on data constraint for ultrashort pulse characterization using dispersion scan (d-scan). The proposed algorithm is much faster and leads to a drastic reduction of retrieval times, but, compared to the stand ...

Optical Society of America2017

Information Structure Design in Team Decision Problems

Maryam Kamgarpour, Tyler Summers

We consider a problem of information structure design in team decision problems and team games. We propose simple, scalable greedy algorithms for adding a set of extra information links to optimize team performance and resilience to non-cooperative and adv ...

2017

An Efficient Streaming Algorithm for the Submodular Cover Problem

Volkan Cevher, Ilija Bogunovic, Ya-Ping Hsieh, Ashkan Norouzi Fard, Abbas Bazzi, Marwa El Halabi

We initiate the study of the classical Submodular Cover (SC) problem in the data streaming model which we refer to as the Streaming Submodular Cover (SSC). We show that any single pass streaming algorithm using sublinear memory in the size of the stream wi ...

2016

Decentralized consensus optimization with asynchrony and delays

Ali H. Sayed, Kun Yuan, Tianyu Wu

We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network of agents, where the agents perform local computation and communicate with neighbors. We design the algorithm so that the agents can compute a ...

IEEE2016

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

Collision-Free Pattern Formation

Rachid Guerraoui, Alexandre David Olivier Maurer

Shoals of small fishes can change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. In this paper, we study the analog problem of distributed pattern formation. A set of processes needs to move ...

2016

A Distributed Algorithm for Partitioned Robust Submodular Maximization

Graph Chatbot

Chat with Graph Search

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

An integer programming approach to scheduling the transshipment of products at cross-docks in less-than-truckload industries

AC OPF in radial distribution networks – Part II: An augmented Lagrangian-based OPF algorithm, distributable via primal decomposition

Drug Combination for Treatment of Proliferative Diseases

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

Information Structure Design in Team Decision Problems

An Efficient Streaming Algorithm for the Submodular Cover Problem

Decentralized consensus optimization with asynchrony and delays

Pattern formation with voluminous processes

Collision-Free Pattern Formation

An integer programming approach to scheduling the transshipment of products at cross-docks in less-than-truckload industries

Pattern formation with voluminous processes

Collision-Free Pattern Formation

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

An Efficient Streaming Algorithm for the Submodular Cover Problem

AC OPF in radial distribution networks – Part II: An augmented Lagrangian-based OPF algorithm, distributable via primal decomposition

Decentralized consensus optimization with asynchrony and delays

Drug Combination for Treatment of Proliferative Diseases

Information Structure Design in Team Decision Problems