Pages that link to "Item:Q3476605"
From MaRDI portal
The following pages link to Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning (Q3476605):
Displaying 50 items.
- A step counting hill climbing algorithm applied to university examination timetabling (Q309075) (← links)
- Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times (Q324327) (← links)
- Simulated annealing for the machine reassignment problem (Q338857) (← links)
- A multi-period shelter location-allocation model with evacuation orders for flood disasters (Q339935) (← links)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
- A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem (Q439505) (← links)
- Design method using hybrid of line-type and circular-type routes for transit network system optimization (Q456929) (← links)
- Determination of initial temperature in fast simulated annealing (Q457220) (← links)
- Graph clustering (Q458448) (← links)
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (Q518934) (← links)
- Hybrid flowshop scheduling with machine and resource-dependent processing times (Q534872) (← links)
- Performance of a genetic algorithm for the graph partitioning problem (Q596896) (← links)
- An effective multilevel tabu search approach for balanced graph partitioning (Q622162) (← links)
- Local search and lower bounds for the patient admission scheduling problem (Q632698) (← links)
- Good solutions to discrete noxious location problems via metaheuristics (Q689250) (← links)
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP (Q689251) (← links)
- Comparison of the performance of modern heuristics for combinatorial optimization on real data (Q690010) (← links)
- On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
- Negotiation-based collaborative planning between supply chains partners (Q706860) (← links)
- Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem (Q708169) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Combinatorial optimization by stochastic automata (Q750309) (← links)
- Efficient simulated annealing on fractal energy landscapes (Q805499) (← links)
- Control abstractions for local search (Q816678) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- A unified framework of multi-objective cost functions for partitioning unstructured finite element meshes (Q837714) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Contraint-based combinators for local search (Q850450) (← links)
- An extended mind evolutionary computation model for optimizations (Q872359) (← links)
- Introduction to computation and learning in artificial neural networks (Q914410) (← links)
- Experiments with, and on, algorithms for maximum likelihood clustering (Q957004) (← links)
- Optimization and analysis of the profitability of tariff structures with two-part tariffs (Q976514) (← links)
- Automatic radio planning of GSM cellular networks (Q999611) (← links)
- Long-term staffing based on qualification profiles (Q1006561) (← links)
- Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: An application to road feeder service planning in air cargo transportation (Q1017968) (← links)
- Simulated annealing with noisy or imprecise energy measurements (Q1106726) (← links)
- Autocorrelation coefficient for the graph bipartitioning problem (Q1127331) (← links)
- A simulated annealing channel routing algorithm (Q1179437) (← links)
- A note on the effect of neighborhood structure in simulated annealing (Q1184445) (← links)
- Nested annealing: A provable improvement to simulated annealing (Q1193895) (← links)
- Experimental analysis of simulated annealing based algorithms for the layout problem (Q1197688) (← links)
- Optimal design of LAN-WAN internetworks: An approach using simulated annealing (Q1197793) (← links)
- Large-step Markov chains for the TSP incorporating local search heuristics (Q1197908) (← links)
- Simulated annealing applied to the process allocation problem (Q1199515) (← links)
- Mechanisms for local search (Q1266572) (← links)
- An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
- A simulated annealing heuristic for the one-dimensional cutting stock problem (Q1268138) (← links)
- General local search methods (Q1268283) (← links)
