Skip to content

“Traveling Salesman Problem”

1 post and 0 papers with this tag.

Blog posts

What does it cost to see the world? Optimizing a flexible multi-stop flight search

10 min read

Fix only your home airport, list the cities you want to visit, and let a time-expanded traveling-salesman model pick the cheapest order and dates. We use it to price two bucket-list trips: the world's 10 most-visited cities and the New 7 Wonders.

All tags

Optimization (5)Global optimization (4)Pooling problem (3)Sudoku (2)Convex hull (2)Branch-and-bound (2)Bilinear programming (2)Nonlinear programming (2)Blending (2)Subway Challenge (1)New York City (1)Travel (1)Flights (1)Traveling Salesman Problem (1)Spelling Bee (1)Games (1)New York Times (1)Mathematics Genealogy Project (1)Network Science (1)Data Science (1)Glassdoor (1)Naval Ravikant (1)Combinatorics (1)Interviews (1)Multiplicative program (1)Binary-encoding (1)Multi-objective optimization (1)Multi-linear optimization (1)Mixed integer second order cone programming (1)Energy storage sharing (1)Robust optimization (1)Piecewise McCormick relaxation (1)Nash bargaining solution (1)Biobjective mixed integer linear programming (1)Mixed-integer programming (1)Rolling horizon (1)Production scheduling (1)Shale oil (1)Hydraulic fracturing (1)Extended formulation (1)Bilinear (1)Quadratic (1)Boolean quadric polytope (1)Disjunctive programming (1)Generalized disjunctive programming (1)Pooling (1)Operations research (1)Computational complexity (1)Polynomial-time algorithm (1)Bilinear function (1)Linear relaxation (1)Generalized pooling problem (1)Coal blending (1)Mixed-integer nonlinear programming (1)Mixed-integer linear programming (1)Disjunctive optimization (1)Preventive maintenance (1)Maintenance scheduling (1)Multiobjective linear programming (1)Design Driven Development (1)