The following pages link to Paola Festa (Q691419):
Displaying 50 items.
- (Q200488) (redirect page) (← links)
- Integer programming models for feature selection: new extensions and a randomized solution algorithm (Q322475) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- The constrained shortest path tour problem (Q342457) (← links)
- Complexity analysis and optimization of the shortest path tour problem (Q691420) (← links)
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution (Q763242) (← links)
- Logic classification and feature selection for biomedical data (Q929151) (← links)
- The auction technique for the sensor based navigation planning of an autonomous mobile robot (Q1383989) (← links)
- Shortest path auction algorithm without contractions using virtual source concept (Q1415485) (← links)
- Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
- Efficient solutions for the far from most string problem (Q1761847) (← links)
- Comments on: ``Tabu search tutorial. A graph drawing application'' (Q1979171) (← links)
- A dynamic programming algorithm for solving the \(k\)-color shortest path problem (Q2047192) (← links)
- A generalized shortest path tour problem with time windows (Q2082551) (← links)
- A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations (Q2147036) (← links)
- Shortest path tour problem with time windows (Q2282521) (← links)
- An auction-based approach for the re-optimization shortest path tree problem (Q2282822) (← links)
- Tabu search for min-max edge crossing in graphs (Q2337395) (← links)
- Solving the shortest path tour problem (Q2356016) (← links)
- Logic based methods for SNPs tagging and reconstruction (Q2379650) (← links)
- A biased random-key genetic algorithm for data clustering (Q2436000) (← links)
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (Q2448195) (← links)
- On some optimization problems in molecular biology (Q2643356) (← links)
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems (Q2668700) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- (Q2776563) (← links)
- Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)
- (Q3145802) (← links)
- An annotated bibliography of GRASP-Part II: Applications (Q3393983) (← links)
- GRASP with path relinking for the weighted MAXSAT problem (Q3507771) (← links)
- (Q3518873) (← links)
- An annotated bibliography of GRASP – Part I: Algorithms (Q3601200) (← links)
- Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
- (Q4527189) (← links)
- Solving a bus driver scheduling problem with randomized multistart heuristics (Q4918247) (← links)
- (Q4945410) (← links)
- An efficient exact approach for the constrained shortest path tour problem (Q4972542) (← links)
- Shortest path reoptimization vs resolution from scratch: a computational comparison (Q5043855) (← links)
- Solution approaches for the vehicle routing problem with occasional drivers and time windows (Q5058379) (← links)
- On the Far from Most String Problem, One of the Hardest String Selection Problems (Q5253264) (← links)
- (Q5294048) (← links)
- On Some Special Network Flow Problems: The Shortest Path Tour Problems (Q5326892) (← links)
- (Q5379096) (← links)
- Algorithm 815 (Q5461026) (← links)
- Experimental and Efficient Algorithms (Q5710036) (← links)
- On the chromatic number of graphs (Q5942344) (← links)
- Graph collapsing in shortest path auction algorithms (Q5942938) (← links)
- Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping (Q6063502) (← links)
- A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
- The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions (Q6087141) (← links)
