DocumentCode :
3313398
Title :
Problem Reduction Graph Model for Discrete Optimization Problems
Author :
Zheng, Yujun ; Xue, Jinyun
Author_Institution :
State Key Lab. of Comput. Sci., Chinese Acad. of Sci., Beijing, China
Volume :
2
fYear :
2010
fDate :
28-31 May 2010
Firstpage :
190
Lastpage :
194
Abstract :
The paper proposes the problem reduction graph (PRG), an abstract model for discrete optimization problems which uses structural decomposition to reduce problem complexity and constructs the recurrence relations between the problem and its sub problems. We develop several important algorithm patterns for PRG construction, each leading to a special class of concrete problem-solving algorithms in a systematic way. The model supports logical transformation from specifications to algorithmic programs by deductive inference, and thus significantly promotes the automation and reusability of algorithm design.
Keywords :
algorithm theory; discrete systems; graph theory; inference mechanisms; optimisation; problem solving; algorithm design reusability; algorithmic program; deductive inference; discrete optimization problem; logical transformation; problem reduction graph model; problem solving algorithm; structural decomposition; Computer aided instruction; Conference management; Costs; Electronic mail; Inventory management; Logistics; Marketing and sales; Supply chain management; Supply chains; Technology management; algorithm derivation; combinatorial optimization; problem reduction graph (PRG);
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Science and Optimization (CSO), 2010 Third International Joint Conference on
Conference_Location :
Huangshan, Anhui
Print_ISBN :
978-1-4244-6812-6
Electronic_ISBN :
978-1-4244-6813-3
Type :
conf
DOI :
10.1109/CSO.2010.202
Filename :
5533056
Link To Document :
بازگشت