Results 271 to 280 of about 52,409 (312)
Some of the next articles are maybe not open access.
Optimality conditions for discrete optimal control problems
Optimization Methods and Software, 2007Discrete optimal control problems with variable endpoints and with equality type constraints on the control are considered. We derive first-and second-order necessary optimality conditions, which are meaningful under the assumptions weaker than those previously used in the literature.
openaire +1 more source
A generic problem instance generator for discrete optimization problems
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018Measuring the performance of an optimization algorithm involves benchmark instances of related problems. In the area of discrete optimization, most well-known problems are covered by a large variety of problem instances already. However, while exploring the area of lesser-known optimization problems there is usually not a sufficient amount or variety ...
Markus Ullrich +3 more
openaire +1 more source
Parallel search in discrete optimization problems
Simulation Practice and Theory, 1996Abstract We present two generic schemes for heuristic depth-first search on highly parallel MIMD systems. The first one employs a task attraction scheme, where the work packets are generated by splitting the donor's node stack. This stack-splitting scheme works efficiently on architectures with a small communication diameter and/or a moderate ...
openaire +1 more source
Stability of discrete optimization problems
Cybernetics and Systems Analysis, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kozeratskaya, L. N. +2 more
openaire +1 more source
A discrete optimal control problem
IEEE Transactions on Automatic Control, 1966A certain class of discrete optimization problems is investigated using the framework of nonlinear programming. It is shown that a discrete maximum principle similar to the Pontryagin maximum principle is valid for a subclass of these problems, specifically systems with linear dynamics, convex inequality constraints and convex performance criteria ...
J. Pearson, R. Sridhar
openaire +1 more source
Finite State Representations of Discrete Optimization Problems
SIAM Journal on Computing, 1973This paper is concerned with the representation of a discrete optimization problem given in the form of a $ddp$ (discrete decision process) by a G-$sdp$ (G-sequential decision process). A G-$sdp$ is a finite state model of discrete optimization problem, consisting of a finite number of states and a rule specifying the transition from one state to ...
openaire +2 more sources
Discrete Global Optimization Problems with a Modified Discrete Filled Function
Journal of the Operations Research Society of China, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Yong-Jian +2 more
exaly +2 more sources
Probabilistic Analysis of Discrete Optimization Problems
2004We investigate the performance of exact algorithms for hard optimization problems under random inputs. In particular, we prove various structural properties that lead to two general average-case analyses applicable to a large class of optimization problems.
openaire +3 more sources
A new approach to discrete stochastic optimization problems
European Journal of Operational Research, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaocang Lin, Loo Hay Lee
openaire +2 more sources
Discrete Particle Swarm Optimization for the Orienteering Problem
IEEE Congress on Evolutionary Computation, 2010In this paper a novel discrete Particle Swarm Optimization (PSO) algorithm is proposed to solve the Orienteering Problem (OP). Discrete evolution is achieved by re-defining all operators and operands used in PSO. To obtain better results, Strengthened-PSO which improves both exploration and exploitation during the search process is employed for ...
Aise Zülal Sevkli +1 more
openaire +1 more source