scientific article
From MaRDI portal
Publication:3821971
zbMATH Open0668.90091MaRDI QIDQ3821971
Publication date: 1988
Title of this publication is not available (Why is that?)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Theory of operating systems (68N25)
Recommendations
- Title not available (Why is that?) π π
- An optimal multiprocessor combinatorial auction solver π π
- On the solution of traveling salesman problems π π
- Solving large batches of traveling salesman problems with parallel and distributed computing π π
- An algorithm for the multiprocessor assignment problem π π
- Computational algorithms for the solution of the salesman problem. I: General pattern of classification π π
- Solving the multiple traveling salesperson problem on regular grids in linear time π π
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS π π
- Competitive algorithms for the on-line traveling salesman π π
- Algorithms for the on-line travelling salesman π π
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 Q3821971)