On a Class of Routing and Scheduling Problems that are Soluble on Graphs.
Year of publication: |
1991
|
---|---|
Authors: | Hooker, J.N. ; Natraj, N.R. |
Institutions: | Carnegie Mellon University, Tepper School of Business |
Subject: | mathematics |
-
A design and a code invariant under the simple group Co3
Haemers, W.H., (1990)
-
Mathematics and economics : the case of Menger
Mensik, Josef, (2015)
-
Trinh Thi Phuong Thao, (2019)
- More ...
-
Routing and Scheduling by Modified Chain Decomposition.
Hooker, N.J., (1991)
-
An Algebraic Geometry Algorithm for Scheduling in Presence of Setups and Correlated Demands.
Tayur, S.R., (1992)
-
Solving a General Routing and Scheduling Problem by Chain Decomposition and Taby Search
Hooker, J.N., (1995)
- More ...