Effective heuristic methods for finding non-optimal solutions of interest in constrained optimization models
This paper introduces the SoI problem, that of finding nonoptimal solutions of interest for constrained optimization models. SoI problems subsume finding FoIs (feasible solutions of interest), and IoIs (infeasible solutions of interest). In all cases, the interest addressed is post-solution analysis...
محفوظ في:
المؤلفون الرئيسيون: | KIMBROUGH, Steven O., KUO, Ann, LAU, Hoong Chuin |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2010
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/355 https://ink.library.smu.edu.sg/context/sis_research/article/1354/viewcontent/effective_heuristic_methods_1.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Singapore Management University |
اللغة: | English |
مواد مشابهة
-
On decision support for deliberating with constraints in constrained optimization models
بواسطة: KIMBROUGH, Steven O., وآخرون
منشور في: (2010) -
Branch Distance Optimization of Structured Programs
بواسطة: Powell, P., وآخرون
منشور في: (1990) -
The feasibility of setting up a candle factory in Imus, Cavite
بواسطة: Marjes, Homer Alano
منشور في: (1969) -
Finding Constrained Frequent Episodes Using Minimal Occurrences
بواسطة: MA, Xi, وآخرون
منشور في: (2004) -
Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring
بواسطة: Halldorsson, Magnus M., وآخرون
منشور في: (1997)