The following pages link to (Q4421940):
Displayed 14 items.
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- A model and two heuristic approaches for a forage Harvester planning problem: a case study (Q611002) (← links)
- Analyzing different variants of immune inspired somatic contiguous hypermutations (Q627102) (← links)
- Local search proximal algorithms as decision dynamics with costs to move (Q632228) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- Political districting: From classical models to recent approaches (Q657583) (← links)
- Planning for agricultural forage harvesters and trucks: model, heuristics, and case study (Q993459) (← links)
- New model and heuristics for safety stock placement in general acyclic supply chain networks (Q1762120) (← links)
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking (Q1926889) (← links)
- Heuristic algorithms for the cardinality constrained efficient frontier (Q2275807) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- Algorithmic search for baseline minimum aberration designs (Q2448811) (← links)