Pages that link to "Item:Q1290124"
From MaRDI portal
The following pages link to A simulated annealing code for general integer linear programs (Q1290124):
Displaying 10 items.
- Redesigning product lines in a period of economic crisis: a hybrid simulated annealing algorithm with crossover (Q513106) (← links)
- A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound (Q707082) (← links)
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
- A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems (Q1303783) (← links)
- Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem (Q1917905) (← links)
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm (Q1919838) (← links)
- A robust stochastic casualty collection points location problem (Q2315652) (← links)
- Template design under demand uncertainty by integer linear local search (Q3430258) (← links)
- (Q4031978) (← links)
- Information technology capital budgeting using a knapsack problem (Q5489128) (← links)