Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games

DOI10.1007/s00186-022-00771-3OpenAlexW4212764718MaRDI QIDQ2123122

Lindong Liu, Zikang Li, Yu-Qian Zhou

Publication date: 8 April 2022

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-022-00771-3

zbMATH Keywords

cost allocationcooperative gametravelling salesman game

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Core-based cost allocation in the cooperative traveling salesman problem
• On the core of a traveling salesman cost allocation game
• Traveling salesman games
• Solving covering problems and the uncapacitated plant location problem on trees
• A cooperative location game based on the 1-center location problem
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• New techniques for cost sharing in combinatorial optimization games
• Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation
• Sharing Supermodular Costs
• On some approximately balanced combinatorial cooperative games
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• Some generalizations of the steiner problem in graphs
• Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation
• Solution of a Large-Scale Traveling-Salesman Problem
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games