Country: United States

Found 17049 papers in total
Addendum to ‘Presolve analysis of linear programs prior to applying an interior point method’
Addendum to ‘Presolve analysis of linear programs prior to applying an interior point method’
2001,
In this note we point out that the assumptions of Propositions 1 and 2 in Gondzio...
The role of integer programming techniques in constraint programming's global constraints
The role of integer programming techniques in constraint programming's global constraints
2002,
Efforts aimed at combining operations research and constraint programming have become...
Constraint and integer programming in OPL (Optimization Programming Language)
Constraint and integer programming in OPL (Optimization Programming Language)
2002,
In recent years, it has been increasingly recognized that constraint and integer...
Algorithms for hybrid MILP/CP models for a class of optimization problems
Algorithms for hybrid MILP/CP models for a class of optimization problems
2001,
The goal of this paper is to develop models and methods that use complementary...
Sorting permutations by reversals through branch-and-price
Sorting permutations by reversals through branch-and-price
2001,
We describe an exact algorithm for the problem of sorting a permutation by the minimum...
Representatons of the all_different predicate of constraint satisfaction in integer programming
Representatons of the all_different predicate of constraint satisfaction in integer programming
2001,
The use of predicates to state constraints in Constraint Satisfaction is explained....
Fair versus unrestricted bin packing
Fair versus unrestricted bin packing
2002,
We consider the on-line Dual Bin Packing problem where we have n unit size bins and a...
Caching documents with variable sizes and fetching costs: An LP-based approach
Caching documents with variable sizes and fetching costs: An LP-based approach
2002,
We give an integer programming formulation of the paging problem with varying sizes...
A dynamic programming based pruning method for decision trees
A dynamic programming based pruning method for decision trees
2001,
This paper concerns a decision-tree pruning method, a key issue in the development of...
Mate-search efficiency can determine the evolution of separate sexes and the stability of hermaphroditism in animals
Mate-search efficiency can determine the evolution of separate sexes and the stability of hermaphroditism in animals
2002,
Limited availability of mating partners has been proposed as an explanation for the...
Extending an algebraic modeling language to support constraint programming
Extending an algebraic modeling language to support constraint programming
2002,
Although algebraic modeling languages are widely used in linear and nonlinear...
Logic, optimization, and constraint programming
Logic, optimization, and constraint programming
2002,
Because of their complementary strengths, optimization and constraint programming can...
Abstracting soft constraints: Framework, properties, examples
Abstracting soft constraints: Framework, properties, examples
2002,
Soft constraints are very flexible and expressive. However, they are also very complex...
Local search with constraint propagation and conflict-based heuristics
Local search with constraint propagation and conflict-based heuristics
2002,
Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into...
The analysis of evolutionary algorithms – A proof that crossover really can help
The analysis of evolutionary algorithms – A proof that crossover really can help
2002,
Evolutionary algorithms are randomized search heuristics that were invented in the...
Ensembling neural networks: Many could be better than all
Ensembling neural networks: Many could be better than all
2002,
Neural network ensemble is a learning paradigm where many neural networks are jointly...
Packing spanning-trees
Packing spanning-trees
1995,
We are given an algorithm for packing spanning trees in a graph G = (V, E), with...
Routing flow through a strongly connected graph
Routing flow through a strongly connected graph
2002,
It is shown that, for every strongly connected network in which every edge has...
On the design problem of multitechnology networks
On the design problem of multitechnology networks
2001,
In this article we propose a model for the topological design problem of...
The bounded cycle-cover problem
The bounded cycle-cover problem
2001,
We consider the bounded cycle-cover problem, which is to find a minimum cost cycle...
A hybrid GRASP with perturbations for the Steiner problem in graphs
A hybrid GRASP with perturbations for the Steiner problem in graphs
2002,
We propose and describe a hybrid GRASP with weight perturbations and adaptive...
Cascade graphs: Design, analysis and algorithms for relational joins
Cascade graphs: Design, analysis and algorithms for relational joins
2001,
The focus of this work is on join optimization in relational database systems. The...
Swapping a failing edge of a single source shortest paths tree is good and fast
Swapping a failing edge of a single source shortest paths tree is good and fast
2003,
Let G = (V, E) be a 2-edge connected, undirected and nonnegatively weighted graph, and...
Budget management with applications
Budget management with applications
2002,
Given a directed acyclic graph with timing constraints, the budget management problem...
Papers per page: