نتایج جستجو برای: multiple choice knapsack

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

Journal: :CoRR 2015
Mark Sh. Levin

The paper focuses on a new class of combinatorial problems which consists in restructuring of solutions (as sets/structures) in combinatorial optimization. Two main features of the restructuring process are examined: (i) a cost of the restructuring, (ii) a closeness to a goal solution. Three types of the restructuring problems are under study: (a) one-stage structuring, (b) multi-stage structur...

Journal: :CoRR 2013
Mark Sh. Levin

The paper briefly describes a basic set of special combinatorial engineering frameworks for solving complex problems in the field of hierarchical modular systems. The frameworks consist of combinatorial problems (and corresponding models), which are interconnected/linked (e.g., by preference relation). Mainly, hierarchical morphological system model is used. The list of basic standard combinato...

Journal: :Informatica, Lith. Acad. Sci. 2005
Mark Sh. Levin Moshe A. Danieli

The article describes a hierarchical decision making framework for the evaluation and improvement/redesign of composite systems. The framework is based on Hierarchical Morphological Multicriteria Design (HMMD) and corresponding morphological clique problem which realize “partitioning/synthesis macroheuristic”. The system evaluation process consists in hierarchical integration of expert judgment...

Journal: :Operations Research 2006
Alberto Ceselli Giovanni Righini

The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with different costs. We present a branch-and-price algorithm that is the first exact algorithm for the MGAP. It is based on a decomposition into a master problem with set-partitioning constraints and a pricing subproblem tha...

Journal: :Fundamenta Mathematicae 1962

Journal: :Journal of the Experimental Analysis of Behavior 1982

2004
LAWRENCE V. SNYDER MARK S. DASKIN

The two most widely considered measures for optimization under uncertainty are minimizing expected cost and minimizing worst-case cost or regret. In this paper, we present a novel robustness measure that combines the two objectives by minimizing the expected cost while bounding the relative regret in each scenario. In particular, the models seek the minimum-expected-cost solution that is p-robu...

2015
Giulio Bartoli Romano Fantacci Dania Marabissi Daniele Tarchi Andrea Tassi

The most recent trend in the Information and Communication Technology (ICT) world is toward an ever growing demand of mobile heterogeneous services that imply the management of different Quality of Service (QoS) requirements and priorities among different type of users. The Long Term Evolution (LTE)/LTE-Advanced standards have been introduced aiming to cope with this challenge. In particular th...

2005
Tao Yu Kwei-Jay Lin

One of the promises of the service-oriented architecture (SOA) is that complex services can be composed using individual services. Individual services can be selected and integrated either statically or dynamically based on the service functionalities and performance constraints. For many distributed applications, the runtime performance (e.g. end-to-end delay, cost, reliability and availabilit...

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

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