scientific article; zbMATH DE number 3621663
From MaRDI portal
Publication:4184789
zbMATH Open0401.00019MaRDI QIDQ4184789FDOQ4184789
Authors:
Publication date: 1979
Title of this publication is not available (Why is that?)
Combinatorial optimization (90C27) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Cited In (29)
- Topological design of ring networks
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- The node-weighted steiner tree problem
- The balanced billing cycle vehicle routing problem
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- New imperialist competitive algorithm to solve the travelling salesman problem
- Selection of Vehicle Routing Heuristic Using Neural Networks
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
- An algorithm for the traveling salesman problem with pickup and delivery customers
- The travelling salesman problem: selected algorithms and heuristics†
- Reduction of job-shop problems to flow-shop problems with precedence constraints
- A matheuristic approach for the pollution-routing problem
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
- Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time
- An evolutionary algorithm for the vehicle routing problem with route balancing
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
- Upper and lower bounds for the single source capacitated location problem.
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
- Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account
- A generalized exchange heuristic for the capacitated vehicle routing problem
- An exact algorithm for large multiple knapsack problems
- A parametric analysis of heuristics for the vehicle routing problem with side-constraints
- A useful transform of standard input data for a classical NP-complete problem
- From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
- Designing a multi-modal and variable-echelon delivery system for last-mile logistics
- All solutions of the Soma cube puzzle
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- The Minimum Spanning Tree Problem with Time Window Constraints
- Analysis of a flow problem with fixed charges
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4184789)
