Publications related to NP-hardness

Automating cutting planes is NP-hard

We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula F, It is -hard to find a CP refutation of F in time polynomial in the length of the shortest such refutation; and unless Gap-Hitting-Set admits a nontrivial algorithm, ...

ACM2021

Bayesian Decision Making in Groups is Hard

Jan Hazla

We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions that maximize their expected utility according to a fully rational posterior be ...

INFORMS2021

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are ubiquitous in statistics, ...

2021

Amphiphilic nanoparticles generate curvature in lipid membranes and shape liposome-liposome interfaces

Francesco Stellacci, Francesca Olgiati

We show by molecular dynamics that amphiphilic Au nanoparticles (NP) with a diameter of 4 nm generate curvature in phosphatidylcholine lipid membranes. NPs generate negative curvature when they adsorb on the membrane surface but, as they get spontaneously ...

ROYAL SOC CHEMISTRY2021

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Qi Yan, Li Jiang

This letter studies the measurement scheduling problem for a group of

N

mobile robots moving on a flat surface that are preforming cooperative localization (CL). We consider a scenario in which due to the limited on-board resources such as battery life a ...

2020

A Primer on Motion Capture with Deep Learning: Principles, Pitfalls, and Perspectives

Alexander Mathis, Mackenzie Mathis, Steffen Schneider, Jessy Lauer

Extracting behavioral measurements non-invasively from video is stymied by the fact that it is a hard computational problem. Recent advances in deep learning have tremendously advanced our ability to predict posture directly from videos, which has quickly ...

2020

Sparsity Invariance for Convex Design of Distributed Controllers

Maryam Kamgarpour, Luca Furieri, Yu Zheng

We address the problem of designing optimal linear time-invariant (LTI) sparse controllers for LTI systems, which corresponds to minimizing a norm of the closed-loop system subjected to sparsity constraints on the controller structure. This problem is NP-h ...

2020

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

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing

Ali Boujemaoui

Decreasing defects, waste time, meeting customer demand and being adaptable are the goals of a Zero Defect Manufacturing (ZDM) strategy. Scheduling is an important tool to perform that. It should take in account buffer size allocation. In this study, a met ...

SPRINGER INTERNATIONAL PUBLISHING AG2020

Second-order guarantees in centralized, federated and decentralized nonconvex optimization

Ali H. Sayed, Stefan Vlaski

Rapid advances in data collection and processing capabilities have allowed for the use of increasingly complex models that give rise to nonconvex optimization problems. These formulations, however, can be arbitrarily difficult to solve in general, in the s ...

INT PRESS BOSTON, INC2020

NP-hardness

Graph Chatbot

Chat with Graph Search

Automating cutting planes is NP-hard

Bayesian Decision Making in Groups is Hard

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Amphiphilic nanoparticles generate curvature in lipid membranes and shape liposome-liposome interfaces

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

A Primer on Motion Capture with Deep Learning: Principles, Pitfalls, and Perspectives

Sparsity Invariance for Convex Design of Distributed Controllers

New Results in Integer and Lattice Programming

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing

Second-order guarantees in centralized, federated and decentralized nonconvex optimization

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Automating cutting planes is NP-hard

Bayesian Decision Making in Groups is Hard

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Amphiphilic nanoparticles generate curvature in lipid membranes and shape liposome-liposome interfaces

New Results in Integer and Lattice Programming

A Primer on Motion Capture with Deep Learning: Principles, Pitfalls, and Perspectives

Second-order guarantees in centralized, federated and decentralized nonconvex optimization

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing

Sparsity Invariance for Convex Design of Distributed Controllers