Country: Netherlands

Found 18376 papers in total
Review of nonlinear mixed-integer and disjunctive programming techniques
Review of nonlinear mixed-integer and disjunctive programming techniques
2002,
This paper has as a major objective to present a unified overview and derivation of...
A technical review of column generation in integer programming
A technical review of column generation in integer programming
2001,
This paper provides a technical review of topics relevant to applying column...
Genetic algorithms with double strings for 0–1 programming problems
Genetic algorithms with double strings for 0–1 programming problems
2003,
In this paper, genetic algorithms with double strings for 0–1 knapsack problems...
An interactive goal programming procedure for operational recovery problems
An interactive goal programming procedure for operational recovery problems
2002,
We propose an interactive Goal Programming (GP) for operational recovery problems that...
A goal programming procedure for solving problems with multiple fuzzy goals using dynamic programming
A goal programming procedure for solving problems with multiple fuzzy goals using dynamic programming
2003,
This paper describes how the preemptive priority based goal programming (GP) can be...
Stochastic Dynamic Programming
Stochastic Dynamic Programming
2002,
This paper gives a general introduction to stochastic dynamic programming, using...
Minimum effort approximation of the Pareto space of convex bi-criteria problems
Minimum effort approximation of the Pareto space of convex bi-criteria problems
2003,
One of the major issues facing design practitioners using multiple-criteria...
A global optimization approach to classification
A global optimization approach to classification
2002,
We reduce the classification problem to solving a global optimization problem and a...
A combined convex approximation–interior point approach for large scale nonlinear programming
A combined convex approximation–interior point approach for large scale nonlinear programming
2001,
The method of moving asymptotes and its globally convergent extension SCP (sequential...
Generalized invex monotonicity
Generalized invex monotonicity
2003,
In this paper the generalized invex monotone functions are defined as an extension of...
Solving large mixed integer nonlinear programming problems on computational grids
Solving large mixed integer nonlinear programming problems on computational grids
2002,
We consider the solution of Mixed Integer Nonlinear Programming (MINLP) problems by a...
Optimality condition and Branch and Bound algorithm for constrained redundancy optimization in series systems
Optimality condition and Branch and Bound algorithm for constrained redundancy optimization in series systems
2002,
This paper considers the constrained redundancy optimization problem in series...
Are branch and bound and A* algorithms identical?
Are branch and bound and A* algorithms identical?
2003,
Heuristic Search and Branch and Bound algorithms have many similarities. In this...
What is simulated annealing?
What is simulated annealing?
2001,
Beginning in 1983, simulated annealing was marketed as a global optimization...
Tabu Machine: a new neural network solution approach for combinatorial optimization problems
Tabu Machine: a new neural network solution approach for combinatorial optimization problems
2003,
A new artifical neural network solution approach is proposed to solve combinatorial...
Bounds and heuristics for the shortest capacitated paths problem
Bounds and heuristics for the shortest capacitated paths problem
2002,
Given a graph G , the Shortest Capacitated Paths Problem (SCPP) consists of...
Dynamic shortest path in stochastic dynamic networks: ship routing problem
Dynamic shortest path in stochastic dynamic networks: ship routing problem
2003,
In this paper, we apply the stochastic dynamic programming to find the dynamic...
Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
2003,
This paper considers the problem of finding the shortest path in a dynamic network,...
A heuristic algorithm for the mixed Chinese Postman Problem
A heuristic algorithm for the mixed Chinese Postman Problem
2002,
The Chinese Postman Problem (CPP) is to find a minimum-cost Eulerian tour in a given...
Obtaining a good primal solution to the uncapacitated transportation problem
Obtaining a good primal solution to the uncapacitated transportation problem
2003,
Sharma and Sharma have given a new procedure to solve the dual of the well-known...
An augmented Lagrangian algorithm for large scale multicommodity routing
An augmented Lagrangian algorithm for large scale multicommodity routing
2004,
The linear multicommodity network flow (MCNF) problem has many applications in the...
Planar Manhattan local minimal and critical networks
Planar Manhattan local minimal and critical networks
2002,
The authors consider a version of the minimum Steiner tree problem for the l 1...
Guided local search for final placement in VLSI design
Guided local search for final placement in VLSI design
2003,
The design of a very large scale integration circuit consists of two main parts:...
Tournament competition and its merits for coevolutionary algorithms
Tournament competition and its merits for coevolutionary algorithms
2003,
In a competitive coevolutionary algorithm, the competition strategy, selecting...
Papers per page: