Pages that link to "Item:Q1091142"
From MaRDI portal
The following pages link to A dynamic programming approach to the complete set partitioning problem (Q1091142):
Displaying 12 items.
- Randomized coalition structure generation (Q420794) (← links)
- Coalition structure generation: a survey (Q900307) (← links)
- A hybrid exact algorithm for complete set partitioning (Q901033) (← links)
- A combinatorial structure ensuring applicability of the dynamic programming method (Q918440) (← links)
- Anytime coalition structure generation in multi-agent systems with positive or negative externalities (Q1761282) (← links)
- A sequential aggregation algorithm for the set partitioning problem (Q1819547) (← links)
- The column-circular, subsets-selection problem: Complexity and solutions (Q1974273) (← links)
- Cooperative congestion games: existence of a Nash-stable coalition structure (Q2091226) (← links)
- Nash-stable coalition partition and potential functions in games with coalition structure (Q2242407) (← links)
- Improved WPM encoding for coalition structure generation under MC-nets (Q2331103) (← links)
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
- A new genetic algorithm encoding for coalition structure generation problems (Q6534466) (← links)