Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation
From MaRDI portal
Publication:2960364
DOI10.1287/ijoc.2016.0707zbMath1414.91028OpenAlexW2522347103MaRDI QIDQ2960364
Xiangtong Qi, Lindong Liu, Zhou Xu
Publication date: 8 February 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a7fb499e13afeaf964186af61c391cec71d6e1a7
Related Items
Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games, Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation
Cites Work
- Unnamed Item
- Unnamed Item
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- Cooperative games in facility location situations with regional fixed costs
- Complexity of core allocation for the bin packing game
- Approximately fair cost allocation in metric traveling salesman games
- A cost-sharing method for an economic lot-sizing game
- On the core of a traveling salesman cost allocation game
- Traveling salesman games
- On approximately fair cost allocation in Euclidean TSP games
- Note on the computational complexity of least core concepts for min-cost spanning tree games.
- Cores of inventory centralization games
- Solving covering problems and the uncapacitated plant location problem on trees
- On the nucleolus of the basic vehicle routing game
- A cooperative location game based on the 1-center location problem
- A cross-monotonic cost-sharing scheme for the concave facility location game
- Approximating the least core value and least core of cooperative games with supermodular costs
- A procedure to compute the nucleolus of the assignment game
- Cores of convex games
- The assignment game. I: The core
- New techniques for cost sharing in combinatorial optimization games
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Polymatroid Optimization, Submodularity, and Joint Replenishment Games
- Sharing Supermodular Costs
- A Stochastic Programming Duality Approach to Inventory Centralization Games
- Inventory Centralization Games with Price-Dependent Demand and Quantity Discount
- On some approximately balanced combinatorial cooperative games
- The Cost of Stability in Coalitional Games
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Minimum cost spanning tree games
- On the core of linear production games
- Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Cost Allocation for Joint Replenishment Models
- Matching Games: The Least Core and the Nucleolus
