Irina Ioachim

Learn More
This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm which takes into account the linear node costs. This problem(More)
This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft ̄eet assignment and routing problems and it proposes an optimal solution approach. This approach is based on Dantzig±Wolfe decomposition/column generation. The resulting master problem consists of ̄ight covering constraints, as in(More)
Objective: To assess the prognostic significance of angiogenesis parameters such as microvessel density (MVD) and vascular endothelial growth factor (VEGF) in superficial bladder cancer. Patients and methods: We studied 127 superficial bladder cancer samples immunohistochemically for the above factors. We compared them with standard clinicopathological(More)
  • 1