Pages that link to "Item:Q794925"
From MaRDI portal
The following pages link to A thermodynamically motivated simulation procedure for combinatorial optimization problems (Q794925):
Displaying 50 items.
- Variable neighborhood search for the workload balancing problem in service enterprises (Q337226) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- Discrete optimization: an Austrian view (Q537581) (← links)
- Dual ascent: variations of a theme (Q537601) (← links)
- Some experiments with simulated annealing for coloring graphs (Q581241) (← links)
- Quadratic assignment problems (Q594767) (← links)
- An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems (Q621965) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- An improved annealing scheme for the QAP (Q752002) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Methods for the one-dimensional space allocation problem (Q916571) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- Randomized algorithms in combinatorial optimization: A survey (Q1077329) (← links)
- The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach (Q1080365) (← links)
- Experimentation in optimization (Q1084342) (← links)
- A simulated annealing approach to the multiconstraint zero-one knapsack problem (Q1099588) (← links)
- On the convergence of stationary distributions in simulated annealing algorithms (Q1099589) (← links)
- Schedule synchronization for public transit networks (Q1111918) (← links)
- Tabu search techniques. A tutorial and an application to neural networks (Q1120479) (← links)
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
- Experimental analysis of simulated annealing based algorithms for the layout problem (Q1197688) (← links)
- Simulated annealing for machine layout problems in the presence of zoning constraints (Q1197690) (← links)
- Simulated annealing applied to the process allocation problem (Q1199515) (← links)
- Generating quadratic assignment test problems with known optimal permutations (Q1203071) (← links)
- Cell formation in manufacturing systems through simulated annealing: An experimental evaluation (Q1207537) (← links)
- Mechanisms for local search (Q1266572) (← links)
- Optimizing simulated annealing schedules with genetic programming (Q1268274) (← links)
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system (Q1318457) (← links)
- A parallel tabu search algorithm for large traveling salesman problems (Q1329785) (← links)
- Large-scale layout of facilities using a heuristic hybrid algorithm (Q1337243) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- A new exact algorithm for the solution of quadratic assignment problems (Q1343146) (← links)
- Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- Heuristics for biquadratic assignment problems and their computational comparison (Q1388822) (← links)
- A minimax assignment problem in treelike communication networks (Q1390338) (← links)
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- An experimental comparison of seriation methods for one-mode two-way data (Q1752777) (← links)
- A convex form of the quadratic assignment problem (Q1804071) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem (Q1877896) (← links)
- A modification of threshold accepting and its application to the quadratic assignment problem (Q1909011) (← links)
