Sciweavers

3221 search results - page 305 / 645
» Termination of Linear Programs
Sort
View
DISOPT
2008
113views more  DISOPT 2008»
15 years 6 months ago
The inverse 1-median problem on a cycle
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...
AMAI
2006
Springer
15 years 6 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
AUTOMATICA
2006
97views more  AUTOMATICA 2006»
15 years 6 months ago
Receding horizon control applied to optimal mine planning
In this paper we show that the problem of optimal mine planning can be cast in the framework of receding horizon control. Traditional formulations of this problem have cast it in ...
Graham C. Goodwin, María M. Seron, Richard ...
EOR
2006
94views more  EOR 2006»
15 years 6 months ago
Portfolio rebalancing model with transaction costs based on fuzzy decision theory
The fuzzy set is one of the powerful tools used to describe an uncertain environment. As well as quantifying any potential return and risk, portfolio liquidity is taken into accou...
Yong Fang, K. K. Lai, Shouyang Wang
MSS
2008
IEEE
118views Hardware» more  MSS 2008»
15 years 6 months ago
Computing the minimal covering set
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
Felix Brandt, Felix A. Fischer