Sciweavers

3221 search results - page 66 / 645
» Termination of Linear Programs
Sort
View
ICLP
1998
Springer
14 years 4 days ago
Efficient Implementation of a Linear Logic Programming Language
A number of logic programming languages based on Linear Logic [3] have been proposed. However, the implementation techniques proposed for these languages have relied heavily on th...
Joshua S. Hodas, K. M. Watkins, Naoyuki Tamura, Ky...
CSCLP
2005
Springer
14 years 1 months ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel
CP
2000
Springer
14 years 8 days ago
Linear Formulation of Constraint Programming Models and Hybrid Solvers
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...
Philippe Refalo
CP
2005
Springer
14 years 1 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
ICCS
2004
Springer
14 years 1 months ago
Encoding Multiple Solutions in a Linear Genetic Programming Chromosome
Abstract. Linear Genetic Programming (LGP) is a Genetic Programming variant that uses linear chromosomes for solution encoding. Each LGP chromosome is a sequence of C language inst...
Mihai Oltean, Crina Grosan, Mihaela Oltean