Russell W. Bent

Numerical Analysis · 2003–2017

A researcher in the Science corpus: 5 papers; trusts 12 researchers and is trusted by 13 researchers here, as inferred from the citation graph.

Subfields

• Numerical Analysis — 17 citations into it
• Computational Theory and Mathematics — 13 citations into it
• Electrical and Electronic Engineering — 10 citations into it
• Industrial and Manufacturing Engineering — 10 citations into it; #198 of 2,521 by trust here, #896 by citations
• Automotive Engineering — 5 citations into it; #216 of 3,081 by trust here, #1,511 by citations
• Computer Networks and Communications — 5 citations into it
• Computer Vision and Pattern Recognition — 5 citations into it

Whom Russell W. Bent trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Olli Bräysy
2. Pascal Van Hentenryck
3. Fred W. Glover
4. Jean-François Cordeau
5. Gilbert Laporte
6. Michel Gendreau
7. Manuel Laguna
8. Johan Efberg
9. Andrew Lim
10. Michael Grant

Who trusts Russell W. Bent overall

1. David Pisinger
2. Yiyo Kuo
3. Stefan Røpke
4. Olli Bräysy
5. Pascal Van Hentenryck
6. Michel Gendreau
7. Gerardo Berbeglia
8. Ulrike Ritzinger
9. Jean-François Cordeau
10. Jakob Puchinger

Papers from Russell W. Bent's perspective

Ordered by how strongly the researchers Russell W. Bent trusts endorse each paper. Same corpus, a different order for every researcher.

1. Tabu Search
2. A dynamic model and parallel tabu search heuristic for real-time ambulance relocation (Parallel Computing)
3. Optimization by Simulated Annealing
4. A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows (INFORMS journal on computing)
5. A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows (Transportation Science)
6. A unified tabu search heuristic for vehicle routing problems with time windows (Journal of the Operational Research Society)
7. YALMIP : a toolbox for modeling and optimization in MATLAB
8. A metaheuristic for the pickup and delivery problem with time windows (Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001)
9. Solving the pickup and delivery problem with time windows using reactive tabu search
10. GAMS -- A User's Guide

Their papers

• PowerModels.J1: An Open-Source Framework for Exploring Power Flow Formulations (2017) — 303 citations
• Polyhedral approximation in mixed-integer convex optimization (2016) — 64 citations
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers (2004) — 515 citations
• A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows (2004) — 398 citations
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (2003) — 302 citations