FEASIBILITY OF INTEGER KNAPSACKS∗ ISKANDER ALIEV† AND MARTIN HENK‡ Abstract. Given a matrix A ∈ Zm×n satisfying certain regularity assumptions, we consider the set F(A) of all vectors b ∈ Zm such that the associated knapsack polytope P (A, b) = {x ∈ R≥0 : Ax = b} contains an integer point. When m = 1 the set F(A) is known to contain all consecutive integers greater than the Frobenius number ass...

The Feasibility Pump (FP) has proved to be an effective method for finding feasible solutions to mixed integer programming problems. FP iterates between a rounding procedure and a projection procedure, which together provide a sequence of points alternating between LP relaxation feasible but fractional solutions, and integer but LP relaxation infeasible solutions. The process attempts to minimi...

This article examined the feasibility of a computer-based program that alleviates the human resource challenge associated with blind photoarrays (photoarrays in which the investigator is blind to the suspect’s identity). Students watched videotaped crimes and attempted to identify the perpetrators from photoarays conducted by a “virtual officer” who responds to simple voice commands or by resea...

We have shown that the combination of freeze-fracture with electron microscope autoradiography can be developed into a technique for correlating the molecular structure of the biological membrane with its chemical and functional characteristics. Within the limits of electron microscope autoradiographic resolution, FARG has the potential to detect the relative distribution of molecules in each h...

Abstract. We perform a direct comparison of the Succinct Solver v2.0 and XSB Prolog v2.6 based on experiments with Control Flow Analyses of scalable Discretionary Ambient programs and Carmel programs. To facilitate this comparison we expand ALFP clauses accepted by the Succinct Solver into more general Normal clauses accepted by both solvers and run the experiments for all three possible combin...

The nuclear receptor NR5A2 is well known to bind and be regulated by phospholipids even an exogenous plant phospholipid called DLPC was recently found to activate NR5A2 having dramatic anti-diabetic effects in the mouse liver. However, how those phospholipids leave cellular membrane systems and come to bind NR5A2 is completely unexplored. The most salient reason why this is such an understudied...

| We consider the problem of synthesizing feasible signals in a Hilbert space in the presence of inconsistent convex constraints, some of which must imperatively be satissed. This problem is formalized as that of minimizing a convex objective measuring the amount of violation of the soft constraints over the intersection of the sets associated with the hard ones. The resulting convex optimizati...

This paper considers the problem of finding and verifying feasible points for constraint satisfaction problems, including those with uncertain coefficients. The main part is devoted to the problem of finding a narrow box around an approximately feasible solution for which it can be rigorously and automatically proved that it contains a feasible solution. Some examples demonstrate difficulties w...

Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important NP-complete problem that can be extremely hard in practice. Feasibility Pump (FP) is a heuristic scheme for finding a feasible solution to general MIPs that can be viewed as a clever way to round a sequence of fractional solutions of the LP relaxation, until a feasible one is eventually found. In th...

The Feasibility Pump of Fischetti, Glover, Lodi, and Bertacco [8, 7] has proved to be a very successful heuristic for finding feasible solutions of mixed integer programs. The quality of the solutions in terms of the objective value, however, tends to be poor. This paper proposes a slight modification of the algorithm in order to find better solutions. Extensive computational results show the s...