Pages that link to "Item:Q4979987"

The following pages link to Randomized heuristics for the family traveling salesperson problem (Q4979987):

Displaying 15 items.

• A biased random key genetic algorithm for the field Technician scheduling problem (Q342506) (← links)
• Solving the family traveling salesman problem (Q723922) (← links)
• Bi-objective scheduling on a restricted batching machine (Q1782176) (← links)
• A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
• Improved heuristics for the regenerator location problem (Q5175825) (← links)
• A metaheuristic approach to fisheries survey route planning (Q5278221) (← links)
• A GRASP/Path‐Relinking algorithm for the traveling purchaser problem (Q6056165) (← links)
• The family traveling salesman problem with incompatibility constraints (Q6065853) (← links)
• An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls (Q6066301) (← links)
• Model and methods to address urban road network problems with disruptions (Q6069920) (← links)
• Heuristic approaches for the family traveling salesman problem (Q6070420) (← links)
• A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)
• The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
• An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
• The capacitated family traveling salesperson problem (Q6195021) (← links)