⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

August 1, 1980Operations Research

Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

Kenneth R. Fox Bezalel Gavish Stephen C. Graves

View at Publisher

Ask AI

Bookmark

Share

Abstract

A new formulation of the time-dependent salesman problem is presented which uses n3 variables and only n constraints.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Fox et al. (1980) studied this question.

synapsesocial.com/papers/6a908c183f736c3f82c7ac07 https://doi.org/10.1287/opre.28.4.1018

View at Publisher

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 related papers. Consider them for comparative context:

1Semibandit Learning for Monotone Stochastic OptimizationOperations Research · Mon,
2Online Decisions with (Biased) Offline DataOperations Research · Thu,
3Learning Optimal Classification Trees Robust to Distribution ShiftsOperations Research · Wed,
4Competition for Customer Attention is Creating Oversupply Pockets in US MicromobilityOperations Research · Wed,
5Stochastic Dual Dynamic Programming for Log-linear Autoregressive Uncertainty in the Right-hand SideOperations Research · Wed,

More from Operations Research

Community-Oriented Market Design for Nonprofit Resource ExchangeTue,
Optimality of Public Persuasion for Single-Good AllocationTue,
Convexity of Inverse Blocking Curves in Loss SystemsMon,
Optimizing Input Data Collection for Ranking and SelectionThu,
Planning Stormwater Retention for Resilience Against Extreme RainfallsMon,