A5028631746- Vehicle Routing Optimization Methods
- Optimization and Packing Problems
- Metaheuristic Optimization Algorithms Research
- Optimization and Search Problems
- Data Management and Algorithms
- Transportation Planning and Optimization
- Chemokine receptors and signaling
- Scheduling and Timetabling Solutions
- Receptor Mechanisms and Signaling
- Graph Theory and Algorithms
- Advanced Graph Theory Research
- Neurobiology and Insect Physiology Research
Vrije Universiteit Amsterdam
1980-2021
University of Amsterdam
1980-1987
Shell (Netherlands)
1987
Background: The atypical chemokine receptor 3 (ACKR3) belongs to the superfamily of G protein-coupled receptors (GPCRs). Unlike classical GPCRs, this does not activate proteins in most cell types but recruits β-arrestins upon activation. ACKR3 plays an important role cancer and vascular diseases. As recruitment is triggered by phosphorylation C-terminal tail we studied different potential sites within C-tail further delineate molecular mechanism internalization trafficking GPCR. Methods: We...
For the distance matrix of symmetric traveling salesman problems a simple transformation into an equivalent asymmetric one is given. Assignment algorithms yield sharper lowerbounds and less subtours from transformed matrix. This implies better performance for based on assignment relaxation.
In 1972 Christofides introduced a lower bound for the Traveling Salesman Problem (TSP). The is based on solving repeatedly Linear Assignment Problem. We relate to Complete Cycle Problem; as consequence correctness of easier prove. Further we give improvements in symmetric case and deal with influence triangle equation together identification non-optimal edges TSP. are illustrated by examples computational results large problems.
Abstract As known in literature a flow-type approach to the Euclidean traveling Sales man Problem gives better assignment lower bounds, using cities on convex hull as sources and sinks. By selecting them carefully this is improved. Further improvements are obtained by (temporarily) omitting cities. Computational results for problems with up 100 show effectiveness of improvements. Keywords: Traveling Salesman Problemflow algorithmslower boundslinear assignmentinteger programmingAMS 1980...