scientific article

zbMath0667.90068MaRDI QIDQ3993069

Toshihide Ibaraki

Publication date: 17 September 1992

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

zbMATH Keywords

traveling salesmanbranch-and-boundset coveringknapsack problemsflow-shop schedulingplant locationsuccessive sublimation dynamic programmingEnumerative algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Dynamic programming (90C39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Boolean programming (90C09)

Related Items (2)

A distributed exact algorithm for the multiple resource constrained sequencing problem ⋮ Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.

This page was built for publication: