A polynomially solvable case of optimal linear extension problem of a poset.

Biao Wu Enyu Yao Longcheng Liu

Published in: J. Comb. Optim. (2010)

Keyphrases

optimal linear
polynomially solvable
np complete
special case
processing times
np hard
feasible solution
minimum cost
partial order
single machine
linear programming
reinforcement learning
optimization problems
worst case
scheduling problem
high resolution
optimal solution