IBM

The Close-Enough Traveling Salesman Problem

Authors: Primary: William Mennell; Co-Author(s): Amy Ciric

Application: Routing

Problem Statement: View Problem Statement (PDF)

BibTeX Reference: BibTeX reference of this problem

Sessions

Date Models Session Description Results Submitter
11/15/2009 15:46 A Nonconvex Combinatorial MINLP View Description (PDF) View Results (PDF) Mennell, William

Model list

Date Model
11/15/2009 19:16 A Nonconvex Combinatorial MINLP