scientific article; zbMATH DE number 1082102
From MaRDI portal
Publication:4365129
zbMath0905.90140MaRDI QIDQ4365129
Jan H. M. Korst, Peter J. M. Van Laarhoven, Emile H. L. Aarts
Publication date: 4 January 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (31)
Optimized planning of frequency hopping in cellular networks ⋮ A multi-start local search algorithm for the vehicle routing problem with time windows ⋮ Gravitational search algorithm combined with chaos for unconstrained numerical optimization ⋮ Parallel ant colony optimization for resource constrained job scheduling ⋮ Convergence analysis of the plant propagation algorithm for continuous global optimization ⋮ Procuring load curtailment from local customers under uncertainty ⋮ Two penalized mixed-integer nonlinear programming approaches to tackle multicollinearity and outliers effects in linear regression models ⋮ Greedy scheduling with custom-made objectives ⋮ Parts-to-picker based order processing in a rack-moving mobile robots environment ⋮ In-line kitting for part feeding of assembly lines: workload balancing and storage assignment to reduce the workers' walking effort ⋮ Truck scheduling in cross-docking terminals with fixed outbound departures ⋮ Solving the continuous flow-shop scheduling problem by metaheuristics. ⋮ Local search: is brute-force avoidable? ⋮ Local search for shift design. ⋮ A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs ⋮ The SIMCLAS model: simultaneous analysis of coupled binary data matrices with noise heterogeneity between and within data blocks ⋮ A note on the depth function of combinatorial optimization problems ⋮ Optimization in Sanger sequencing ⋮ A hybrid differential evolution algorithm with column generation for resource constrained job scheduling ⋮ On solving complex multi-period location models using simulated annealing. ⋮ Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models ⋮ Computational aspects of algorithms for variable selection in the context of principal components ⋮ Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem ⋮ Scheduling just-in-time part supply for mixed-model assembly lines ⋮ The CHIC model: a global model for coupled binary data ⋮ Truck scheduling at zero-inventory cross docking terminals ⋮ A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage ⋮ Algorithms for additive clustering of rectangular data tables ⋮ An algorithm for reducing the dimension and size of a sample for data exploration procedures ⋮ Application of the noising method to the travelling salesman problem ⋮ Metaheuristics in combinatorial optimization
This page was built for publication:
