Pages that link to "Item:Q1342281"
From MaRDI portal
The following pages link to A new adaptive multi-start technique for combinatorial global optimizations (Q1342281):
Displayed 48 items.
- A step counting hill climbing algorithm applied to university examination timetabling (Q309075) (← links)
- Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
- Fitness landscape analysis for the no-wait flow-shop scheduling problem (Q519086) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- A note on edge-based graph partitioning and its linear algebraic structure (Q662140) (← links)
- Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability (Q814612) (← links)
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
- On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
- A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- Attraction probabilities in variable neighborhood search (Q989828) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← links)
- An adaptive, multiple restarts neural network algorithm for graph coloring (Q1268156) (← links)
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem (Q1271380) (← links)
- Genetic local search with distance preserving recombination operator for a vehicle routing problem. (Q1410618) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- How to escape local optima in black box optimisation: when non-elitism outperforms elitism (Q1750360) (← links)
- Reformulation descent applied to circle packing problems (Q1772872) (← links)
- A fuzzy genetic algorithm for driver scheduling (Q1869717) (← links)
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
- Local search-based hybrid algorithms for finding Golomb rulers (Q2385176) (← links)
- Distance preserving recombination operator for Earth observation satellites operations scheduling (Q2481604) (← links)
- Dynamics of local search trajectory in traveling salesman problem (Q2491325) (← links)
- Predatory search algorithm with restriction of solution distance (Q2500224) (← links)
- The big valley conjecture for the flow Steiner tree problem (Q2515391) (← links)
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
- Self-organizing maps in evolutionary approach for the traveling salesman problem and vehicle routing problem with time windows (Q2997961) (← links)
- Hybrid simulated annealing with memory: an evolution-based diversification approach (Q3163188) (← links)
- Single-Funnel and Multi-funnel Landscapes and Subthreshold-Seeking Behavior (Q3459674) (← links)
- Local Search Based on Genetic Algorithms (Q3509426) (← links)
- Simple control rules in a cooperative system for dynamic optimisation problems (Q3654536) (← links)
- Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search (Q4422624) (← links)
- Multi-start approach for an integer determinant maximization problem (Q4916310) (← links)
- A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem (Q5438568) (← links)
- Transport clustering and routing as a visual meshing process (Q5455292) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
- Variable neighborhood search: Principles and applications (Q5937708) (← links)
- Multiagent cooperative search for portfolio selection (Q5938623) (← links)
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem (Q5946533) (← links)
- Adaptive memory programming: a unified view of metaheuristics (Q5954822) (← links)
- J-MEANS: A new local search heuristic for minimum sum of squares clustering (Q5957595) (← links)
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893) (← links)
- A no-delay single machine scheduling problem to minimize total weighted early and late work (Q6063508) (← links)
- Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)
- Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions (Q6120983) (← links)