Keyword: optimization

Found 2864 papers in total
Maximal guaranteed result for limited volume of transmitted information
Maximal guaranteed result for limited volume of transmitted information
2011,
Consideration was given to a hierarchical two‐person game with constrained...
Synthesis of a suboptimal controller by output for dampening limited disturbances
Synthesis of a suboptimal controller by output for dampening limited disturbances
2011,
In the framework of the method of invariant ellipsoids, for a linear dynamic object a...
A discrete model for optimal operation of fossil‐fuel generators of electricity
A discrete model for optimal operation of fossil‐fuel generators of electricity
2012,
This paper presents a new discrete approach to the price‐based dynamic economic...
An improved two‐step method for solving generalized Nash equilibrium problems
An improved two‐step method for solving generalized Nash equilibrium problems
2012,
The generalized Nash equilibrium problem (GNEP) is a noncooperative game in which the...
Partnership formation based on multiple traits
Partnership formation based on multiple traits
2012,
A model of partnership formation based on two traits, called beauty and character, is...
On Nonlinear Parametric Search
On Nonlinear Parametric Search
2001,
An alternative viewpoint for parametric search is presented, which achieves a bound...
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems
2001,
In this paper we investigate data structures obtained by a recursive partitioning of...
Constraint‐Based Processing of Multiway Spatial Joins
Constraint‐Based Processing of Multiway Spatial Joins
2001,
A multiway spatial join combines information found in three or more spatial relations...
Automated Displacement for Large Numbers of Discrete Map Objects
Automated Displacement for Large Numbers of Discrete Map Objects
2001,
Effective displacement is achieved by sharing small movements among a group of objects...
Three Rules Suffice for Good Label Placement
Three Rules Suffice for Good Label Placement
2001,
The general label‐placement problem consists in labeling a set of features...
On the Hardness of Approximating Spanners
On the Hardness of Approximating Spanners
2001,
A k ‐spanner of a connected graph G=(V,E) is a subgraph G' consisting of all...
A q ‐Analogue of the Path Length of Binary Search Trees
A q ‐Analogue of the Path Length of Binary Search Trees
2001,
A reformulation of the path length of binary search trees is given in terms of...
Max‐ and Min‐Neighborhood Monopolies
Max‐ and Min‐Neighborhood Monopolies
2002,
Given a graph G=(V,E) and a set of vertices M ⊆ V , a vertex v ∈ V is said...
Budget Management with Applications
Budget Management with Applications
2002,
Given a directed acyclic graph with timing constraints, the budget management problem...
The Complexity of Counting Eulerian Tours in 4‐regular Graphs
The Complexity of Counting Eulerian Tours in 4‐regular Graphs
2012,
We investigate the complexity of counting Eulerian tours (# ET ) and its...
Minimum‐Perimeter Intersecting Polygons
Minimum‐Perimeter Intersecting Polygons
2012,
Given a set 𝒮 of segments in the plane, a polygon P is an intersecting polygon of...
Optimal Polygonal Representation of Planar Graphs
Optimal Polygonal Representation of Planar Graphs
2012,
In this paper, we consider the problem of representing planar graphs by polygons whose...
A stochastic programming model for the optimal issuance of government bonds
A stochastic programming model for the optimal issuance of government bonds
2012,
Sovereign states issue fixed and floating securities to fund their public debt. The...
A framework for optimization under ambiguity
A framework for optimization under ambiguity
2012,
In this paper, single stage stochastic programs with ambiguous distributions for the...
Heuristic optimisation in financial modelling
Heuristic optimisation in financial modelling
2012,
There is a large number of optimisation problems in theoretical and applied finance...
HMM based scenario generation for an investment optimisation problem
HMM based scenario generation for an investment optimisation problem
2012,
The Geometric Brownian motion (GBM) is a standard method for modelling financial time...
On Bellman’s principle with inequality constraints
On Bellman’s principle with inequality constraints
2012,
We consider an example by Haviv (1996) of a constrained Markov decision process that,...
Market price‐based convex risk measures: A distribution‐free optimization approach
Market price‐based convex risk measures: A distribution‐free optimization approach
2012,
In Cont (2006) , a convex risk measure was proposed to measure the impact of...
Solution of the H∞‐optimization problems on the basis of the principle of separation
Solution of the H∞‐optimization problems on the basis of the principle of separation
2012,
A new approach to the design of the central output H ∞ ‐controller was...
Papers per page: