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.
- The life span method -- a new variant of local search (Q1275844) (← links)
- Path optimization for graph partitioning problems (Q1276954) (← links)
- Scheduling jobs on parallel machines with sequence-dependent setup times (Q1278125) (← links)
- An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling (Q1278192) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows (Q1278462) (← links)
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- Heuristics for unrelated machine scheduling with precedence constraints (Q1290706) (← links)
- An optimal tree search method for the manufacturing systems cell formation problem (Q1291773) (← links)
- Simulated annealing for resource-constrained scheduling (Q1309982) (← links)
- Routeing winter gritting vehicles (Q1317045) (← links)
- Simulated annealing and the mapping problem: A computational study (Q1318465) (← links)
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing (Q1319482) (← links)
- The noising method: A new method for combinatorial optimization (Q1319680) (← links)
- Simulated annealing: Practice versus theory (Q1324207) (← links)
- Parallel physical optimization algorithms for allocating data to multicomputer nodes (Q1329110) (← links)
- Heuristics for laying out information graphs (Q1332692) (← links)
- Simulated annealing procedures for forming machine cells in group technology (Q1333513) (← links)
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
- Vertex packing problem application to the design of electronic testing fixtures (Q1339134) (← links)
- Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search (Q1339162) (← links)
- A computational study of graph partitioning (Q1340061) (← links)
- Optimization by ghost image processes in neural networks (Q1342097) (← links)
- Simulated annealing and tabu search: Lessons from a line search (Q1342098) (← links)
- New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation (Q1342107) (← links)
- A new adaptive multi-start technique for combinatorial global optimizations (Q1342281) (← links)
- A molecular structure matching problem (Q1361391) (← links)
- Partitioning of sequentially ordered systems using linear programming (Q1362974) (← links)
- An experimental evaluation of local search heuristics for graph partitioning (Q1382773) (← links)
- The Metropolis algorithm for graph bisection (Q1383365) (← links)
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828) (← links)
- Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
- Stochastic annealing for synthesis under uncertainty (Q1388841) (← links)
- Simulated annealing for manufacturing systems layout design (Q1388923) (← links)
- A new extension of local search applied to the Dial-A-Ride problem (Q1388930) (← links)
- A systematic procedure for setting parameters in simulated annealing algorithms (Q1389193) (← links)
- Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) (← links)
- Simulated annealing for complex portfolio selection problems. (Q1406489) (← links)
- A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- Heuristic methods for gang-rip saw arbor design. (Q1420446) (← links)
- Nature's way of optimizing (Q1575193) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Method to solve the travelling salesman problem using the inverse of diffusion process (Q1596595) (← links)
- Solution of large weighted equicut problems (Q1609912) (← links)
- Moving clusters within a memetic algorithm for graph partitioning (Q1665049) (← links)
- Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times (Q1665637) (← links)
- The late acceptance hill-climbing heuristic (Q1698884) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- Extended neighborhood: Definition and characterization (Q1764249) (← links)
