Country: Netherlands

Found 18376 papers in total
Basic adjoint relation for transient and stationary analysis of some Markov processes
Basic adjoint relation for transient and stationary analysis of some Markov processes
1999,
The basic adjoint relation was first introduced by Harrison and Williams to...
A parallel algorithm for the vehicle routing problem with time window constraints
A parallel algorithm for the vehicle routing problem with time window constraints
1999,
In this paper, we describe a new parallel tabu search heuristic for the vehicle...
Revisiting the state transition frequency formula
Revisiting the state transition frequency formula
1999,
In this paper, we give a new proof of the transition frequency formula for the state...
Routing straddle carriers for the loading operation of containers using a beam search algorithm
Routing straddle carriers for the loading operation of containers using a beam search algorithm
1999,
This paper discusses how to route straddle carriers during the loading operation of...
Analysis of fault location in a network
Analysis of fault location in a network
1999,
We review and analyze a formal problem of fault location in point-to-point...
The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexed model
The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexed model
1999,
The Capacitated Minimal Spanning Tree Problem (CMSTP) is to find a minimal spanning...
Minimal cost linkages in graphs
Minimal cost linkages in graphs
1999,
In this paper, we consider the problem of finding minimal cost linkages in graphs. We...
Model development for deteriorating inventory in material requirement planning systems
Model development for deteriorating inventory in material requirement planning systems
1999,
The purpose of this study is to develop an optimal replenishment policy for...
Genetic algorithms and network ring design
Genetic algorithms and network ring design
1999,
Optimal network ring design is a difficult problem characterised by the requirement to...
An efficient approximation algorithm for the survivable network design problem
An efficient approximation algorithm for the survivable network design problem
1998,
The survivable network design problem is to construct a minimum-cost subgraph...
A heuristic technique for generating minimal path and cutsets of a general network
A heuristic technique for generating minimal path and cutsets of a general network
1999,
Reliability evaluation techniques employ a variety of tools for system modeling and...
A linear programming model of diet choice of free-living beavers
A linear programming model of diet choice of free-living beavers
1995,
Linear programming has been remarkably successful in predicting the diet choice of...
Daily activity rhythms in adult Odonata examined with a dynamic programming model
Daily activity rhythms in adult Odonata examined with a dynamic programming model
1998,
I parameterize for adult male Odonata a published dynamic programming model which...
A simulated annealing code for general integer linear programs
A simulated annealing code for general integer linear programs
1999,
This paper explores the use of simulated annealing (SA) for solving arbitrary...
Simulated jumping
Simulated jumping
1999,
This paper describes a novel approach for solving combinatorial optimisation problems...
An econometric analysis of development dynamics in modern Chinese industry
An econometric analysis of development dynamics in modern Chinese industry
1999,
The aim of this paper is to develop an analytic representation of Chinese labor...
Logical analysis of Chinese labor productivity patterns
Logical analysis of Chinese labor productivity patterns
1999,
Using data published by the Chinese Statistical Bureau, an elaborated version of the...
Estimating the performance of Sino–Hong Kong joint ventures using neural network ensembles
Estimating the performance of Sino–Hong Kong joint ventures using neural network ensembles
1999,
Prediction of the performance of international joint ventures remains a relatively...
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
1998,
This paper investigates a restricted version of the Quadratic Assignment Problem...
Exact solution of bin-packing problems using column generation and branch-and-bound
Exact solution of bin-packing problems using column generation and branch-and-bound
1999,
We explore an arc flow formulation with side constraints for the one-dimensional...
A comparison of unconstrained and constrained ordinary least squares for the combination of demand forecasts: A case study of the ordering and stocking of bank printed forms
A comparison of unconstrained and constrained ordinary least squares for the combination of demand forecasts: A case study of the ordering and stocking of bank printed forms
1999,
A leading bank in Hong Kong consumes more than three hundred kinds of printed forms...
Introduction of a new class of variables to discrete and integer programming problems
Introduction of a new class of variables to discrete and integer programming problems
1999,
In formulating a combinatorial optimisation problem (COP) using Discrete or Integer...
Modeling Shanghai stock market volatility
Modeling Shanghai stock market volatility
1999,
There is considerable quantitative research on stock market volatility...
On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function
On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function
1999,
An approach to the sensitivity analysis for discrete optimization problems with...
Papers per page: