On a cost allocation problem arising from a capacitated concentrator covering problem

DOI10.1016/0167-6377(93)90054-KzbMath0789.90102OpenAlexW2089946761MaRDI QIDQ1316101

Darko Skorin-Kapov

Publication date: 12 June 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90054-k

zbMATH Keywords

cost allocation\(\varepsilon\)-corecapacitated concentrator coveringcovering game

Mathematics Subject Classification ID

Cooperative games (91A12) Other game-theoretic models (91A40)

Related Items

Social enterprise tree network games, A note on Steiner tree games, A cost allocation problem arising in hub-spoke network systems, Minimum cost forest games

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for the capacitated concentrator location problem
• Supportability of network cost functions
• Solving covering problems and the uncapacitated plant location problem on trees
• Observations on the nucleolus and the central game
• Producer Incentives in Cost Allocation
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
• Minimum cost spanning tree games
• Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• The Nucleolus of a Characteristic Function Game