Pages that link to "Item:Q4327639"
From MaRDI portal
The following pages link to Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP (Q4327639):
Displaying 8 items.
- Submodularity and the traveling salesman problem (Q1124707) (← links)
- Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
- On the submodularity of multi-depot traveling salesman games (Q1727725) (← links)
- Naturally submodular digraphs and forbidden digraph configurations (Q1962020) (← links)
- On the properties of weighted minimum colouring games (Q2095946) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- On the convexity of independent set games (Q2659079) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)