Traveling salesman games with the Monge property
From MaRDI portal
Publication:1827808
DOI10.1016/j.dam.2003.08.005zbMath1056.90120OpenAlexW1993230675MaRDI QIDQ1827808
Publication date: 6 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2003.08.005
Related Items (6)
New techniques for cost sharing in combinatorial optimization games ⋮ Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon ⋮ On the complexity of core, kernel, and bargaining set ⋮ Approximately fair cost allocation in metric traveling salesman games ⋮ On the core of routing games with revenues ⋮ On the core of traveling salesman games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Extreme Hamiltonian lines
- On the core of a traveling salesman cost allocation game
- Submodularity and the traveling salesman problem
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
- Traveling salesman games
- Submodular functions and optimization
- Geometric algorithms and combinatorial optimization
- The Euclidean traveling salesman problem is NP-complete
- Pyramidal tours with step-backs and the asymmetric traveling salesman problem
- Gilmore-Gomory type traveling salesman problems
- Pyramidal traveling salesman problem
- On the complexity of testing membership in the core of min-cost spanning tree games
- On approximately fair cost allocation in Euclidean TSP games
- On the computation of the nucleolus of a cooperative game
- Assignment games with stable core
- Submodularity of some classes of the combinatorial optimization games
- On the core of ordered submodular cost games
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
- The traveling salesman problem and its variations
- Total balancedness condition for Steiner tree games.
- Solving covering problems and the uncapacitated plant location problem on trees
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A fully combinatorial algorithm for submodular function minimization.
- Perspectives of Monge properties in optimization
- On some balanced, totally balanced and submodular delivery games
- Naturally submodular digraphs and forbidden digraph configurations
- Cores of convex games
- The assignment game. I: The core
- The kernel and bargaining set for convex games
- Submodular function minimization and related topics
- A note on the 5-person traveling salesman game
- On some approximately balanced combinatorial cooperative games
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- HOW TO HANDLE INTERVAL SOLUTIONS FOR COOPERATIVE INTERVAL GAMES
- Fixed-Route Cost Allocation
- Minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- Cost allocation for steiner trees
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- On the Complexity of Cooperative Solution Concepts
- A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
- Sometimes Travelling is Easy: The Master Tour Problem
- Discrete Convex Analysis
- The structure of circular decomposable metrics
- Edgeconvex Circuits and the Traveling Salesman Problem
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- On the Core of Cost Allocation Games Defined on Location Problems
- Combinatorial optimization. Theory and algorithms
- The core and nucleolus of games: a note on a paper by Göthe-Lundgren et al.
- An asymmetric analogue of van der Veen conditions and the traveling salesman problem
- Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
This page was built for publication: Traveling salesman games with the Monge property
