Titlebook: Combinatorial Optimization; Third International Pierre Fouilhoux,Luis Eduardo Neves Gouveia,Vangel Conference proceedings 2014 Springer In

Tidious

nonplus

熄灭

CONE

https://doi.org/10.1007/978-3-642-71087-2d from sequencing data, aim to reconstruct the complete genomes by inserting a collection of missing genes. More precisely, in the first problem, called ., we are given an incomplete genome . and a complete genome ., and we look for the insertion of missing genes into . with the goal of maximizing t

有恶意

N. Rotman,F. Michot,J. M. Hay,P. L. Fagniezin these trees are also node disjoint. Accordingly, . spanning trees are totally independent if they are pairwise totally independent. The problem of finding . totally independent spanning trees (KTIST) or proving that no such trees do exist is NP-Complete. We investigate KTIST and an optimization p

Dysplasia

Z. Cohen,R. Wassef,S. Nordgren,R. Silvermanks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in the framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain, .). In such context, we design efficient polynomial-time approximati

opportune

咆哮

Z. Cohen,R. Wassef,S. Nordgren,R. Silverman a subset of a set which maximizes a measure of dispersion/similarity between elements. To tackle the problem a two phases hybrid heuristic combining a mixed integer non linear solver and a local branching procedure is developed. Computational results, performed on literature instances, show that th

alleviate

Z. Cohen,R. Wassef,S. Nordgren,R. Silvermanmakespan. This problem is known to be ordinary .-hard and the current state of the art algorithms can solve instances with up to . jobs. We introduce a constraint generation approach to the integer linear programming (ILP) formulation of the problem according to which the constraints associated with

减震

Very Special and Difficult Cases into an edge-weighted graph ., ., where the cost of . is the distance between . and .. The . asks, for given . and ., to find a placement . such that the cost of a resulting shortest .-path in . is minimum among all graphs .. The . asks to find a placement . such that the cost of a resulting minimu