Country: Netherlands

Found 18376 papers in total
A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
2006,
We propose a fully sequential indifference-zone selection procedure that is...
A stochastic quasi-Newton method for simulation response optimization
A stochastic quasi-Newton method for simulation response optimization
2006,
Simulation response optimization has wide applications for management of systems that...
A soft approach for hard continuous optimization
A soft approach for hard continuous optimization
2006,
This paper is to introduce a soft approach for solving continuous optimization models...
Scale economies and production function estimation for object-oriented software component and source code documentation size
Scale economies and production function estimation for object-oriented software component and source code documentation size
2006,
In this study, we investigate the factors that influence the object-oriented (OO)...
A project game for PERT networks
A project game for PERT networks
2007,
An important topic in PERT networks is how to allocate the total expedition (or delay)...
A multiperiod single processor scheduling problem with periodic requirements
A multiperiod single processor scheduling problem with periodic requirements
2006,
A single processor must perform a set of jobs on a planning time horizon subdivided...
An LP-based heuristic for a time-constrained routing problem
An LP-based heuristic for a time-constrained routing problem
2006,
In this paper we present an LP-based heuristic for the solution of a Time Constrained...
Nodal aggregation of resource constraints in a shortest path problem
Nodal aggregation of resource constraints in a shortest path problem
2006,
The shortest path problem with resource constraints consists of finding the minimum...
Multicriteria adaptive paths in stochastic, time-varying networks
Multicriteria adaptive paths in stochastic, time-varying networks
2006,
In this paper, exact algorithms are proposed for addressing multicriteria adaptive...
Congestion network problems and related games
Congestion network problems and related games
2006,
This paper analyzes network problems with congestion effects from a cooperative game...
An improved probability bound for the Approximate S-Lemma
An improved probability bound for the Approximate S-Lemma
2007,
The purpose of this note is to give a probability bound on symmetric matrices to...
Finding the K best policies in a finite-horizon Markov decision process
Finding the K best policies in a finite-horizon Markov decision process
2006,
Directed hypergraphs represent a general modelling and algorithmic tool, which have...
The island confinement method for reducing search space in local search methods
The island confinement method for reducing search space in local search methods
2007,
Typically local search methods for solving constraint satisfaction problems such as...
A 3-flip neighborhood local search for the set covering problem
A 3-flip neighborhood local search for the set covering problem
2006,
The set covering problem (SCP) calls for a minimum cost family of subsets from n given...
Exploiting relaxation in local search for LABS
Exploiting relaxation in local search for LABS
2007,
Branch-and-bound uses relaxation to prune search trees but sometimes scales poorly to...
Memetic particle swarm optimization
Memetic particle swarm optimization
2007,
We propose a new Memetic Particle Swarm Optimization scheme that incorporates local...
Learning genetic algorithm parameters using hidden Markov models
Learning genetic algorithm parameters using hidden Markov models
2006,
Genetic algorithms (GAs) are routinely used to search problem spaces of interest. A...
Online bin packing of fragile objects with application in cellular networks
Online bin packing of fragile objects with application in cellular networks
2007,
We study a specific bin packing problem which arises from the channel assignment...
A machine learning approach to algorithm selection for NP-hard optimization problems: a case study on the most probable explanation problem
A machine learning approach to algorithm selection for NP-hard optimization problems: a case study on the most probable explanation problem
2007,
Given one instance of an NP -hard optimization problem, can we tell in advance whether...
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
2007,
We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar...
The lower and upper forcing geodetic numbers of block–cactus graphs
The lower and upper forcing geodetic numbers of block–cactus graphs
2006,
A vertex set D in graph G is called a geodetic set if all vertices of G are lying on...
Choices and kernels in bipolar valued digraphs
Choices and kernels in bipolar valued digraphs
2006,
We explore the extension of the notion of kernel (independent, dominant or absorbent,...
Local search algorithms for finding the Hamiltonian completion number of line graphs
Local search algorithms for finding the Hamiltonian completion number of line graphs
2007,
Given a graph G=(V,E) , the Hamiltonian completion number of G , HCN( G ), is the...
Zero-sum stochastic games with stopping and control
Zero-sum stochastic games with stopping and control
2007,
We study a zero-sum stochastic game where each player uses both control and stopping...
Papers per page: