Sciweavers

3250 search results - page 195 / 650
» An Algorithm to Solve a Linear Program
Sort
View
GECCO
2008
Springer
133views Optimization» more  GECCO 2008»
15 years 7 months ago
Automatic generation of XSLT stylesheets using evolutionary algorithms
This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented fu...
Pablo García-Sánchez, Juan Juli&aacu...
RISE
2004
Springer
15 years 11 months ago
A Symbolic Model Checker for tccp Programs
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
María Alpuente, Moreno Falaschi, Alicia Vil...
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
16 years 1 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
FOCS
1992
IEEE
15 years 10 months ago
Maximizing Non-Linear Concave Functions in Fixed Dimension
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
Sivan Toledo
MP
1998
109views more  MP 1998»
15 years 6 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra