In this work we consider the following NP -hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings that di er maximally in a pre-de ned number of positions. First of all we introduce an integer linear programming model for this problem. Second, two variants of a rather simpl...

In this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the unbalanced minimum common string partition problem. The algorithm, which is labelled Construct, Merge, Solve & Adapt, works on subinstances of the tackled problem instances. At each iteration, the incumbent sub-instance is modified by adding solution components found in prob...

In wireless networks, it is very important to optimize the number of channels, due to the limit on the number of usable channels in a given network. In addition, multimedia services with high QoS requirements with respect to throughput and delay have recently become popular. To satisfy these requirements, it has become important to find a way of providing multipath transmission. A channel assig...

Resum In this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings that differ maximally in a pre-defined number of positions. First of all, we introduce an integer linear programming model for this problem. Second, two variants of a rat...

Resum In this work, we consider the following NP-hard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings that differ maximally in a pre-defined number of positions. First of all, we introduce an integer linear programming model for this problem. Second, two variants of a rat...

6 The focus of this research is on supplying gasoline after a natural disaster. There are two 7 aspects for this work: determination of which gas stations should be provided with generators 8 (among those that do not have electric power) and determination of a delivery scheme that 9 accounts for increased demand due to lack of public transportation and considerations such as 10 equity. We devel...

This paper focuses on coupling of simulation and optimization techniques, both representing an integrated part of modern design and supervision practices in management sciences, industry and engineering. After discussing the different possible connotations of the concept of simulation optimization coupling, we explicitly describe the integration of two commercial-off-the-shelf (COTS) industry-s...

maxsat is an optimization version of satisfiability. Since many practical problems involve optimization, there are a wide range of potential applications for effective maxsat solvers. In this paper we present an extensive empirical evaluation of a number of maxsat solvers. In addition to traditional maxsat solvers, we also evaluate the use of a state-of-the-art Mixed Integer Program (mip) solve...

Planning problems are, in general, PSPACE-complete; large problems, especially multi-agent with required co-ordination, can be intractable or impractical to solve. Factored planning and both address this by separating into tractable sub-problems, but there are limitations the expressivity of existing planners ability handle tightly coupled problems. This paper presents EGOPLAN, a framework whic...

در این پژوهش تقویت باریکه لیزر تپی فمتوثانیه Ti:sapphire ­کننده بازتولیدی با آرایش هندسی Z براساس روش تپ چیرپ بررسی شده است. برای انتقال ورودی اولیه به داخل کاواک و استخراج از دو سلول پاکل استفاده زمان شکل‌گیری برحسب انرژی دمش مطالعه روند تحول مورد قرار گرفته مدت تولید بدون حضور 80 نانوثانیه فرایند 38 نرخ تکرار 10 هرتز طول موج مرکزی 800 نانومتر بیشینه 2 میلی‌ژول بعد 17 رفت برگشت 15 میلی ژول 532...