scientific article; zbMATH DE number 1054674

Publication date: 10 March 1998

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

Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items

Global sensing search for nonlinear global optimization, The linear ordering problem with clusters: a new partial ranking, Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach, A multi-layer line search method to improve the initialization of optimization algorithms, Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2), A GRASP metaheuristic for microarray data analysis, Community detection by modularity maximization using GRASP with path relinking, A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering, A hybrid column generation with GRASP and path relinking for the network load balancing problem, A hybrid data mining GRASP with path-relinking, A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem, GRASP with evolutionary path-relinking for the capacitated arc routing problem, The production routing problem: a review of formulations and solution algorithms, A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem, GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem, A hybrid multistart heuristic for the uncapacitated facility location problem, Metaheuristics for the tabu clustered traveling salesman problem, A nonmonotone GRASP, An Integer Programming Formulation for the Maximum k-Subset Intersection Problem, A tabu search algorithm for the open shop problem, Multi- and many-objective path-relinking: a taxonomy and decomposition approach, A comparison of three metaheuristics for the workover rig routing problem, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, A GRASP/Path‐Relinking algorithm for the traveling purchaser problem, A matheuristic for tri-objective binary integer linear programming, A recombination‐based matheuristic for mixed integer programming problems with binary variables, A New Neighborhood for the QAP, A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment, An auxiliary function method for global minimization in integer programming, Variable neighborhood scatter search for the incremental graph drawing problem, A biased random‐key genetic algorithm for the home health care problem, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, RAMP for the capacitated minimum spanning tree problem, Tabu search with path relinking for an integrated production-distribution problem, A filter-and-fan approach to the 2D HP model of the protein folding problem, Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands, Strategic oscillation for the quadratic multiple knapsack problem, Local search heuristics for the probabilistic dial-a-ride problem, A GRASP algorithm for the multi-criteria minimum spanning tree problem, Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times, Tabu search tutorial. A graph drawing application, ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness, A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem, Finding efficient make-to-order production and batch delivery schedules, Local search with perturbations for the prize-collecting Steiner tree problem in graphs, Fitness landscape analysis for the no-wait flow-shop scheduling problem, The job shop scheduling problem with convex costs, Restart strategies for GRASP with path-relinking heuristics, A fast swap-based local search procedure for location problems, Local search for the undirected capacitated arc routing problem with profits, Adaptive memory in multistart heuristics for multicommodity network design, Scheduling blocking flowshops with setup times via constraint guided and accelerated local search, Efficient solutions for the far from most string problem, Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion, A TABU search heuristic for the team orienteering problem, Path relinking for the vehicle routing problem, A path relinking approach for the team orienteering problem, Near-optimal solutions for the generalized max-controlled set problem, Greedy random adaptive memory programming search for the capacitated clustering problem, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints, Multistart search for the cyclic cutwidth minimization problem, Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem, Adaptive memory programming: a unified view of metaheuristics, The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications, Metaheuristics for the online printing shop scheduling problem, D-optimal designs for sensor and actuator locations, A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time, A population-based variable neighborhood search for the single machine total weighted tardiness problem, A power-deficiency and risk-management model for wind farm micro-siting using cyber swarm algorithm, Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, A black-box scatter search for optimization problems with integer variables, Guided local search and its application to the traveling salesman problem, An incremental search heuristic for coloring vertices of a graph, GRASP with path-relinking for the generalized quadratic assignment problem, Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies, GRASP and path relinking for the max-min diversity problem, Clustering search algorithm for the capacitated centered clustering problem, A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location, Hybrid algorithms for placement of virtual machines across geo-separated data centers, A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems, A GRASP and path relinking heuristic for rural road network development, A tabu search algorithm for the optimisation of telecommunication networks, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation, Proposals for chunking and tabu search, Solving zero-one mixed integer programming problems using tabu search, Metaheuristics in combinatorial optimization