scientific article
From MaRDI portal
Publication:3320091
zbMath0535.90030MaRDI QIDQ3320091
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial optimizationcomputational experimentssingle machineheuristicprecedence constraintspolynomial-time algorithmsdeterministic sequencing
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (7)
A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Semidefinite relaxations of ordering problems ⋮ A semidefinite optimization approach to the target visitation problem ⋮ A benchmark library and a comparison of heuristic methods for the linear ordering problem ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ A branch and bound algorithm for minimizing weighted completion times with deadlines ⋮ New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
This page was built for publication:
