Sciweavers

732 search results - page 16 / 147
» Termination of Integer Linear Programs
Sort
View
CADE
2009
Springer
14 years 8 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
DISOPT
2007
96views more  DISOPT 2007»
13 years 7 months ago
Symmetric ILP: Coloring and small integers
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary v...
François Margot
MP
2011
13 years 2 months ago
Lifting for conic mixed-integer programming
Lifting is a procedure for deriving valid inequalities for mixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very eļ¬...
Alper Atamtürk, Vishnu Narayanan
RTA
2010
Springer
13 years 11 months ago
Termination of linear bounded term rewriting systems
For the whole class of linear term rewriting systems and for each integer k, we deļ¬ne k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
Irène Durand, Géraud Sénizerg...
OL
2010
87views more  OL 2010»
13 years 6 months ago
Uniqueness of integer solution of linear equations
Abstract. We consider the system of m linear equations in n integer variables Ax = d and give sufļ¬cient conditions for the uniqueness of its integer solution x āˆˆ {āˆ’1,1}n by r...
O. L. Mangasarian, Michael C. Ferris