This paper deals with the strongly NP-hard minmax regret version of the minimum spanning tree problem with interval costs. The best known exact algorithms solve the problem in reasonable time for rather small graphs. In this paper an algorithm based on the idea of tabu search is constructed. Some properties of the local minima are shown. Exhaustive computational tests for various classes of gra...

Determining amino acid sequences of protein molecules is one of the most important issues in molecular biology. These sequences determine protein structure and functionality. Unfortunately, direct biochemical methods for reading amino acid sequences can be used for reading short sequences only. This is the reason, which makes peptide assembly algorithms an important complement of these methods....

We define tropical Psi-classes on M 0,n (R 2 , d) and consider intersection products of Psi-classes and pull-backs of evaluations on this space. We show a certain WDVV equation which is sufficient to prove that tropical numbers of curves satisfying certain Psi-and evaluation conditions are equal to the corresponding classical numbers. We present an algorithm that generalizes Mikhalkin's lattice...

Optimal power flow is the most complicated economical problem in power system operation. This is due to the nonlinearity of load flow equations and constraints on voltage, thermal limits and angle and voltage stability. The objective of this problem is to distribute system loads among generators with minimum cost while achieving all equality and inequality constraints. Nowadays, meta heuristic ...

This paper deals with the assembly line balancing issue. The considered objective is to minimize weighted sum of products’ cycle times. originality this that it generalization time minimization used in single-model lines (SALBP) multi-model case (MALBP). An optimization algorithm made a heuristic and tabu-search method presented evaluated through an experimental study carried out on several var...

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...