Pages that link to "Item:Q919753"
From MaRDI portal
The following pages link to Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing (Q919753):
Displayed 50 items.
- Applying simulated annealing using different methods for the neighborhood search in forest planning problems (Q297021) (← links)
- Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets (Q297414) (← links)
- A fuzzy based threshold policy for a single server retrial queue with vacations (Q300720) (← links)
- The multi-compartment vehicle routing problem with flexible compartment sizes (Q319854) (← links)
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing (Q357949) (← links)
- Robust portfolio optimization with a hybrid heuristic algorithm (Q373173) (← links)
- Resolvable orthogonal array-based uniform sliced Latin hypercube designs (Q395979) (← links)
- Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
- A survey on optimization metaheuristics (Q497180) (← links)
- Design of reinforced concrete road vaults by heuristic optimization (Q532469) (← links)
- A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
- Further improvements in the calculation of censored quantile regressions (Q609233) (← links)
- Identification of multivariate AR-models by threshold accepting (Q672526) (← links)
- Data clustering and visualization via energy minimization (Q691926) (← links)
- On scheduling around large restrictive common due windows (Q704121) (← links)
- Single-point stochastic search algorithms for the multi-level lot-sizing problem (Q707016) (← links)
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem (Q709119) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
- Global and local search algorithms for concave cost transshipment problems (Q811873) (← links)
- Performance analysis of cyclical simulated annealing algorithms (Q812974) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- The cross-entropy method for continuous multi-extremal optimization (Q861537) (← links)
- Scheduling periodic customer visits for a traveling salesperson (Q863999) (← links)
- A genetic algorithm approach to find the best regression/econometric model among the candidates (Q864777) (← links)
- Computational approaches to a combinatorial optimization problem arising from text classification (Q868131) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- A hybrid scatter search for the probabilistic traveling salesman problem (Q878568) (← links)
- Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
- A zero-inventory production and distribution problem with a fixed customer sequence (Q940901) (← links)
- A global optimization heuristic for estimating agent based models (Q951870) (← links)
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)
- Applications of optimization heuristics to estimation and modelling problems (Q957002) (← links)
- Optimal aggregation of linear time series models (Q957206) (← links)
- The convergence of estimators based on heuristics: theory and application to a GARCH model (Q964667) (← links)
- Distributed optimisation of a portfolio's omega (Q991131) (← links)
- Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
- A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem (Q991840) (← links)
- Design of prestressed concrete precast pedestrian bridges by heuristic optimization (Q994224) (← links)
- Constructive and destructive use of compilers in elliptic curve cryptography (Q1015356) (← links)
- Improving the computation of censored quantile regressions (Q1020790) (← links)
- A hybrid evolution strategy for the open vehicle routing problem (Q1038279) (← links)
- On the convergence of ``threshold accepting'' (Q1179163) (← links)
- Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem (Q1282966) (← links)
- Genetic local search in combinatorial optimization (Q1317048) (← links)
- Scaling features in complex optimization problems (Q1359851) (← links)