Pages that link to "Item:Q2638367"
From MaRDI portal
The following pages link to New techniques for cost sharing in combinatorial optimization games (Q2638367):
Displaying 13 items.
- Stochastic linear programming games with concave preferences (Q319166) (← links)
- Finding the nucleoli of large cooperative games (Q320842) (← links)
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
- Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games (Q2123122) (← links)
- Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities (Q2171605) (← links)
- Allocating costs in set covering problems (Q2178140) (← links)
- A cooperative location game based on the 1-center location problem (Q2275823) (← links)
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation (Q2664297) (← links)
- A review on cost allocation methods in collaborative transportation (Q2811933) (← links)
- OPEN PROBLEMS IN COOPERATIVE LOCATION GAMES (Q2852565) (← links)
- Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
- Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation (Q4971567) (← links)
- A competitive solution for cooperative truckload delivery (Q5964846) (← links)
