نتایج جستجو برای: optimal nodal ordering

تعداد نتایج: 417446  

Journal: :Mathematics 2021

To coordinate the supply chain risk caused by demand uncertainty, this paper proposed a flexible return strategy under in which retailer can choose quantity independently put option after selling season, while is usually determined supplier classical strategy. In our novel strategy, exercise price not fixed, and we developed base model of named selective buyback contracts model. We have solved ...

Journal: :DEStech Transactions on Social Science, Education and Human Science 2017

2006
A. Jokic M. Lazar

This article presents a novel control scheme for achieving optimal power balancing and congestion control in electrical energy distribution networks via nodal prices. We develop an explicit controller that guarantees economically optimal steady-state operation while respecting all line flow constraints in steady-state. Due to these constraints, the resulting optimal control law has a piecewise ...

2007
Andrej Jokic Mircea Lazar P. P. J. van den Bosch

This article presents a novel control scheme for achieving optimal power balancing and congestion control in electrical energy transmission networks via nodal prices. We develop an explicit controller that guarantees economically optimal steady-state operation while respecting all line flow constraints in steady-state. Due to these constraints, the resulting optimal control law has a piecewise ...

2009
Yiming Yang Abhimanyu Lad Henry Shu Bryan Kisiel Chad M. Cumby Rayid Ghani Katharina Probst

In many practical applications, multiple interrelated tasks must be accomplished in sequential order through user interactions with multiple retrieval, classification and recommendation systems. The ordering of the tasks may have a significant impact on the overall utility (or performance); hence optimal ordering of tasks is desirable. However, manual specification of near-optimal ordering is o...

2011
Md. Mostofa Ali Patwary Assefaw Hadish Gebremedhin Alex Pothen

We present new multithreaded vertex ordering and distance-k graph coloring algorithms that are well-suited for multicore platforms. The vertex ordering techniques rely on various notions of “degree”, are known to be effective in reducing the number of colors used by a greedy coloring algorithm, and are generic enough to be applicable to contexts other than coloring. We employ approximate degree...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید