Catálogo de publicaciones - libros

Compartir en
redes sociales


The Geometry of the Word Problem for Finitely Generated Groups

Noel Brady Tim Riley Hamish Short

Resumen/Descripción – provisto por la editorial

No disponible.

Palabras clave – provistas por la editorial

No disponibles.

Disponibilidad
Institución detectada Año de publicación Navegá Descargá Solicitá
No detectada 2007 SpringerLink

Información

Tipo de recurso:

libros

ISBN impreso

978-3-7643-7949-0

ISBN electrónico

978-3-7643-7950-6

Editor responsable

Springer Nature

País de edición

Reino Unido

Fecha de publicación

Información sobre derechos de publicación

© Birkhäuser Verlag 2007

Cobertura temática

Tabla de contenidos

Free Nilpotent Groups

Noel Brady; Tim Riley; Hamish Short

This paper deals with the lead optimization phase of pharmaceutical research where a number of leads (molecules as a basis for potential drugs) are processed by different departments in order to optimize their biochemical characteristics. We depict each lead as a project and model the problem as a static multi-project selection and scheduling problem under resource constraints with the objective to maximize the weighted work performed. For solving the problem we propose two heuristics. We assess their performance in a computational study and we point out one dominant method. Furthermore we show the impact of problem parameters such as the extend to which projects can be crashed.

Part III - Diagrams and Groups | Pp. 197-199

Hyperbolic-by-free groups

Noel Brady; Tim Riley; Hamish Short

This paper deals with the lead optimization phase of pharmaceutical research where a number of leads (molecules as a basis for potential drugs) are processed by different departments in order to optimize their biochemical characteristics. We depict each lead as a project and model the problem as a static multi-project selection and scheduling problem under resource constraints with the objective to maximize the weighted work performed. For solving the problem we propose two heuristics. We assess their performance in a computational study and we point out one dominant method. Furthermore we show the impact of problem parameters such as the extend to which projects can be crashed.

Part III - Diagrams and Groups | Pp. 201-204