Period of time: 2004年4期
Publisher: Elsevier
Founded in: 1981
Total resources: 4
ISSN: 0167-6377
Subject: O Mathematical Sciences and Chemical
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Operations Research Letters,volume 31,issue 4
Menu
Foundation-penalty cuts for mixed-integer programs
By Glover F., Sherali H.D. in (2003)
Operations Research Letters,volume 31,issue 4 , Vol. 31, Iss. 4, 2003-07 , pp.The equivalence between processor sharing and service in random order
By Borst S.C., Boxma O.J., Morrison J.A., Nunez Queija R. in (2003)
Operations Research Letters,volume 31,issue 4 , Vol. 31, Iss. 4, 2003-07 , pp.Waiting time distribution of the MAP/D/k system in discrete time-a more efficient algorithm
Operations Research Letters,volume 31,issue 4 , Vol. 31, Iss. 4, 2003-07 , pp.On the characterization of continuum structure functions
Operations Research Letters,volume 31,issue 4 , Vol. 31, Iss. 4, 2003-07 , pp.Reconstructing edge-disjoint paths
By Conforti M., Hassin R., Ravi R. in (2003)
Operations Research Letters,volume 31,issue 4 , Vol. 31, Iss. 4, 2003-07 , pp.The quickest path problem with batch constraints
By Calvete H.I., del Pozo L. in (2003)
Operations Research Letters,volume 31,issue 4 , Vol. 31, Iss. 4, 2003-07 , pp.Accurate calculation of hazardous materials transport risks
By Kara B.Y., Erkut E., Verter V. in (2003)
Operations Research Letters,volume 31,issue 4 , Vol. 31, Iss. 4, 2003-07 , pp.Computing an obnoxious anchored segment
By Barcia J.A., Daz-Banez J.M., Lozano A.J., Ventura I. in (2003)
Operations Research Letters,volume 31,issue 4 , Vol. 31, Iss. 4, 2003-07 , pp.A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
By G Y-G., Seong Y.-J., Kang M.-K. in (2003)
Operations Research Letters,volume 31,issue 4 , Vol. 31, Iss. 4, 2003-07 , pp.Approximative procedures for no-wait job shop scheduling
By Schuster C.J., Framinan J.M. in (2003)
Operations Research Letters,volume 31,issue 4 , Vol. 31, Iss. 4, 2003-07 , pp.