Pages that link to "Item:Q4018536"
From MaRDI portal
The following pages link to General Purpose Simulated Annealing (Q4018536):
Displayed 12 items.
- A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound (Q707082) (← links)
- A simulated annealing approach to the traveling tournament problem (Q880541) (← links)
- The impact of operations redesign on the safety stock investment in supply chains (Q955700) (← links)
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
- Hysteretic optimization for the traveling salesman problem (Q1409111) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- A hybrid algorithm for identifying global and local minima when optimizing functions with many minima. (Q1428045) (← links)
- Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem (Q1571038) (← links)
- Solving zero-one mixed integer programming problems using tabu search (Q1609922) (← links)
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm (Q1919838) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- (Q4909609) (← links)