scientific article; zbMATH DE number 3621663

From MaRDI portal
Publication:4184789

zbMath0401.00019MaRDI QIDQ4184789

No author found.

Publication date: 1979


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



Related Items

A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, Heuristics for unequal weight delivery problems with a fixed error guarantee, An evolutionary algorithm for the vehicle routing problem with route balancing, A matheuristic approach for the pollution-routing problem, A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection, Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account, A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm, An exact algorithm for large multiple knapsack problems, Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location, Designing a multi-modal and variable-echelon delivery system for last-mile logistics, The Minimum Spanning Tree Problem with Time Window Constraints, Upper and lower bounds for the single source capacitated location problem., The node-weighted steiner tree problem, Selection of Vehicle Routing Heuristic Using Neural Networks, From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods, Analysis of a flow problem with fixed charges, The travelling salesman problem: selected algorithms and heuristics†, The balanced billing cycle vehicle routing problem, Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time, A generalized exchange heuristic for the capacitated vehicle routing problem, Reduction of job-shop problems to flow-shop problems with precedence constraints, New Imperialist Competitive Algorithm to solve the travelling salesman problem, A useful transform of standard input data for a classical NP-complete problem, A parametric analysis of heuristics for the vehicle routing problem with side-constraints, All solutions of the Soma cube puzzle, Topological design of ring networks, An algorithm for the traveling salesman problem with pickup and delivery customers