Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("RATLIFF HD")

Results 1 to 15 of 15

  • Page / 1
Export

Selection :

  • and

NETWORK MODELS FOR PRODUCTION SCHEDULING PROBLEMS WITH CONVEX COST AND BATH PROCESSINGRATLIFF HD.1978; A.I.I.E. TRANS.; USA; DA. 1978; VOL. 10; NO 1; PP. 104-108; BIBL. 16 REF.Article

ORDER-PICKING IN A RECTANGULAR WAREHOUSE: A SOLVABLE CASE OF THE TRAVELLING SALESMAN PROBLEMRATLIFF HD; ROSENTHAL AS.1983; OPERATIONS RESEARCH; ISSN 0030-364X; USA; DA. 1983; VOL. 31; NO 3; PP. 507-521; BIBL. 3 REF.Article

UNNETWORKS WITH APPLICATIONS TO IDLE TIME SCHEDULINGBARTHOLDI JJ; RATLIFF HD.1978; MANAG. SCI.; USA; DA. 1978; VOL. 24; NO 8; PP. 850-858; BIBL. 15 REF.Article

A GRAPH THEORETIC EQUIVALENCE FOR INTEGER PROGRAMSPICARD JC; RATLIFF HD.1973; OPER. RES.; U.S.A.; DA. 1973; VOL. 21; NO 1; PP. 261-269; BIBL. 6 REF.Serial Issue

A NETWORK-FLOW MODEL FOR RACIALLY BALANCING SCHOOLSBELFORD PC; RATLIFF HD.1972; OPER. RES.; U.S.A.; DA. 1972; VOL. 20; NO 3; PP. 619-628; BIBL. 9 REF.Serial Issue

SCHEDULING RULES FOR PARALLEL PROCESSORSMARTIN VEGA LA; RATLIFF HD.1977; A.I.I.E. TRANS.; USA; DA. 1977; VOL. 9; NO 4; PP. 330-337; BIBL. 12 REF.Article

SOME EQUIVALENT OBJECTIVES FOR DYNAMIC NETWORK FLOW PROBLEMSJARVIS JJ; RATLIFF HD.1982; MANAGE SCI.; ISSN 0025-1909; USA; DA. 1982; VOL. 28; NO 1; PP. 106-109; BIBL. 3 REF.Article

A CUT APPROACH TO THE RECTILINEAR DISTANCE FACILITY LOCATION PROBLEMPICARD JC; RATLIFF HD.1978; OPER. RES.; USA; DA. 1978; VOL. 26; NO 3; PP. 422-433; BIBL. 17 REF.Article

MINIMUM CUTS AND RELATED PROBLEMS.PICARD JC; RATLIFF HD.1975; NETWORKS; U.S.A.; DA. 1975; VOL. 5; NO 4; PP. 357-370; BIBL. 9 REF.Article

SET PARTITIONING BASED HEURISTICS FOR INTERACTIVE ROUTINGCULLEN FH; JARVIS JJ; RATLIFF HD et al.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 2; PP. 125-143; BIBL. 7 REF.Conference Paper

DETERMINING THE MOST VITAL LINK IN A FLOW NETWORKLUBORE SH; RATLIFF HD; SICILIA GT et al.1972; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1972; VOL. 18; NO 4; PP. 497-502; BIBL. 3 REF.Serial Issue

A NETWORK APPROACH TO A MULTI-FACILITY, MULTI-PRODUCT PRODUCTION SCHEDULING PROBLEM WITHOUT BACKORDERING.DORSEY RC; HODGSON TJ; RATLIFF HD et al.1975; MANAG. SCI.; U.S.A.; DA. 1975; VOL. 21; NO 7; PP. 813-822; BIBL. 17 REF.Article

CYCLIC SCHEDULING VIA INTEGER PROGRAMS WITH CIRCULAR ONESBARTHOLDI JJ III; ORLIN JB; RATLIFF HD et al.1980; OPER. RES.; ISSN 0030-364X; USA; DA. 1980; VOL. 28; NO 5; PP. 1074-1085; BIBL. 16 REF.Article

DISTANCE CONSTRAINTS FOR TREE NETWORK MULTIFACILITY LOCATION PROBLEMSFRANCIS RL; LOWE TJ; RATLIFF HD et al.1978; OPER. RES.; USA; DA. 1978; VOL. 26; NO 4; PP. 570-596; BIBL. 24 REF.Article

FINDING THE N MOST VITAL LINKS IN FLOW NETWORKS.RATLIFF HD; SICILIA GT; LUBORE SH et al.1975; MANAG. SCI.; U.S.A.; DA. 1975; VOL. 21; NO 5; PP. 531-539; BIBL. 8 REF.Article

  • Page / 1