Journal: Control and Cybernetics

Found 138 papers in total
The corridor method: a dynamic programming inspired metaheuristic
The corridor method: a dynamic programming inspired metaheuristic
2006,
This paper presents a dynamic programming inspired metaheuristic called Corridor...
Dynamic programming in constrained Markov decision processes
Dynamic programming in constrained Markov decision processes
2006,
A discounted Markov Decision Process (MDP) is considered, supplemented with the...
A timed Petri net framework to find optimal IRIS schedules
A timed Petri net framework to find optimal IRIS schedules
2006,
IRIS (increasing reward with increasing service) real-time scheduling appears...
Time Petri nets state space reduction using dynamic programming
Time Petri nets state space reduction using dynamic programming
2006,
In this paper a parametric description for the state space of an arbitrary Timed Petri...
Dijkstra's algorithm revisited: the dynamic programming connexion
Dijkstra's algorithm revisited: the dynamic programming connexion
2006,
Dijkstra's Algorithm is one of the most popular algorithms in computer science. It is...
Second derivative and sufficient optimality conditions for shape functionals
Second derivative and sufficient optimality conditions for shape functionals
2000,
For some heuristic approaches to boundary variation in shape optimization the...
On the choice of statistical model for one-dimensional P-algorithms
On the choice of statistical model for one-dimensional P-algorithms
2000,
Algorithms based on statistical models compete favourably with other global...
Tabu search: global intensification using dynamic programming
Tabu search: global intensification using dynamic programming
2006,
Tabu search has proven highly successful in solving hard combinatorial optimization...
Two-dimensional Newton's problem of minimal resistance
Two-dimensional Newton's problem of minimal resistance
2006,
Newton's problem of minimal resistance is one of the first problems of optimal...
Dynamic programming: an overview
Dynamic programming: an overview
2006,
Dynamic programming is one of the major problem-solving methodologies in a number of...
Approximating the solution of a dynamic, stochastic multiple knapsack problem
Approximating the solution of a dynamic, stochastic multiple knapsack problem
2006,
The model is analysed of an environment where orders arrive probabilistically over...
Canonical greedy algorithms and dynamic programming
Canonical greedy algorithms and dynamic programming
2006,
There has been little work on how to construct greedy algorithms to solve new...
Adaptive resource allocation to stochastic multimodal projects: a distributed platform implementation in Java
Adaptive resource allocation to stochastic multimodal projects: a distributed platform implementation in Java
2006,
This paper presents the implementation of the dynamic programming model (introduced in...
DP2PN2Solver: A flexible dynamic programming solver software tool
DP2PN2Solver: A flexible dynamic programming solver software tool
2006,
Dynamic programming (DP) is a very general optimization technique, which can be...
Nonessential objective functions in linear multiobjective optimization problems
Nonessential objective functions in linear multiobjective optimization problems
2006,
In multiobjective (vector) optimization problems, among the given objective functions...
A deterministic approach to the Skorokhod problem
A deterministic approach to the Skorokhod problem
2006,
An existence and uniqueness result for the solutions to the Skorokhod problem on...
A differential motion planning algorithm for controlling multi-robot systems handling a common object
A differential motion planning algorithm for controlling multi-robot systems handling a common object
2000,
Multi-robot systems have substantially increased capabilities over single robots and...
Sensitivity analysis of a bond portfolio model for the Italian market
Sensitivity analysis of a bond portfolio model for the Italian market
2000,
Management of bond portfolio is formulated as a multiperiod scenario-based stochastic...
Dynamic flows with supply and demand
Dynamic flows with supply and demand
2000,
We are given a network G = (N, A, h, c) with node set N, arch set A, time function h,...
Power network design
Power network design
1996,
An electrical power network design problem is presented, formulated as a Capacitated...
Simulated annealing applied to the total tardiness problem
Simulated annealing applied to the total tardiness problem
1996,
Performance of Simulated Annealing (SA) as a heuristic on the well known total...
The modeling and solution of a class of dial-a-ride problems using simulated annealing
The modeling and solution of a class of dial-a-ride problems using simulated annealing
1996,
A new mixed integer linear programming mathematical model of the dial-a-ride problem...
Another simplex-type method for large scale linear programming
Another simplex-type method for large scale linear programming
1996,
A method is proposed for solving large sparse linear programs. Unlike the well-known...
Higher order primal–dual interior point method for separable convex quadratic optimization
Higher order primal–dual interior point method for separable convex quadratic optimization
1996,
The higher order primal–dual method for linear programming is extended to the...
Papers per page: