Doctoral student in algorithms, combinatorics, and optimization
Georgia Institute of Technology
I'm interested in the application of combinatorial optimization and operations
research to problems such as robot scheduling, protein folding, and motion planning
through intelligent heuristics, integer and semidefinite optimization,
network algorithms, and random sampling.
(c) All material accessible through this page is copyright by
Justin Melvin and his coauthors and by the corresponding publishers.
Permission is granted for fair use in personal, noncommercial,
and academic projects.
- Justin Melvin, Craig Tovey, Joel Sokol. “Finding Optimal Solutions to Large Contact Map Overlap Instances”, in
revision after submission to INFORMS Journal on Computing
- Justin Melvin, Pinar Keskinocak, Sven Koenig, Craig Tovey, Banu Yuksel Ozkaya.
Coordinating Robot Teams in the Presence of Disjoint Time Windows.
Accepted for IEEE/RSJ 2007 International Conference on Intelligent Robots and Systems
- A. V. Popov, J. Melvin, and R. Hernandez.
"Dynamics of swelling/ contracting hard spheres surmised by an irreversible Langevin equation,"
J. Phys. Chem. A, 110, 1635-1644 (2006). (In the William L. Hase Festschrift issue.)
|
Teaching
|
Summer 2008
- GTA: CS 3101 Barcelona Leap [entrepreneurship] (Barcelona Study Abroad Program)
- GTA: CS 3510 Algorithms (Barcelona Study Abroad Program)
Fall 2004
- Grader: MATH 4317: Real Analysis
|
jmelvin(_AT_)isye.gatech.edu
| Last modified:
July 1st, 2008. |
|