Country: Netherlands

Found 18376 papers in total
A characterization of concordance relations
A characterization of concordance relations
2005,
The notion of concordance is central to many multiple criteria techniques relying on...
Non-differentiable higher-order symmetric duality in mathematical programming with generalized invexity
Non-differentiable higher-order symmetric duality in mathematical programming with generalized invexity
2005,
A pair of non-differentiable higher-order symmetric dual model in mathematical...
A generic view of Dantzig–Wolfe decomposition in mixed integer programming
A generic view of Dantzig–Wolfe decomposition in mixed integer programming
2006,
The Dantzig–Wolfe reformulation principle is presented based on the concept of...
Phase I cycling under the most-obtuse-angle pivot rule
Phase I cycling under the most-obtuse-angle pivot rule
2005,
It has been recently claimed that the most-obtuse-angle pivot rule is one of the best...
A fresh view on the tolerance approach to sensitiviy analysis in linear programming
A fresh view on the tolerance approach to sensitiviy analysis in linear programming
2005,
The tolerance approach to sensitivity analysis in linear programming aims at finding a...
A hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization
A hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization
2001,
Hybrid methods are promising tools in integer programming, as they combine the best...
A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
2006,
In this paper, we approximately solve the multiple-choice multi-dimensional knapsack...
On generalizations of the Frank–Wolfe theorem to convex and quasi-convex programs
On generalizations of the Frank–Wolfe theorem to convex and quasi-convex programs
2006,
In this paper we are concerned with the problem of boundedness and the existence of...
A constraint programming approach to extract the maximum number of non-overlapping test forms
A constraint programming approach to extract the maximum number of non-overlapping test forms
2006,
This paper introduces a novel approach for extracting the maximum number of...
A (1−1/e)-approximation algorithm for the generalized assignment problem
A (1−1/e)-approximation algorithm for the generalized assignment problem
2006,
We give a (1− 1/ e )-approximation algorithm for the max-profit generalized...
A parallel tabu search algorithm for solving the container loading problem
A parallel tabu search algorithm for solving the container loading problem
2003,
This paper presents a parallel tabu search algorithm for the container loading problem...
Parallelization of the scatter search for the p-median problem
Parallelization of the scatter search for the p-median problem
2003,
This article develops several strategies for the parallelization of the metaheuristic...
Hybrid population-based algorithms for the bi-objective quadratic assignment problem
Hybrid population-based algorithms for the bi-objective quadratic assignment problem
2006,
We present variants of an ant colony optimization (MO-ACO) algorithm and of an...
Hybridization of GRASP metaheuristic with data mining techniques
Hybridization of GRASP metaheuristic with data mining techniques
2006,
In this work, we propose a hybridization of GRASP metaheuristic that incorporates a...
COSEARCH: A parallel cooperative metaheuristic
COSEARCH: A parallel cooperative metaheuristic
2006,
In order to design a well-balanced metaheuristic for robustness, we propose the...
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Exact algorithms for the Hamiltonian cycle problem in planar graphs
2006,
We construct an exact algorithm for the Hamiltonian cycle problem in planar graphs...
A note on relatives to the Held and Karp 1-tree problem
A note on relatives to the Held and Karp 1-tree problem
2006,
We study a class of graph problems which includes as special cases the Held and Karp...
A study of Ant Colony Optimization capabilities for solving the maximum clique problem
A study of Ant Colony Optimization capabilities for solving the maximum clique problem
2006,
This paper investigates the capabilities of the Ant Colony Optimization (ACO)...
A multiple objective grouping genetic algorithm for assembly line design
A multiple objective grouping genetic algorithm for assembly line design
2001,
The purpose of this paper is to describe some of the main problems concerning assembly...
Optimal decision rule in forming an insurance portfolio
Optimal decision rule in forming an insurance portfolio
2006,
The paper is devoted to finding an optimal decision rule for accepting/rejecting...
A polynomial case of the parsimony haplotyping problem
A polynomial case of the parsimony haplotyping problem
2006,
The parsimony haplotyping problem was shown to be NP-hard when each genotype had...
Data dependent worst case bounds for weighted set packing
Data dependent worst case bounds for weighted set packing
2005,
We develop data dependent worst case bounds for three simple greedy algorithms for the...
Improved local search algorithms for the rectangle packing problem with general spatial costs
Improved local search algorithms for the rectangle packing problem with general spatial costs
2005,
The rectangle packing problem with general spatial costs is to pack given rectangles...
Evaluating strategic options using decision-theoretic planning
Evaluating strategic options using decision-theoretic planning
2006,
The purpose of this research is to examine whether decision-theoretic planning...
Papers per page: