Results 11  20
of
3,783
Heuristics for Integer Programming Using Surrogate Constraints
 Decision Sciences
, 1977
"... This paper proposes a class of surrogate constraint heuristics for obtaining approximate, 'near optimal solutions to integer programming problems. These heuris· tics are based on a simple framework that illuminates the character of several carlier heuristic proposals and provides a variety of n ..."
Abstract

Cited by 239 (37 self)
 Add to MetaCart
This paper proposes a class of surrogate constraint heuristics for obtaining approximate, 'near optimal solutions to integer programming problems. These heuris· tics are based on a simple framework that illuminates the character of several carlier heuristic proposals and provides a variety
Applying interval arithmetic to real, integer and Boolean constraints
, 1997
"... We present in this paper a uni ed processing for Real, Integer and Boolean Constraints based on a general narrowing algorithm which applies to any nary relation on <. The basic idea is to de ne, for every such relation, a narrowing function;! based on the approximation of by a Cartesian product ..."
Abstract

Cited by 187 (22 self)
 Add to MetaCart
We present in this paper a uni ed processing for Real, Integer and Boolean Constraints based on a general narrowing algorithm which applies to any nary relation on <. The basic idea is to de ne, for every such relation, a narrowing function;! based on the approximation of by a Cartesian product
Datalog with Integer Periodicity Constraints
 Proc. 1994 International Logic Programming Symposium
, 1994
"... This paper introduces a generalization of Datalog based on the notion of integer periodicity constraints. A closed form evaluation procedure running in PTIME for this class of constraints is developed. The periodicity constraints are then combined with integer (gap)order constraints and an evaluati ..."
Abstract

Cited by 32 (9 self)
 Add to MetaCart
This paper introduces a generalization of Datalog based on the notion of integer periodicity constraints. A closed form evaluation procedure running in PTIME for this class of constraints is developed. The periodicity constraints are then combined with integer (gap)order constraints
Constraint and Integer Programming in OPL
 INFORMS Journal on Computing
, 2002
"... In recent years, it has been increasingly recognized that constraint and integer programming have orthogonal and complementary strengths in stating and solving combinatorial optimization applications. In addition, their integration has become an active research topic. The optimization programming la ..."
Abstract

Cited by 25 (6 self)
 Add to MetaCart
In recent years, it has been increasingly recognized that constraint and integer programming have orthogonal and complementary strengths in stating and solving combinatorial optimization applications. In addition, their integration has become an active research topic. The optimization programming
Translating pseudoboolean constraints into SAT
 Journal on Satisfiability, Boolean Modeling and Computation
, 2006
"... In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be handled by a standard SATsolver. We show that by applying a proper mix of translation techniques, a SATsolver can perfor ..."
Abstract

Cited by 185 (2 self)
 Add to MetaCart
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be handled by a standard SATsolver. We show that by applying a proper mix of translation techniques, a SATsolver can
Integer Constraints to Stop Deforestation
, 1996
"... . Deforestation is a transformation of functional programs to remove intermediate data structures. It is based on outermost unfolding of function calls where folding occurs when unfolding takes place within the same nested function call. Since unrestricted unfolding may encounter arbitrarily man ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
many terms, a termination analysis has to determine those subterms where unfolding is possibly dangerous. We show that such an analysis can be obtained from a control flow analysis by an extension with integer constraints  essentially at no loss in efficiency. 1 Introduction The key idea of flow
APPROXIMATION ALGORITHMS FOR SCHEDULING UNRELATED PARALLEL MACHINES
, 1990
"... We consider the following scheduling problem. There are m parallel machines and n independent.jobs. Each job is to be assigned to one of the machines. The processing of.job j on machine i requires time Pip The objective is to lind a schedule that minimizes the makespan. Our main result is a polynomi ..."
Abstract

Cited by 265 (7 self)
 Add to MetaCart
polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer
Performance Analysis of Embedded Software Using Implicit Path Enumeration
, 1995
"... Embedded computer systems are characterized by the presence of a processor running application specific software. A large number of these systems must satisfy realtime constraints. This paper examines the problem of determining the bound on the running time of a given program on a given processor. ..."
Abstract

Cited by 257 (1 self)
 Add to MetaCart
Embedded computer systems are characterized by the presence of a processor running application specific software. A large number of these systems must satisfy realtime constraints. This paper examines the problem of determining the bound on the running time of a given program on a given processor
Mixedinteger quadrangulation
 ACM TRANS. GRAPH
, 2009
"... We present a novel method for quadrangulating a given triangle mesh. After constructing an as smooth as possible symmetric cross field satisfying a sparse set of directional constraints (to capture the geometric structure of the surface), the mesh is cut open in order to enable a low distortion un ..."
Abstract

Cited by 100 (11 self)
 Add to MetaCart
We present a novel method for quadrangulating a given triangle mesh. After constructing an as smooth as possible symmetric cross field satisfying a sparse set of directional constraints (to capture the geometric structure of the surface), the mesh is cut open in order to enable a low distortion
Integer Constraint Solving Methods
, 1998
"... ii Abstract Constraints are a convenient way of modelling and expressing many kinds of problems. Integer constraints are of particular interest because there are many important problems which involve integer variables (for instance resource allocation and scheduling problems) and these kinds of prob ..."
Abstract
 Add to MetaCart
ii Abstract Constraints are a convenient way of modelling and expressing many kinds of problems. Integer constraints are of particular interest because there are many important problems which involve integer variables (for instance resource allocation and scheduling problems) and these kinds
Results 11  20
of
3,783