In this paper, we give the first robust algorithms for Packing Integer Programs, specifically in the recently proposed Byzantine Secretary framework. Our techniques are based on a two-level use of ...

Abstract: In this presentation, we discuss a symbolic tool, implemented in Mathematica/sup /spl copy//, that converts a hybrid automaton model of a power system into either a mixed logical dynamic ...

Abstract: In this presentation, we discuss a symbolic tool, implemented in Mathematica that converts a hybrid automaton model of a power system into either a mixed logical dynamic system (MLD) or a ...

In comparison with what you have seen in the previous lessons, the linear program that we are going to define now does not have real variables, but rather integer variables. This is a true story ...

Inspired by the decomposition in the hybrid quantum-classical optimization algorithm we introduced in arXiv:1902.04215, we propose here a new (fully classical) approach to solving certain non-convex ...

Write down the Linear Program (LP) relaxation of an IP Plot the graphical representation of an IP and find the optimal solution Understand the relationship between optimal solution of an IP and the ...

We present a technique to infer lower bounds on the worst-case runtime complexity of integer programs. To this end, we construct symbolic representations of program executions using a framework for ...