A minimax scheduling problem
From MaRDI portal
Publication:1133461
zbMATH Open0421.90052MaRDI QIDQ1133461FDOQ1133461
Publication date: 1978
Published in: Automation and Remote Control (Search for Journal in Brave)
branch and boundcomputational experiencelinear bottleneck travelling salesman problemminimax scheduling
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Boolean programming (90C09)
This page was built for publication: A minimax scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1133461)
