In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly
impact the arrival times to those in need. Because it is critical that the deliveries are both …

… As mentioned in the introduction, we have chosen to use the method proposed by Burer
and Vandenbussche [4] for solving the SDP relaxations because of its applicability and …

We present the implementation of a branch-and-cut algorithm for bound constrained nonconvex
quadratic programs. We use a class of inequalities developed in [12] as cutting planes. …

We consider a recent branch-and-bound algorithm of the authors for nonconvex quadratic
programming. The algorithm is characterized by its use of semidefinite relaxations within a …

We propose a method for optimizing the lift-and-project relaxations of binary integer programs
introduced by Lovász and Schrijver. In particular, we study both linear and semidefinite …

By reformulating quadratic programs using necessary optimality conditions, we obtain a
linear program with complementarity constraints. For the case where the only constraints are …

For an integer program, a k-cutis a cutting plane generated by the Gomory mixed integer
procedure from a row of the LP tableau after multiplying it by a positive integer k. With this …

Objective: The aim of this study was to compare the minimally invasive endovenous laser
technique for treatment of primary varicose veins with the conventional stripping operation in …

… vikwik D 0 for each asset k and 8i 2 A; vi 0 8i 2 A: … hi represents the vector of amounts
traded for each asset in account i 2 A and that t D … fi .wi /QtT Q Qt subject to ti D wi …

In a typical Institutional Separately Managed Account (SMA) framework, client portfolios that
follow a similar strategy are individually optimized and the resulting trades are pooled …