Traveling salesman games with the Monge property (Q1827808): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Pyramidal traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cost allocation for a spanning tree: A game theoretic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core and nucleolus of games: a note on a paper by Göthe-Lundgren et al. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of circular decomposable metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3365280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sometimes Travelling is Easy: The Master Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of the Core of Combinatorial Optimization Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Cooperative Solution Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pyramidal tours with step-backs and the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of testing membership in the core of min-cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximately fair cost allocation in Euclidean TSP games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some approximately balanced combinatorial cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the core of ordered submodular cost games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of the nucleolus of a cooperative game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total balancedness condition for Steiner tree games. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Route Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular function minimization and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Naturally submodular digraphs and forbidden digraph configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some balanced, totally balanced and submodular delivery games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodularity and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully combinatorial algorithm for submodular function minimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gilmore-Gomory type traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edgeconvex Circuits and the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving covering problems and the uncapacitated plant location problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the 5-person traveling salesman game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernel and bargaining set for convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost allocation for steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymmetric analogue of van der Veen conditions and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodularity of some classes of the combinatorial optimization games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The assignment game. I: The core / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment games with stable core / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Hamiltonian lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the core of a traveling salesman cost allocation game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Core of Cost Allocation Games Defined on Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: HOW TO HANDLE INTERVAL SOLUTIONS FOR COOPERATIVE INTERVAL GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems / rank
 
Normal rank

Latest revision as of 19:27, 6 June 2024

scientific article
Language Label Description Also known as
English
Traveling salesman games with the Monge property
scientific article

    Statements

    Traveling salesman games with the Monge property (English)
    0 references
    0 references
    6 August 2004
    0 references
    0 references
    Cooperative game
    0 references
    Core
    0 references
    Traveling salesman
    0 references
    Polynomially solvable case
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references