Pages that link to "Item:Q336509"
From MaRDI portal
The following pages link to Finding the nucleolus of any \(n\)-person cooperative game by a single linear program (Q336509):
Displaying 10 items.
- Sharing loading costs for multi compartment vehicles (Q1651904) (← links)
- Characterization sets for the nucleolus in balanced games (Q1694788) (← links)
- Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
- Finding and verifying the nucleolus of cooperative games (Q2235144) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- Common mistakes in computing the nucleolus (Q2629740) (← links)
- A comparative study of different formulations for the capacitated discrete ordered median problem (Q2664433) (← links)
- The least square B-nucleolus for fuzzy cooperative games (Q2988439) (← links)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
- TU-games with utilities: the prenucleolus and its characterization set (Q6665452) (← links)
