Results 1  10
of
576,839
On Lifting Integer Variables in Minimal Inequalities
, 2009
"... This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tableau form where all the nonbasic variables are continuous. In this paper we study lifting functions for the nonbasic inte ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tableau form where all the nonbasic variables are continuous. In this paper we study lifting functions for the nonbasic
On mixedinteger sets with two integer variables
, 2010
"... We show that every facetdefining inequality of the convex hull of a mixedinteger polyhedral set with two integer variables is a crooked cross cut (which we defined recently in [3]). We then extend this observation to show that crooked cross cuts give the convex hull of mixedinteger sets with more ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We show that every facetdefining inequality of the convex hull of a mixedinteger polyhedral set with two integer variables is a crooked cross cut (which we defined recently in [3]). We then extend this observation to show that crooked cross cuts give the convex hull of mixedinteger sets
Cutting Planes for Integer Programs with General Integer Variables
, 1995
"... We investigate the use of cutting planes for integer programs with general integer variables. We show how cutting planes arising from knapsack inequalities can be generated and lifted as in the case of 01 variables. We also explore the use of Gomory's mixed integer cuts. We address both theore ..."
Abstract

Cited by 22 (7 self)
 Add to MetaCart
We investigate the use of cutting planes for integer programs with general integer variables. We show how cutting planes arising from knapsack inequalities can be generated and lifted as in the case of 01 variables. We also explore the use of Gomory's mixed integer cuts. We address both
On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
, 2008
"... In this paper we consider an infinite relaxation of the mixed integer linear program with two integer variables, nonnegative continuous variables and two equality constraints, and we give a complete characterization of its facets. We also derive an analogous characterization of the facets of the und ..."
Abstract

Cited by 39 (7 self)
 Add to MetaCart
In this paper we consider an infinite relaxation of the mixed integer linear program with two integer variables, nonnegative continuous variables and two equality constraints, and we give a complete characterization of its facets. We also derive an analogous characterization of the facets
The Omega Test: a fast and practical integer programming algorithm for dependence analysis
 Communications of the ACM
, 1992
"... The Omega testi s ani nteger programmi ng algori thm that can determi ne whether a dependence exi sts between two array references, and i so, under what condi7: ns. Conventi nalwi[A m holds thati nteger programmiB techni:36 are far too expensi e to be used for dependence analysi6 except as a method ..."
Abstract

Cited by 521 (15 self)
 Add to MetaCart
The Omega testi s ani nteger programmi ng algori thm that can determi ne whether a dependence exi sts between two array references, and i so, under what condi7: ns. Conventi nalwi[A m holds thati nteger programmiB techni:36 are far too expensi e to be used for dependence analysi6 except as a method of last resort for si:8 ti ns that cannot be deci:A by si[976 methods. We present evi[77B that suggests thiwi sdomi s wrong, and that the Omega testi s competi ti ve wi th approxi mate algori thms usedi n practi ce and sui table for usei n producti on compi lers. Experi ments suggest that, for almost all programs, the average ti me requi red by the Omega test to determi ne the di recti on vectors for an array pai ri s less than 500 secs on a 12 MIPS workstati on. The Omega testi based on an extensi n of Four i0Motzki var i ble eli937 ti n (aliB: r programmiA method) toi nteger programmi ng, and has worstcase exponenti al ti me complexi ty. However, we show that for manysiB7 ti ns i whi h ...
Unique Liftings of Integer Variables in Minimal Inequalities
, 2012
"... This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tableau form where all the nonbasic variables are continuous; they are derived using the gauge function of maximal latticef ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tableau form where all the nonbasic variables are continuous; they are derived using the gauge function of maximal lattice
Lifting Integer Variables in Minimal Inequalities Corresponding To LatticeFree Triangles
"... Recently, Andersen et al. [1] and Borozan and Cornuéjols [3] characterized the minimal inequalities of a system of two rows with two free integer variables and nonnegative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal latticefree convex se ..."
Abstract

Cited by 31 (8 self)
 Add to MetaCart
Recently, Andersen et al. [1] and Borozan and Cornuéjols [3] characterized the minimal inequalities of a system of two rows with two free integer variables and nonnegative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal latticefree convex
Automatic Discovery of Linear Restraints Among Variables of a Program
, 1978
"... The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs. ..."
Abstract

Cited by 733 (47 self)
 Add to MetaCart
The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs.
Modeling Preemptive EDF and FP by Integer Variables
 MISTA
, 2009
"... The design of any system can be modeled by an optimization problem, where a decision must be taken to maximize an overall utility function within some constraints (that can be physical, contractual, etc.). In hard realtime systems the constraints are specified by the deadlines that are set for the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The design of any system can be modeled by an optimization problem, where a decision must be taken to maximize an overall utility function within some constraints (that can be physical, contractual, etc.). In hard realtime systems the constraints are specified by the deadlines that are set for the completion of tasks. However classic schedulability tests are formulated by algorithms that prevent a visualization of the feasible region of the designer choices. In this paper we formulate the EDF and FP exact schedulability conditions on a single processor through a combination of linear constraints. We believe that this alternate representation is better suited for optimization and can trigger the development of more effective design methodologies for realtime systems.
The unity and diversity of executive functions and their contributions to complex “Frontal Lobe” tasks: a latent variable analysis
 Cognit Psychol
, 2000
"... This individual differences study examined the separability of three often postulated executive functions—mental set shifting (‘‘Shifting’’), information updating and monitoring (‘‘Updating’’), and inhibition of prepotent responses (‘‘Inhibition’’)—and their roles in complex ‘‘frontal lobe’ ’ or ‘ ..."
Abstract

Cited by 626 (9 self)
 Add to MetaCart
This individual differences study examined the separability of three often postulated executive functions—mental set shifting (‘‘Shifting’’), information updating and monitoring (‘‘Updating’’), and inhibition of prepotent responses (‘‘Inhibition’’)—and their roles in complex ‘‘frontal lobe’ ’ or ‘‘executive’ ’ tasks. One hundred thirtyseven college students performed a set of relatively simple experimental tasks that are considered to predominantly tap each target executive function as well as a set of frequently used executive tasks: the Wisconsin Card Sorting Test (WCST), Tower of Hanoi (TOH), random number generation (RNG), operation span, and dual tasking. Confirmatory factor analysis indicated that the three target executive functions are moderately correlated with one another, but are clearly separable. Moreover, structural equation modeling suggested that the three functions
Results 1  10
of
576,839