scientific article

zbMath0557.90074MaRDI QIDQ3221759

Jan Karel Lenstra, G. A. P. Kindervater

Publication date: 1985

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

zbMATH Keywords

combinatorial optimizationparallel algorithmssequencing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Related Items (6)

An introduction to parallelism in combinatorial optimization ⋮ Branch-and-bound and parallel computation: A historical note ⋮ A simulation tool for the performance evaluation of parallel branch and bound algorithms ⋮ Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck ⋮ A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems ⋮ Parallel processing for difficult combinatorial optimization problems

This page was built for publication: