The following pages link to Luca Maria Gambardella (Q336342):
Displayed 33 items.
- Item:Q336342 (redirect page) (← links)
- Item:Q227993 (redirect page) (← links)
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
- A hybrid particle swarm optimization approach for the sequential ordering problem (Q622165) (← links)
- A branch and bound algorithm for the robust spanning tree problem with interval data (Q706974) (← links)
- A heuristic manipulation technique for the sequential ordering problem (Q925838) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
- A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725) (← links)
- A simulation tool for combined rail/road transport in intermodal terminals (Q1613994) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- Exact algorithms for the minimum power symmetric connectivity problem in wireless networks (Q1781561) (← links)
- An exact algorithm for the robust shortest path problem with interval data (Q1885969) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← links)
- Effective neighbourhood functions for the flexible job shop problem (Q1976516) (← links)
- A Tabu search algorithm for the probabilistic orienteering problem (Q2026967) (← links)
- Time dependent vehicle routing problem with a multi ant colony system (Q2464200) (← links)
- The robust shortest path problem with interval data via Benders decomposition (Q2507502) (← links)
- Ant colony system for a dynamic vehicle routing problem (Q2583173) (← links)
- (Q2783194) (← links)
- (Q2787279) (← links)
- Sampling-Based Objective Function Evaluation Techniques for the Orienteering Problem with Stochastic Travel and Service Times (Q2806980) (← links)
- Exact Algorithms for the Vehicle Routing Problem with Soft Time Windows (Q2806989) (← links)
- (Q2956989) (← links)
- Ant colonies for the quadratic assignment problem (Q3157308) (← links)
- Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines (Q3167642) (← links)
- (Q4424570) (← links)
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem (Q4427334) (← links)
- (Q4436001) (← links)
- (Q4667331) (← links)
- An Enhanced Ant Colony System for the Sequential Ordering Problem (Q5176328) (← links)
- USING ANT AGENTS TO COMBINE REACTIVE AND PROACTIVE STRATEGIES FOR ROUTING IN MOBILE AD-HOC NETWORKS (Q5704364) (← links)
- Adaptive memory programming: a unified view of metaheuristics (Q5954822) (← links)
- On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
- An Ant Colony System for the Team Orienteering Problem with Time Windows (Q6436358) (← links)