Over the past few decades, neuroscience experiments have become increasingly complex and naturalistic. Experimental design has in turn more challenging, as must conform to an ever-increasing diversity of constraints. In this article, we demonstrate how process can be greatly assisted using optimization tool known mixed-integer linear programming (MILP). MILP provides a rich framework for incorp...

We study the performance of Empirical Revenue Maximizing (ERM) mechanism in a single-item, single-seller, single-buyer setting. assume buyer’s valuation is drawn from regular distribution F and that seller has access to two independently samples F. By solving family mixed-integer linear programs (MILPs), ERM proven guarantee at least .5914 times optimal revenue expectation. Using solutions thes...

We address a generic Mixed-Integer Bilevel Linear Program (MIBLP), i.e., a bilevel optimization problem where all objective functions and constraints are linear, and some/all variables are required to take integer values. Rather than proposing an ad-hoc method applicable only to specific cases, we describe a general-purpose MIBLP approach. We first propose necessary modifications needed to turn...

in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

This paper describes an experimental code that has been developed to solve zero one mixed integer linear programs The experimental code uses a primal dual interior point method to solve the linear programming subproblems that arise in the solution of mixed integer linear programs by the branch and bound method Computational results for a number of test problems are provided

In this work we focus on solving quadratically constrained pseudoboolean optimization problems with quadratic objective as mixed integer linear programs. The standard mixed integer linear formulation of such problems is strengthened using valid inequalities derived from solving Reformulation-Linearization relaxation called partial DRL* relaxation. The proposed PDRL* relaxation features block-de...

Differential and linear cryptanalysis are two of the most powerful techniques to analyze symmetric-key primitives. For modern ciphers, resistance against these attacks is therefore a mandatory design criterion. In this paper, we propose a novel technique to prove security bounds against both differential and linear cryptanalysis. We use mixedinteger linear programming (MILP), a method that is f...

For a mixed integer linear program where all integer variables are bounded, we study a reformulation introduced by Roy that maps general integer variables to a collection of binary variables. We study theoretical properties and empirical strength of rank-2 simple split cuts of the reformulation. We show that for a pure integer problem with two integer variables, these cuts are sufficient to obt...