Algorithm creation and optimization for the crew pairing problem

The optimization problem of a pseudo-Boolean function is NP-hard, even when the objective function is quadratic; this is due to the fact that the problem encompasses several

This condition, related to the normal component on ∂D of the ∂-operator, permits us to study the Neumann problem for pluriharmonic functions and the ∂-problem for (0, 1)-forms on D

A transitive map on a graph has positive topological entropy and dense set of periodic points (except for an irrational rotation on the

Van Bee, (2005), Water Resources Systems Planning and Management: An Introduction to Methods, Models and Applications, Studies and Reports in Hydrology, ISBN 92-3-103998-9,

Improving the Multi-Restart Local Search Algorithm by Permutation Matrices and Sorted Completion Times for the Flow Shop Scheduling

Para el estudio de este tipo de singularidades en el problema de Muskat, consideraremos el caso unif´ asico, esto es, un ´ unico fluido en el vac´ıo con µ 1 = ρ 1 = 0.. Grosso modo,

To do this, we first obtain numerical evidence (see Section 13.2 in Chapter 13) and then we prove with a computer assisted proof (see Section 13.4) the existence of initial data

It seems that in terms of asymptotic orbits the global dynamics of the model with linear demand function and constant marginal costs has very simple dynamics, either it goes to