The following pages link to Marcone Jamilson Freitas Souza (Q284397):
Displaying 32 items.
- GOAL solver: a hybrid local search based solver for high school timetabling (Q284398) (← links)
- (Q322467) (redirect page) (← links)
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints (Q322469) (← links)
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem (Q992718) (← links)
- (Q1652136) (redirect page) (← links)
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign (Q1652137) (← links)
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
- A VNS approach for book marketing campaigns generated with quasi-bicliques probabilities (Q1687626) (← links)
- EEG time series learning and classification using a hybrid forecasting model calibrated with GVNS (Q1687650) (← links)
- HMS: a hybrid multi-start algorithm for solving binary linear programs (Q1791895) (← links)
- Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties (Q1791909) (← links)
- A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem (Q1791944) (← links)
- A GVNS algorithm for solving the multi-depot vehicle routing problem (Q1791946) (← links)
- Learning music time series with a parallel hybrid forecasting model calibrated with reduced VNS (Q1791963) (← links)
- Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects (Q2070134) (← links)
- A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction (Q2108102) (← links)
- Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations (Q2257351) (← links)
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (Q2271122) (← links)
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem (Q2448149) (← links)
- A hybrid variable neighborhood search algorithm for targeted offers in direct marketing (Q2631264) (← links)
- A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups (Q2840759) (← links)
- A SA-VNS approach for the High School Timetabling Problem (Q2840769) (← links)
- GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery (Q2840778) (← links)
- Multi-objective approaches for the open-pit mining operational planning problem (Q2840780) (← links)
- A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem (Q3507753) (← links)
- Lexicographic goal programming approach for a short-term mining planning problem (Q6048508) (← links)
- A general VNS for the multi-depot open vehicle routing problem with time windows (Q6063504) (← links)
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem (Q6066726) (← links)
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times (Q6070133) (← links)
- The double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6071059) (← links)
- A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks (Q6088235) (← links)
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)
