Country: Netherlands

Found 18376 papers in total
Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
2005,
We address the weighted max-cut problem, or equivalently the problem of maximizing a...
Applying the minimax criterion in stochastic recourse programs
Applying the minimax criterion in stochastic recourse programs
2005,
We consider an optimization problem in which some uncertain parameters are replaced by...
Stabilization of Mehrotra's primal–dual algorithm and its implementation
Stabilization of Mehrotra's primal–dual algorithm and its implementation
2005,
In this paper we apply a stabilization procedure proposed by...
Symmetric duality in multiobjective programming involving generalized cone-invex functions
Symmetric duality in multiobjective programming involving generalized cone-invex functions
2005,
In this paper, cone-pseudoinvex and strongly cone-pseudoinvex functions are defined. A...
Multiobjective second-order symmetric duality with F-convexity
Multiobjective second-order symmetric duality with F-convexity
2005,
We suggest a pair of second-order symmetric dual programs in multiobjective nonlinear...
Cone complementarity problems with finite solution sets
Cone complementarity problems with finite solution sets
2006,
We introduce the notion of a complementary cone and a nondegenerate linear...
Inventory placement in acyclic supply chain networks
Inventory placement in acyclic supply chain networks
2006,
By adding a set of redundant constraints, and by iteratively refining the...
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
2006,
The aim of this paper is to emphasize some remarkable properties of multicriteria...
Partial convexification cuts for 0–1 mixed-integer programs
Partial convexification cuts for 0–1 mixed-integer programs
2005,
In this research, we propose a new cut generation scheme based on constructing a...
A semidefinite programming based polyhedral cut and price approach for the maxcut problem
A semidefinite programming based polyhedral cut and price approach for the maxcut problem
2006,
We investigate solution of the maximum cut problem using a polyhedral cut and price...
On the robust assignment problem under a fixed number of cost scenarios
On the robust assignment problem under a fixed number of cost scenarios
2006,
We investigate the complexity of the min–max assignment problem under a fixed...
A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
2005,
This paper presents an empirical study on the efficiency of the simulated annealing...
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
2006,
The aim of this paper is to emphasize some remarkable properties of multicriteria...
Augmented Lagrangian function, non-quadratic growth condition and exact penalization
Augmented Lagrangian function, non-quadratic growth condition and exact penalization
2006,
In this paper, under the assumption that the perturbation function satisfies a growth...
Polynomial approximation algorithms with performance guarantees: An introduction-by-example
Polynomial approximation algorithms with performance guarantees: An introduction-by-example
2005,
We present a short overview on polynomial approximation of NP-hard problems. We...
The competitive salesman problem on a network: a worst-case approach
The competitive salesman problem on a network: a worst-case approach
2006,
We provide a complexity analysis of the problem of optimal routing of a server on a...
Threshold based discounting networks: The cost allocation provided by the nucleolus
Threshold based discounting networks: The cost allocation provided by the nucleolus
2005,
We consider a cost allocation problem in communication networks with threshold based...
Distribution network design: New problems and related models
Distribution network design: New problems and related models
2005,
We study some complex distribution network design problems, which involve facility...
Evolutionary algorithms for periodic arc routing problems
Evolutionary algorithms for periodic arc routing problems
2005,
The capacitated arc routing problem (CARP) involves the routing of vehicles to treat a...
Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
2005,
This paper presents an improved version of a componentwise bounding algorithm for the...
Creating very large scale neighborhoods out of smaller ones by compounding moves
Creating very large scale neighborhoods out of smaller ones by compounding moves
2006,
This paper discusses neighborhood search algorithms where the size of the neighborhood...
Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?
Maximum satisfiability: How good are tabu search and plateau moves in the worst-case?
2005,
Tabu search algorithms are amongst the most successful local search based methods for...
Finding the K shortest hyperpaths using reoptimization
Finding the K shortest hyperpaths using reoptimization
2006,
We present some reoptimization techniques for computing (shortest) hyperpath weights...
Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm
Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm
2006,
Producing clear and intelligible layouts of hierarchical digraphs knows a renewed...
Papers per page: