The following pages link to (Q4452900):
Displaying 50 items.
- A joint quantile and expected shortfall regression framework (Q62993) (← links)
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
- A hybrid clonal selection algorithm for the location routing problem with stochastic demands (Q276534) (← links)
- A review of hyper-heuristics for educational timetabling (Q284387) (← links)
- GOAL solver: a hybrid local search based solver for high school timetabling (Q284398) (← links)
- Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
- Decomposition and local search based methods for the traveling umpire problem (Q296910) (← links)
- A deterministic iterated local search algorithm for the vehicle routing problem with backhauls (Q301395) (← links)
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- An integer programming approach to the multimode resource-constrained multiproject scheduling problem (Q310345) (← links)
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (Q319040) (← links)
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite (Q319628) (← links)
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (Q320637) (← links)
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling (Q320651) (← links)
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints (Q322469) (← links)
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
- Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration (Q342119) (← links)
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem (Q342275) (← links)
- Multiobjective vehicle routing problem with fixed delivery and optional collections (Q375980) (← links)
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness (Q398925) (← links)
- A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
- Machine learning for global optimization (Q434171) (← links)
- Crossover iterated local search for SDCARP (Q489138) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
- Fast local search for the maximum independent set problem (Q519101) (← links)
- A hybrid evolutionary algorithm for the periodic location-routing problem (Q531435) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism (Q604940) (← links)
- A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833) (← links)
- Vehicle routing with compartments: applications, modelling and heuristics (Q657053) (← links)
- Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
- Solving the family traveling salesman problem (Q723922) (← links)
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem (Q4611469) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (Q5214308) (← links)
- MPILS: an automatic tuner for MILP solvers (Q6047892) (← links)
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity (Q6048199) (← links)
- Approximating the chance-constrained capacitated vehicle routing problem with robust optimization (Q6054019) (← links)
- Metaheuristics for the work‐troops scheduling problem (Q6056168) (← links)
- Automated slideshow design from a set of photos based on a hybrid Metaheuristic approach (Q6063787) (← links)
- The family traveling salesman problem with incompatibility constraints (Q6065853) (← links)
