Sciweavers

975 search results - page 27 / 195
» Locality Optimization for Program Instances
Sort
View
86
Voted
EVOW
2007
Springer
15 years 3 months ago
Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms
Abstract. This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algori...
Napoleão Nepomuceno, Plácido Rog&eac...
MP
2006
105views more  MP 2006»
14 years 9 months ago
Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach
We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent superadditive dual formulation that uses the value fun...
Nan Kong, Andrew J. Schaefer, Brady Hunsaker
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 1 months ago
Local search for multiobjective function optimization: pareto descent method
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi
79
Voted
ICSE
2007
IEEE-ACM
15 years 9 months ago
Kato: A Program Slicing Tool for Declarative Specifications
This paper presents Kato, a tool that implements a novel class of optimizations that are inspired by program slicing for imperative languages but are applicable to analyzable decl...
Engin Uzuncaova, Sarfraz Khurshid
AAAI
1998
14 years 11 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître