The following pages link to (Q4452900):
Displaying 50 items.
- Local search based heuristics for global optimization: atomic clusters and beyond (Q1926903) (← links)
- On the use of meta-heuristic algorithms for automated test suite generation in software testing (Q1979778) (← links)
- Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry (Q2027046) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping (Q2029286) (← links)
- Metaheuristics for the online printing shop scheduling problem (Q2030284) (← links)
- Joint generalized quantile and conditional tail expectation regression for insurance risk analysis (Q2038215) (← links)
- On solving the time window assignment vehicle routing problem via iterated local search (Q2056911) (← links)
- Iterated local search for the placement of wildland fire suppression resources (Q2079393) (← links)
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations (Q2098034) (← links)
- The parallel drone scheduling problem with multiple drones and vehicles (Q2116866) (← links)
- Collection of different types of milk with multi-tank tankers under uncertainty: a real case study (Q2121608) (← links)
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (Q2178077) (← links)
- Efficient approaches for the flooding problem on graphs (Q2178332) (← links)
- Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems (Q2188765) (← links)
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
- Double descent and intermittent color diffusion for landscape exploration (Q2192577) (← links)
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation (Q2211864) (← links)
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables (Q2220918) (← links)
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (Q2242290) (← links)
- City-courier routing and scheduling problems (Q2253369) (← links)
- The warehouse-inventory-transportation problem for supply chains (Q2254000) (← links)
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints (Q2255904) (← links)
- Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations (Q2257351) (← links)
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times (Q2273657) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- A simheuristic approach for throughput maximization of asynchronous buffered stochastic mixed-model assembly lines (Q2289939) (← links)
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines (Q2297569) (← links)
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics (Q2327442) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Lifted graphical models: a survey (Q2347709) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- A matheuristic for the truck and trailer routing problem (Q2355939) (← links)
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms (Q2359156) (← links)
- Adaptive tabu search for course timetabling (Q2379550) (← links)
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
- The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups (Q2403268) (← links)
- Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems (Q2413317) (← links)
- A dynamic game with monopolist manufacturer and price-competing duopolist retailers (Q2454349) (← links)
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
- A bi-objective coordination setup problem in a two-stage production system (Q2482750) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- Improved local search algorithms for the rectangle packing problem with general spatial costs (Q2484340) (← links)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- Image registration with iterated local search (Q2491334) (← links)
