Login / Signup
A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships.
Laureano F. Escudero
Monique Guignard
Kavindra Malik
Published in:
Ann. Oper. Res. (1994)
Keyphrases
</>
partial order
optimal solution
partially ordered
database
neural network
resource constraints
information retrieval
website
relaxation algorithm