Pages that link to "Item:Q901033"
From MaRDI portal
The following pages link to A hybrid exact algorithm for complete set partitioning (Q901033):
Displaying 10 items.
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- A dynamic programming approach to the complete set partitioning problem (Q1091142) (← 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 relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
- A hybrid exact algorithm for the TSPTW (Q2884545) (← links)
- An attention model for the formation of collectives in real-world domains (Q6494351) (← links)
- A new genetic algorithm encoding for coalition structure generation problems (Q6534466) (← links)
- Scheduling analysis and correction for dependent real-time tasks upon heterogeneous multiprocessor architectures (Q6536410) (← links)
