Pages that link to "Item:Q691474"

The following pages link to A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474):

Displaying 6 items.

• An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
• A biased random key genetic algorithm for the field Technician scheduling problem (Q342506) (← links)
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
• A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm (Q498446) (← links)
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)