Jeremiah Blocki, jblocki+451@cs.cmu.edu: Monday @ 3:30 PM. GHC 7th floor lounge. Students can email me if they want to meet at a different time. Anvesh Komuravelli, anvesh+451@cs.cmu.edu: Friday @ 4 ...

This paper investigates the one-dimensional cutting stock problem considering two conflicting objective functions: minimization of both the number of objects and the number of different cutting ...

Welcome to what is currently one of the fastest academically developed solvers for mixed integer programming (MIP) and mixed integer nonlinear programming (MINLP). In addition, SCIP provides a highly ...

There’s little doubt that some of the most important pillars of modern cryptography will tumble spectacularly once quantum computing, now in its infancy, matures sufficiently. Some experts say that ...

In this mini-review, we introduce and summarize research from the Quantum Technologies Group (QTG) at Carnegie Mellon University related to computational experience with quantum annealing, performed ...

The problem of tensor completion has applications in healthcare, computer vision, and other domains. However, past approaches to tensor completion have faced a tension in that they either have ...

Abstract: Discrete optimization models and methods, in particular, the apparatus of integer programming, are often used for solving and analysis of many decision-making problems in computers design, ...

Abstract: The aim of this paper is to solve the problems of multitarget tracking in clutter. Firstly, the data association of measurement-to-target is formulated as an integer programming problem.