Sciweavers

732 search results - page 3 / 147
» Termination of Integer Linear Programs
Sort
View
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 7 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
CORR
2011
Springer
115views Education» more  CORR 2011»
12 years 11 months ago
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amra...
IOR
2011
133views more  IOR 2011»
13 years 2 months ago
Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
Binyuan Chen, Simge Küçükyavuz, S...
EOR
2006
104views more  EOR 2006»
13 years 7 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve