The following pages link to (Q4247444):
Displaying 13 items.
- Modeling the parallel machine scheduling problem with step deteriorating jobs (Q323474) (← links)
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474) (← links)
- Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
- Discrete location problems with push-pull objectives (Q697575) (← links)
- Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
- Modelling transfer line design problem via a set partitioning problem (Q1758032) (← links)
- Requiring connectivity in the set covering problem (Q1774524) (← links)
- Emerging multiple issue e-auctions (Q1876154) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Dynamic node packing (Q2097666) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
