scientific article; zbMATH DE number 1302201

Publication date: 23 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, Frequency optimization in public transportation systems: formulation and metaheuristic approach, Dominance-based heuristics for one-machine total cost scheduling problems, Computational experiments with heuristics for two nature reserve site selection problems, Fitness landscape analysis and metaheuristics efficiency, A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty, Learning to schedule heuristics for the simultaneous stochastic optimization of mining complexes, Local Search For Satisfiability Modulo Integer Arithmetic Theories, The Generalized Max-Controlled Set Problem, Applying topological data analysis to local search problems, Scheduling logistic activities to improve hospital supply systems, Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand, Balanced compact clustering for efficient range queries in metric spaces, Artificial life techniques for load balancing in computational grids, Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes, A comparison of algorithms for finding an efficient theme park tour, A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs, Truck dock assignment problem with operational time constraint within crossdocks, Heuristic algorithms for Hadamard matrices with two circulant cores, Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method, The min-conflict packing problem, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Assigning judges to competitions of several rounds using tabu search, Near-optimal solutions for the generalized max-controlled set problem, A sequential procedure for neighborhood selection-of-the-best in optimization via simulation, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows, Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints, A dynamic vehicle routing problem with time-dependent travel times, D-optimal designs for sensor and actuator locations, Optimization via low-rank approximation for community detection in networks, Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search, A model and two heuristic methods for the multi-product inventory-location-routing problem with heterogeneous fleet, An effective local search for the maximum clique problem, Exact and heuristic methods for the selective maintenance problem, Multi-modal supply chain distribution problem, An evolutionary algorithm for discrete tomography, A set covering approach for multi-depot train driver scheduling, MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays, Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis