Submodularity and the traveling salesman problem
From MaRDI portal
(Redirected from Publication:1124707)
Recommendations
- A note on the traveling salesman problem
- Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP
- Heuristics and bounds for the travelling salesman location problem on the plane
- The traveling salesman problem on a graph and some related integer polyhedra
- Informative path planning as a maximum traveling salesman problem with submodular rewards
Cites work
- scientific article; zbMATH DE number 3908167 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
- A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System
- A Dynamic Programming Approach to Sequencing Problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- An analysis of approximations for maximizing submodular set functions—I
- Bounds and Heuristics for Capacitated Routing Problems
- Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds
- Naturally submodular digraphs and forbidden digraph configurations
- On some balanced, totally balanced and submodular delivery games
- One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
- Outline of an algorithm for integer solutions to linear programs
- Simple Power-of-Two Policies are Close to Optimal in a General Class of Production/Distribution Networks with General Joint Setup Costs
- Spacefilling curves and the planar travelling salesman problem
- The multi-level uncapacitated facility location problem is not submodular
- The shortest path and the shortest road through n points
- The traveling salesman problem on a graph and some related integer polyhedra
- The traveling-salesman problem
- Vehicle scheduling on a tree with release and handling times
Cited in
(4)
This page was built for publication: Submodularity and the traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124707)
