Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey

[1]  Ari K. Jónsson,et al.  Cyclic Scheduling , 1999, IJCAI.

[2]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[3]  Subbarao Kambhampati,et al.  Planning and Scheduling , 1997, The Computer Science and Engineering Handbook.

[4]  Barbaros Ç. Tansel,et al.  Composite Regions of Feasibility for Certain Classes of Distance Constrained Network Location Problems , 1996, Transp. Sci..

[5]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[6]  Cynthia Barnhart,et al.  A column-generation technique for the long-haul crew-assignment problem , 1994 .

[7]  Tom M. Cavalier,et al.  A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..

[8]  Panos M. Pardalos,et al.  A test problem generator for the Steiner problem in graphs , 1993, TOMS.

[9]  Hamilton Emmons,et al.  MULTIPLE-SHIFT WORKFORCE SCHEDULING UNDER THE 3-4 COMPRESSED WORKWEEK WITH A HIERARCHICAL WORKFORCE , 1993 .

[10]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[11]  Dirk Cattrysse,et al.  A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times , 1993 .

[12]  Michael O. Ball,et al.  A Reliability Model Applied to Emergency Service Vehicle Location , 1993, Oper. Res..

[13]  Awi Federgruen,et al.  Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories , 1993, Oper. Res..

[14]  Carlos F. Daganzo,et al.  TRANSPORTATION AND TRAFFIC THEORY , 1993 .

[15]  Reza Barkhi,et al.  A REVIEW OF COVERING PROBLEMS IN FACILITY LOCATION. , 1993 .

[16]  David Simchi-Levi,et al.  Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands , 1992, Oper. Res..

[17]  Barrie M. Baker.  Further Inprovements to Vehicle Routeing Heuristics , 1992 .

[18]  Chung-Lun Li,et al.  On the Distance Constrained Vehicle Routing Problem , 1992, Oper. Res..

[19]  David Ronen,et al.  Allocation of trips to trucks operating from a single terminal , 1992, Comput. Oper. Res..

[20]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[21]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[22]  Giuseppe Paletta,et al.  A Heuristic for the Periodic Vehicle Routing Problem , 1992, Transp. Sci..

[23]  François V. Louveaux,et al.  A Dual-Based Procedure for Stochastic Facility Location , 1992, Oper. Res..

[24]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

[25]  Warren B. Powell,et al.  An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..

[26]  Alain Hertz,et al.  Finding a feasible course schedule using Tabu search , 1992, Discret. Appl. Math..

[27]  Thomas R. Hoffman.  Eureka: a hybrid system for assembly line balancing , 1992 .

[28]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[29]  Morton E. O'Kelly,et al.  Locating Emergency Warning Sirens , 1992 .

[30]  K. Rosing.  The Optimal Location of Steam Generators in Large Heavy Oil Fields , 1992 .

[31]  Dean P. Foster,et al.  A Probabilistic Analysis of the K-Location Problem , 1992 .

[32]  Nader M Kabbani,et al.  AIRCRAFT ROUTING AT AMERICAN AIRLINES. , 1992 .

[33]  H. A. Eiselt.  Location Modeling in Practice , 1992 .

[34]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[35]  Michael W. Carter,et al.  When Is the Classroom Assignment Problem Hard? , 1992, Oper. Res..

[36]  Candace A. Yano,et al.  A Multiplier Adjustment Approach for the Set Partitioning Problem , 1992, Oper. Res..

[37]  Timothy J. Lowe,et al.  m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases , 1992, Oper. Res..

[38]  P. V. Balakrishnan,et al.  McThresh: Modeling Maximum Coverage with Threshold Constraints , 1991 .

[39]  Donald F. Rossin,et al.  Equivalent Alternate Solutions for the Tour Scheduling Problem , 1991 .

[40]  R. Hall.  Comments on “One-warehouse multiple retailer systems with vehicle routing costs” , 1991 .

[41]  Donald F. Rossin,et al.  Sufficient working subsets for the tour scheduling problem , 1991 .

[42]  Jeffrey Goldberg,et al.  Locating Emergency Vehicle Bases When Service Time Depends on Call Location , 1991, Transp. Sci..

[43]  A. Federgruen,et al.  Rejoinder to “Comments on one-warehouse multiple retailer systems with vehicle routing costs” , 1991 .

[44]  Cheng Li,et al.  An Evaluation of Tour Scheduling Heuristics with Differences in Employee Productivity and Cost , 1991 .

[45]  Stephen E. Bechtold,et al.  A Comparative Evaluation of Labor Tour Scheduling Methods , 1991 .

[46]  F. Robert Jacobs,et al.  Tour Scheduling and Task Assignment of a Heterogeneous Work Force: A Heuristic Approach , 1991 .

[47]  Gilbert Laporte,et al.  Capacitated Vehicle Routing on Trees , 1991, Oper. Res..

[48]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..

[49]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[50]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[51]  Mark S. Daskin,et al.  Joint Location/Sizing Maximum Profit Covering Models , 1991 .

[52]  C. Revelle,et al.  The Standard Response Fire Protection Siting Problem , 1991 .

[53]  D. Serra,et al.  The Maximum Capture Problem Including Relocation , 1991 .

[54]  Hamilton Emmons,et al.  Off-Day Scheduling with Hierarchical Worker Categories , 1991, Oper. Res..

[55]  Bezalel Gavish,et al.  Parallel Savings Based Heuristics for the Delivery Problem , 1991, Oper. Res..

[56]  Edward G. Coffman,et al.  Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[57]  H. Pirkul,et al.  The Maximal Covering Location Problem with Capacities on Total Workload , 1991 .

[58]  Eric Gelman,et al.  Recent Advances in Crew-Pairing Optimization at American Airlines , 1991 .

[59]  Charles Sutcliffe,et al.  The Ex-ante Benefits of Solving Vehicle-routeing Problems , 1991 .

[60]  John N. Hooker,et al.  Finite Dominating Sets for Network Location Problems , 1991, Oper. Res..

[61]  Awi Federgruen,et al.  Structured Partitioning Problems , 1991, Oper. Res..

[62]  Richard L. Church,et al.  A Bicriterion Maximal Covering Location Formulation Which Considers the Satisfaction of Uncovered Demand , 1991 .

[63]  S. Bechtold.  Optimal Work‐Rest Schedules with a Set of Fixed‐Duration Rest Periods , 1991 .

[64]  Patrick G. McKeown,et al.  An algorithm for solving fixed-charge problems using surrogate constraints , 1991, Comput. Oper. Res..

[65]  Robert Dietrich,et al.  Validating and applying a model for locating emergency medical vehicles in Tuczon, AZ , 1990 .

[66]  Stephen E. Bechtold,et al.  Implicit modeling of flexible break assignments in optimal shift scheduling , 1990 .

[67]  Bezalel Gavish,et al.  Technical Note - Heuristics for Delivery Problems with Constant Error Guarantees , 1990, Transp. Sci..

[68]  M. Savelsbergh.  An efficient implementation of local search algorithms for constrained routing problems , 1990 .

[69]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[70]  M. Dror,et al.  Split delivery routing , 1990 .

[71]  Lenwood S. Heath.  Covering a Set with Arithmetic Progressions is NP-Complete , 1990, Inf. Process. Lett..

[72]  L. V. Wassenhove,et al.  Set partitioning and column generation heuristics for capacitated dynamic lotsizing , 1990 .

[73]  Sheryl E. Kimes,et al.  Selecting Profitable Hotel Sites at La Quinta Motor Inns , 1990 .

[74]  Toshihide Ibaraki,et al.  Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices , 1990, Math. Oper. Res..

[75]  Awi Federgruen,et al.  A Class of Euclidean Routing Problems with General Route Cost Functions , 1990, Math. Oper. Res..

[76]  Chung-Lun Li,et al.  Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems , 1990, INFORMS J. Comput..

[77]  Dominique Peeters,et al.  The Location of Fire Stations in a Rural Environment: A Case Study , 1990 .

[78]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[79]  Rajan Batta,et al.  Covering-Location Models for Emergency Situations That Require Multiple Response Units , 1990 .

[80]  Awi Federgruen,et al.  One warehouse multiple retailer systems with vehicle routing costs , 1990 .

[81]  G Mitra,et al.  Set covering and set partitioning: A collection of test problems , 1990 .

[82]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[83]  Gerard Rushton,et al.  Applications of location models , 1990 .

[84]  M. Goodchild,et al.  Coverage problems and visibility regions on topographic surfaces , 1990 .

[85]  Hasan Pirkul,et al.  The capacitated maximal covering location problem with backup service , 1990 .

[86]  Kathleen Hogan,et al.  The maximum reliability location problem and α-reliablep-center problem: Derivatives of the probabilistic location set covering problem , 1990 .

[87]  M. Daskin,et al.  Aggregation effects in maximum covering models , 1990 .

[88]  Harvey M. Salkin,et al.  A set-partitioning-based exact algorithm for the vehicle routing problem , 1989, Networks.

[89]  Rajan Batta,et al.  The Maximal Expected Covering Location Problem: Revisited , 1989, Transp. Sci..

[90]  Steven T. Hackman,et al.  Fast, Effective Algorithms for Simple Assembly Line Balancing Problems , 1989, Oper. Res..

[91]  Russell D. Jones.  Development of an Automated Airline Crew Bid Generation System , 1989 .

[92]  Ira Gershkoff,et al.  Optimizing Flight Crew Schedules , 1989 .

[93]  Larry E. Stanfel.  Successive approximations procedures for a cellular manufacturing problem with machine loading constraints , 1989 .

[94]  John R. Current,et al.  The Covering Salesman Problem , 1989, Transp. Sci..

[95]  Charles S. ReVelle,et al.  The Maximum Availability Location Problem , 1989, Transp. Sci..

[96]  Dimitris Bertsimas.  Traveling Salesman Facility Location Problems , 1989, Transp. Sci..

[97]  M. Brandeau,et al.  An overview of representative problems in location research , 1989 .

[98]  Richard A. Reid,et al.  Supplying Ecuador's Health Workers Just in Time , 1989 .

[99]  Timothy J. Lowe,et al.  Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems , 1989, Oper. Res..

[100]  Charles ReVelle,et al.  Review, extension and prediction in emergency service siting models , 1989 .

[101]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[102]  Richard T. Wong,et al.  An Integrated Inventory Allocation and Vehicle Routing Problem , 1989, Transp. Sci..

[103]  M. V. Pato,et al.  A structural lagrangean relaxation for two-duty period bus driver scheduling problems , 1989 .

[104]  V. Lotfi,et al.  A Three Phased Approach To Final Exam Scheduling , 1989 .

[105]  D. J. Elzinga,et al.  An Algorithm for Facility Location in a Districted Region , 1989 .

[106]  Moshe B. Rosenwein,et al.  An interactive optimization system for bulk-cargo ship scheduling , 1989 .

[107]  Thomas L. Morin,et al.  Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The ZOOM System , 1989, INFORMS J. Comput..

[108]  Philip E. Taylor,et al.  A Break from Tradition for the San Francisco Police: Patrol Officer Scheduling Using an Optimization-Based Decision Support System , 1989 .

[109]  Francis J. Vasko,et al.  A set covering approach to metallurgical grade assignment , 1989 .

[110]  Ludo Gelders,et al.  Plant location and vehicle routing in the Malaysian rubber smallholder sector: A case study , 1989 .

[111]  Gérard Cornuéjols,et al.  On the 0, 1 facets of the set covering polytope , 1989, Math. Program..

[112]  Jacques A. Ferland,et al.  A large scale timetabling problem , 1989, Comput. Oper. Res..

[113]  I Ozkarahan,et al.  A flexible nurse scheduling support system. , 1987, Computer methods and programs in biomedicine.

[114]  Egon Balas,et al.  On the set covering polytope: I. All the facets with coefficients in {0, 1, 2} , 1986, Math. Program..

[115]  Gilbert Laporte,et al.  Locating Postal Relay Boxes Using a set Covering Algorithm , 1989 .

[116]  J. E. Beasley.  An SST-based algorithm for the steiner problem in graphs , 1989, Networks.

[117]  Rakesh V. Vohra.  A Quick Heuristic for Some Cyclic Staffing Problems with Breaks , 1988 .

[118]  G. J. Koop.  Multiple Shift Workforce Lower Bounds , 1988 .

[119]  James E. Bailey,et al.  Goal Programming Model Subsystem of a Flexible Nurse Scheduling Support System , 1988 .

[120]  Dimitris Bertsimas,et al.  The probabilistic vehicle routing problem , 1988 .

[121]  E. D. Brill,et al.  A method for locating wells in a groundwater monitoring network under conditions of uncertainty , 1988 .

[122]  A W Neebe,et al.  A Procedure for Locating Emergency-Service Facilities for All Possible Response Distances , 1988, The Journal of the Operational Research Society.

[123]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[124]  W. M. Nawijn.  Optimizing the performance of a blood analyser: Application of the set partitioning problem , 1988 .

[125]  Vincent A. Mabert,et al.  An Evaluation of a Full‐/Part‐time Tour Scheduling Methodology , 1988 .

[126]  G. Kochenberger,et al.  Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems , 1988 .

[127]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[128]  D. Ryan,et al.  On the integer properties of scheduling set partitioning models , 1988 .

[129]  R. L. Francis,et al.  A Multimedian Problem with Interdistance Constraints , 1988 .

[130]  N. Erkip,et al.  Selecting transfer station locations for large solid waste systems , 1988 .

[131]  J. Current,et al.  Capacitated Covering Models , 1988 .

[132]  C. Revelle,et al.  A Reliability-Constrained Siting Model with Local Estimates of Busy Fractions , 1988 .

[133]  Stephen E. Bechtold.  IMPLICIT OPTIMAL AND HEURISTIC LABOR STAFFING IN A MULTIOBJECTIVE, MULTILOCATION ENVIRONMENT* , 1988 .

[134]  Samuel J. Ratick,et al.  A Risk-Sharing Model for Locating Noxious Facilities , 1988 .

[135]  John Flynn,et al.  A Multiobjective Hierarchical Covering Model for the Essential Air Services Program , 1988, Transp. Sci..

[136]  M. Minoux,et al.  A new approach for crew pairing problems by column generation with an application to air transportation , 1988 .

[137]  S. Bechtold,et al.  Note-Optimal Work-Rest Scheduling with Exponential Work-Rate Decay , 1988 .

[138]  R. Chandrasekaran,et al.  A note on the m-center problem with rectilinear distances , 1988 .

[139]  H. Paessens,et al.  The savings algorithm for the vehicle routing problem , 1988 .

[140]  M. Daskin,et al.  Integration of Multiple, Excess, Backup, and Expected Covering Models , 1988 .

[141]  Francis J. Vasko,et al.  Solving large set covering problems on a personal computer , 1988, Comput. Oper. Res..

[142]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[143]  E. El-Darzi.  Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms , 1988 .

[144]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[145]  George O. Wesolowsky,et al.  FACILITIES LOCATION: MODELS AND METHODS , 1988 .

[146]  Leen Stougie,et al.  ANALYSIS OF HEURISTICS FOR VEHICLE ROUTING PROBLEMS , 1988 .

[147]  Moshe Dror,et al.  Inventory/routing: Reduction from an annual to a short-period problem , 1987 .

[148]  B. Gavish,et al.  Heuristics for unequal weight delivery problems with a fixed error guarantee , 1987 .

[149]  I Gershkoff.  AMERICAN'S SYSTEM FOR BUILDING CREW PAIRINGS , 1987 .

[150]  Kapil Kumar Gupta,et al.  Ambulance deployment analysis: A case study of Bangkok , 1987 .

[151]  J. Beasley.  An algorithm for set covering problem , 1987 .

[152]  J. Current,et al.  Satisficing Solutions to Infeasible Set Partitions , 1987 .

[153]  Francis J. Vasko,et al.  Optimal Selection of Ingot Sizes Via Set Covering , 1987, Oper. Res..

[154]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[155]  Alexander H. G. Rinnooy Kan,et al.  Vehicle Routing with Time Windows , 1987, Oper. Res..

[156]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[157]  Gerald G. Brown,et al.  Scheduling ocean transportation of crude oil , 1987 .

[158]  Ludo Gelders,et al.  A location-allocation problem in a large Belgian brewery , 1987 .

[159]  Bruce L. Golden,et al.  OR Practice - Computerized Vehicle Routing in the Soft Drink Industry , 1987, Oper. Res..

[160]  R. N. Burns,et al.  A Modular Approach to Optimal Multiple-Shift Manpower Scheduling , 1987, Oper. Res..

[161]  Stephen E. Bechtold,et al.  A METHODOLOGY FOR LABOR SCHEDULING IN A SERVICE OPERATING SYSTEM , 1987 .

[162]  Avijit Ghosh,et al.  Spatial analysis and location-allocation models , 1987 .

[163]  G. Laporte,et al.  A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem , 1987 .

[164]  P. Hammer,et al.  Order Relations of Variables in 0-1 Programming , 1987 .

[165]  G. Laporte,et al.  Exact Algorithms for the Vehicle Routing Problem , 1987 .

[166]  Jacques-François Thisse,et al.  Single Facility Location on Networks , 1987 .

[167]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[168]  S. Thomas McCormick,et al.  Conditional covering: Greedy heuristics and computational results , 1987, Comput. Oper. Res..

[169]  Michael W. Carter,et al.  A Lagrangian Relaxation Approach To The Classroom Assignment Problem , 1989 .

[170]  Avijit Ghosh,et al.  An Approach to Determining Optimal Locations for New Services , 1986 .

[171]  Charles ReVelle,et al.  Concepts and applications of backup coverage , 1986 .

[172]  Pierre Hansen,et al.  Equivalence of Solutions to Network Location Problems , 1986, Math. Oper. Res..

[173]  Anton C.M. Hopmans,et al.  A spatial interaction model for branch bank accounts , 1986 .

[174]  W. L. Price,et al.  Locating a Blood Bank , 1986 .

[175]  C. Roger Glassey,et al.  A Decision Support System for Assigning Classes to Rooms , 1986 .

[176]  R. S. Garfinkel,et al.  Optimal Imputation of Erroneous Data: Categorical Data, General Edits , 1986, Oper. Res..

[177]  Bruce L. Golden,et al.  OR Forum - Perspectives on Vehicle Routing: Exciting New Developments , 1986, Oper. Res..

[178]  G. Laporte,et al.  An exact algorithm for solving a capacitated location-routing problem , 1986 .

[179]  Z. Drezner.  The p-cover problem , 1986 .

[180]  R. Church,et al.  Theoretical links between median and coverage location problems , 1986 .

[181]  Ilker Baybars,et al.  A survey of exact algorithms for the simple assembly line balancing , 1986 .

[182]  S. Ratick,et al.  Evaluating dredging and offshore loading locations for U.S. coal exports using the local logistics system , 1986 .

[183]  William Leigh,et al.  A branch and-bound algorithm for implementing set convering model expert systems , 1986 .

[184]  Michel Truchon,et al.  Allocation of Classrooms by Linear Programming , 1986 .

[185]  D. I. Calvert,et al.  Computer Scheduling of Public Transport 2 , 1986 .

[186]  Marius M. Solomon,et al.  On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints , 1986, Networks.

[187]  Gary D. Scudder,et al.  A simple strategy for solving a class of 0-1 integer programming models , 1986, Comput. Oper. Res..

[188]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[189]  Charles ReVelle,et al.  THE MAXIMUM CAPTURE OR “SPHERE OF INFLUENCE” LOCATION PROBLEM: HOTELLING REVISITED ON A NETWORK* , 1986 .

[190]  Masahisa Fujita.  Optimal location of public facilities: Area dominance approach , 1986 .

[191]  F. J. Vasko,et al.  Hybrid heuristics for minimum cardinality set covering problems , 1986 .

[192]  Fred W. Glover,et al.  The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..

[193]  G. J. Koop.  Cyclic scheduling of offweekends , 1986 .

[194]  William V. Gehrlein,et al.  A comparative evaluation of heuristic line balancing techniques , 1986 .

[195]  Gilbert Laporte,et al.  An exact algorithm for the asymmetrical capacitated vehicle routing problem , 1986, Networks.

[196]  Michael W. Carter,et al.  OR Practice - A Survey of Practical Applications of Examination Timetabling Algorithms , 1986, Oper. Res..

[197]  Thomas J. Holloran,et al.  United Airlines Station Manpower Planning System , 1986 .

[198]  Thomas R. Sexton,et al.  Pickup and Delivery of Partial Loads with “Soft” Time Windows , 1986 .

[199]  Harilaos N. Psaraftis,et al.  Scheduling Large-Scale Advance-Request Dial-A-Ride Systems , 1986 .

[200]  Edward K. Baker,et al.  Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints , 1986 .

[201]  Bruce L. Golden,et al.  Vehicle Routing with Time-Window Constraints , 1986 .

[202]  Ali Ridha Mahjoub,et al.  Ki-covers I: Complexity and polytopes , 1986, Discret. Math..

[203]  Lawrence Bodin,et al.  Microcomputer-based vehicle routing and scheduling software , 1986, Comput. Oper. Res..

[204]  David Ronen.  Short-Term Scheduling of Vessels for Shipping Bulk or Semi-Bulk Commodities Originating in a Single Area , 1986, Oper. Res..

[205]  Lucena Filho,et al.  Exact solution approaches for the vehicle routing problem , 1986 .

[206]  S. T. McCormick,et al.  Locating independent facilities with maximum weight: Greedy heuristics , 1986 .

[207]  Ilker Baybars,et al.  An efficient heuristic method for the simple assembly line balancing problem , 1986 .

[208]  B Rannou.  A NEW APPROACH TO CREW PAIRING OPTIMIZATION , 1986 .

[209]  Moshe Dror,et al.  A vehicle routing improvement algorithm comparison of a "greedy" and a matching implementation for inventory routing , 1986, Comput. Oper. Res..

[210]  Moshe Dror,et al.  A computational comparison of algorithms for the inventory routing problem , 1985 .

[211]  Alexander H. G. Rinnooy Kan,et al.  Bounds and Heuristics for Capacitated Routing Problems , 1985, Math. Oper. Res..

[212]  Lawrence Bodin,et al.  Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling , 1985, Transp. Sci..

[213]  P. Dearing.  Review of recent developments: Location problems , 1985 .

[214]  C. Saydam,et al.  Applications and Implementation A SEPARABLE PROGRAMMING APPROACH TO EXPECTED COVERAGE: AN APPLICATION TO AMBULANCE LOCATION , 1985 .

[215]  Mark S. Daskin,et al.  A warehouse location-routing problem , 1985 .

[216]  Gilbert Laporte,et al.  Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..

[217]  Bruce L. Golden,et al.  FUTURE DIRECTIONS IN LOGISTICS RESEARCH , 1985 .

[218]  Bruno Simeone,et al.  Polynomial-time algorithms for regular set-covering and threshold synthesis , 1985, Discret. Appl. Math..

[219]  J. Current,et al.  The maximum covering/shortest path problem: A multiobjective network design and routing formulation , 1985 .

[220]  G. Mitra,et al.  An extension of set partitioning with application to scheduling problems , 1985 .

[221]  Terry P. Harrison,et al.  Micro Versus Mainframe Performance for a Selected Class of Mathematical Programming Problems , 1985 .

[222]  James Vijay,et al.  An Algorithm for the p-Center Problem in the Plane , 1985, Transp. Sci..

[223]  Antoon W. J. Kolen,et al.  The Round-Trip p-Center and Covering Problem on a Tree , 1985, Transp. Sci..

[224]  J. Norback,et al.  The Impact of a Decision-Support System for Vehicle Routeing in a Foodservice Supply Situation , 1985 .

[225]  John Field,et al.  Personnel scheduling with flexshift models , 1985 .

[226]  Michael W. Carter,et al.  Work Force Size and Single Shift Schedules with Variable Demands , 1985 .

[227]  Michael Ball,et al.  A Graph Partitioning Approach to Airline Crew Scheduling , 1985, Transp. Sci..

[228]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[229]  Hamilton Emmons.  Work-Force Scheduling with Cyclic Requirements and Constraints on Days Off, Weekends Off, and Work Stretch , 1985 .

[230]  T. Bell,et al.  Location-Allocation Modeling in Archaeological Settlement Pattern Research: Some Preliminary Applications , 1985 .

[231]  A. Frieze,et al.  A simple heuristic for the p-centre problem , 1985 .

[232]  David J. Eaton,et al.  Determining Emergency Medical Service Vehicle Deployment in Austin, Texas , 1985 .

[233]  Richard L. Church,et al.  A Median Location Model with Nonclosest Facility Service , 1985, Transp. Sci..

[234]  G. Nemhauser,et al.  Covering, Packing and Generalized Perfection , 1985 .

[235]  F. Hwang,et al.  Optimal Set Partitioning , 1985 .

[236]  James E. Bailey,et al.  Integrated days off and shift personnel scheduling , 1985 .

[237]  R Duguid,et al.  THE VEHICLE SCHEDULING PROBLEM WITH INTERLINING. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .

[238]  M Leprince,et al.  VEHICLE AND CREW SCHEDULING AT THE SOCIETE DES TRANSPORTS INTERCOMMUNAUX DE BRUXELLES. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .

[239]  B Hagberg.  AN ASSIGNMENT APPROACH TO THE ROSTERING PROBLEM: AN APPLICATION TO TAXI VEHICLES. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .

[240]  A El-Azm,et al.  THE MINIMUM FLEET SIZE PROBLEM AND ITS APPLICATIONS TO BUS SCHEDULING. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .

[241]  Jacques Desrosiers,et al.  ROUTING AND SCHEDULING WITH TIME WINDOWS SOLVED BY NETWORK RELAXATION AND BRANCH-AND-BOUND ON TIME VARIABLES. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .

[242]  G Mitra,et al.  CRU-SCHED--A COMPUTER BASED BUS CREW SCHEDULING SYSTEM USING INTEGER PROGRAMMING. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .

[243]  Marvin D. Nelson,et al.  Implementation techniques for the vehicle routing problem , 1985, Comput. Oper. Res..

[244]  Jacques A. Ferland,et al.  Timetabling problem for university as assignment of activities to resources , 1985, Comput. Oper. Res..

[245]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[246]  Bruce L. Golden,et al.  A comparison of techniques for solving the fleet size and mix vehicle routing problem , 1984 .

[247]  S. Bechtold,et al.  Maximization of Labor Productivity Through Optimal Rest-Break Schedules , 1984 .

[248]  A. Tripathy.  School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

[249]  Alexander H. G. Rinnooy Kan,et al.  Hierarchical vehicle routing problems , 1984, Networks.

[250]  Carlos F. Daganzo,et al.  The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application , 1984, Transp. Sci..

[251]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[252]  Awi Federgruen,et al.  A Combined Vehicle Routing and Inventory Allocation Problem , 1984, Oper. Res..

[253]  Peter Kolesar,et al.  The Feasibility of One-Officer Patrol in New York City , 1984 .

[254]  Zvi Drezner,et al.  The p-Centre Problem—Heuristic and Optimal Algorithms , 1984 .

[255]  Gary D. Scudder.  Priority Scheduling and Spares Stocking Policies for a Repair Shop: The Multiple Failure Case , 1984 .

[256]  Francis J. Vasko,et al.  Using a facility location algorithm to solve large set covering problems , 1984 .

[257]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[258]  Giorgio Gallo,et al.  Network models for vehicle and crew scheduling , 1984 .

[259]  Jacques Desrosiers,et al.  A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .

[260]  Steven R. Evans,et al.  An Heuristic Method for Solving Time-Sensitive Routeing Problems , 1984 .

[261]  I. Moon,et al.  An Analysis of Network Location Problems with Distance Constraints , 1984 .

[262]  Francis J. Vasko,et al.  An efficient heuristic for large set covering problems , 1984 .

[263]  Gilbert Laporte,et al.  Two exact algorithms for the distance-constrained vehicle routing problem , 1984, Networks.

[264]  John E. Beasley.  An algorithm for the steiner problem in graphs , 1984, Networks.

[265]  J. Barceló,et al.  A heuristic lagrangean algorithm for the capacitated plant location problem , 1984 .

[266]  Egon Balas.  A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers , 1984, Math. Oper. Res..

[267]  Ronald L. Rardin,et al.  Surrogate Dual Multiplier Search Procedures in Integer Programming , 1984, Oper. Res..

[268]  F. Glover,et al.  A heuristic programming approach to the employee scheduling problem and some thoughts on “managerial robots” , 1984 .

[269]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[270]  Gilbert Laporte,et al.  Examination timetabling by computer , 1982, Comput. Oper. Res..

[271]  John E. Beasley,et al.  A heuristic algorithm for the period vehicle routing problem , 1984 .

[272]  Bruce L. Golden,et al.  A Lagrangean relaxation heuristic for vehicle routing , 1984 .

[273]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[274]  James H. Patterson,et al.  An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem , 1984 .

[275]  M Minoux,et al.  COLUMN GENERATION TECHNIQUES IN COMBINATORIAL OPTIMIZATION : A NEW APPLICATION TO CREW PAIRING , 1984 .

[276]  Bruce L. Golden,et al.  Analysis of a large scale vehicle routing problem with an inventory component , 1984 .

[277]  Bruce L. Golden,et al.  The fleet size and mix vehicle routing problem , 1984, Comput. Oper. Res..

[278]  Abraham Mehrez,et al.  An extended continuous maximal covering location problem with facility placement , 1984, Comput. Oper. Res..

[279]  Louis M. Dalberto,et al.  Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .

[280]  Gerhard O. Mensch,et al.  TIMS Studies in the management sciences : Burton V. Dean and Joel L. Goldhar (eds.), Management of Research and Innovation, North-Holland Publishing Company, Amsterdam, Vol. 15, 1980, 300 pp. , 1983 .

[281]  A. Mehrez.  A NOTE ON THE LINEAR INTEGER FORMULATION OF THE MAXIMAL COVERING LOCATION PROBLEM WITH FACILITY PLACEMENT ON THE ENTIRE PLANE , 1983 .

[282]  Roger V. Johnson,et al.  A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities , 1983 .

[283]  James A. Reggia,et al.  Diagnostic Expert Systems Based on a Set Covering Model , 1983, Int. J. Man Mach. Stud..

[284]  D. Chinhyung Cho,et al.  On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems , 1983, Math. Oper. Res..

[285]  Manfred Padberg,et al.  On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets , 1983, Math. Oper. Res..

[286]  James A. Fitzsimmons,et al.  A Warehouse Location Model Helps Texas Comptroller Select Out-of-State Audit Offices , 1983 .

[287]  H. Psaraftis.  An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .

[288]  Michael J. Showalter,et al.  Simple Approaches to Shift, Days-Off and Tour Scheduling Problems , 1983 .

[289]  Harilaos N. Psaraftis,et al.  k-Interchange procedures for local search in a precedence-constrained routing problem , 1983 .

[290]  R. H. Mole,et al.  The Curse of Unintended Rounding Error: A Case from the Vehicle Scheduling Literature , 1983 .

[291]  R. L. Collins,et al.  A Minimal Technology Routing System for Meals on Wheels , 1983 .

[292]  N. Megiddo,et al.  The Maximum Coverage Location Problem , 1983 .

[293]  R. Church,et al.  Computational Procedures for Location Problems on Stochastic Networks , 1983 .

[294]  A. Volgenant,et al.  Solving symmetric vehicle routing problems asymmetrically , 1983 .

[295]  R. L. Francis,et al.  State of the Art-Location on Networks: A Survey. Part II: Exploiting Tree Network Structure , 1983 .

[296]  Harilaos N. Psaraftis.  Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem , 1983 .

[297]  Timothy J. Lowe,et al.  Location on Networks: A Survey. Part I: The p-Center and p-Median Problems , 1983 .

[298]  Leon F. McGinnis,et al.  Invited reviewLocational analysis , 1983 .

[299]  A. Kolen.  Solving covering problems and the uncapacitated plant location problem on trees , 1983 .

[300]  Mark S. Daskin,et al.  A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution , 1983 .

[301]  Lawrence Bodin,et al.  A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles , 1983 .

[302]  Robert E. Markland,et al.  Improving Transit Check Clearing Operations at Maryland National Bank , 1983 .

[303]  D Ronen,et al.  CARGO SHIPS ROUTING AND SCHEDULING: SURVEY OF MODELS AND PROBLEMS. IN: MARITIME TRANSPORT , 1983 .

[304]  Lawrence Bodin,et al.  PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTION , 1983 .

[305]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[306]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[307]  Kenneth L. Roberts,et al.  Generalized coverage models and public facility location , 1983 .

[308]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[309]  S. C. Wirasinghe,et al.  An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region , 1983 .

[310]  John E. Beasley,et al.  Vehicle Fleet Composition , 1983 .

[311]  Omer Saatcioglu,et al.  Mathematical programming models for airport site selection , 1982 .

[312]  Andrew C. Ho.  Worst case analysis of a class of set covering heuristics , 1982, Math. Program..

[313]  C. Watson-Gandy.  Heuristic procedures for the m-partial cover problem on a plane , 1982 .

[314]  B. W. Williams,et al.  Vehicle Scheduling: Proximity Priority Searching , 1982 .

[315]  Tony J. Van Roy,et al.  A Dual-Based Procedure for Dynamic Facility Location , 1982 .

[316]  Ole M. Raft.  A modular algorithm for an extended vehicle scheduling problem , 1982 .

[317]  Abraham Mehrez,et al.  THE MAXIMAL COVERING LOCATION PROBLEM WITH FACILITY PLACEMENT ON THE ENTIRE PLANE , 1982 .

[318]  F. C. Weston.  Optimal configuration of telephone answering sites in a service industry , 1982 .

[319]  Ramchandran Jaikumar,et al.  A COMPUTERIZED VEHICLE ROUTING APPLICATION , 1982 .

[320]  G. Mitra,et al.  Computer Scheduling of Public Transport , 1982 .

[321]  Mark S. Daskin,et al.  APPLICATION OF AN EXPECTED COVERING MODEL TO EMERGENCY MEDICAL SERVICE SYSTEM DESIGN , 1982 .

[322]  Charles ReVelle,et al.  The Hierarchical Service Location Problem , 1982 .

[323]  James M. Tien,et al.  On Manpower Scheduling Algorithms , 1982 .

[324]  Gamini Gunawardane,et al.  Dynamic versions of set covering type public facility location problems , 1982 .

[325]  Marc J. Schniederjans,et al.  An Application of Goal Programming to Resolve a Site Location Problem , 1982 .

[326]  V. Mabert,et al.  A Simulation Analysis of Tour-Shift Construction Procedures , 1982 .

[327]  Regina Benveniste.  A Note on the Set Covering Problem , 1982 .

[328]  R. P. Davis,et al.  The dynamic set covering próblem , 1982 .

[329]  David A. Schilling,et al.  STRATEGIC FACILITY PLANNING: THE ANALYSIS OF OPTIONS , 1982 .

[330]  L. Wolsey,et al.  On the greedy heuristic for continuous covering and packing problems , 1982 .

[331]  I. M. Cheshire,et al.  A Dual Heuristic for Vehicle Scheduling , 1982 .

[332]  John M. Mulvey.  A classroom/time assignment model , 1982 .

[333]  R. Church,et al.  Selecting sites for rural health workers. , 1982, Social science & medicine.

[334]  J. Storbeck.  Slack, natural slack, and location covering. , 1982, Socio-economic planning sciences.

[335]  M. J. Hodgson.  A location—allocation model maximizing consumers' welfare , 1981 .

[336]  P. McKeown.  A branch‐and‐bound algorithm for solving fixed charge problems , 1981 .

[337]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[338]  H. Stern,et al.  DEFICIT FUNCTION BUS SCHEDULING WITH DEADHEADING TRIP INSERTIONS FOR FLEET SIZE REDUCTION , 1981 .

[339]  Anthony Wren,et al.  Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling , 1981 .

[340]  Nirbhay K. Mehta.  The Application of a Graph Coloring Method to an Examination Scheduling Problem , 1981 .

[341]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[342]  Robert E. Markland,et al.  Theory and Application of an Optimizing Procedure for Lock Box Location Analysis , 1981 .

[343]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[344]  Onno B. de Gans,et al.  A computer timetabling system for secondary schools in the Netherlands , 1981 .

[345]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[346]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[347]  Linus Schrage,et al.  Formulation and structure of more complex/realistic routing and scheduling problems , 1981, Networks.

[348]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[349]  Roy E. Marsten,et al.  Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications , 1981, Networks.

[350]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[351]  H. D. Ratliff,et al.  Set partitioning based heuristics for interactive routing , 1981, Networks.

[352]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

[353]  Fred W. Glover,et al.  A New Optimization Method for Large Scale Fixed Charge Transportation Problems , 1981, Oper. Res..

[354]  John J. Bartholdi,et al.  A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering , 1981, Oper. Res..

[355]  Peter J. Slater.  On Locating a Facility to Service Areas within a Network , 1981, Oper. Res..

[356]  S. Bechtold.  Work force scheduling for arbitrary cyclic demands , 1981 .

[357]  V. Rayward-Smith.  The set covering problem , 1981 .

[358]  Mark S. Daskin,et al.  A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment , 1981 .

[359]  Roger V. Johnson.  Assembly line balancing algorithms: computation comparisons , 1981 .

[360]  R. Rardin,et al.  Surrogate duality in a branch‐and‐bound procedure , 1981 .

[361]  T. Ibaraki,et al.  The Computational Complexity of the m -Center Problems on the Plane , 1981 .

[362]  Kenneth Chelst.  Deployment of One-vs. Two-Officer Patrol Units: A Comparison of Travel Times , 1981 .

[363]  A.P.H. Saedt.  The siting of green forage drying plants for use by a large number of farms — a location-allocation case study , 1981 .

[364]  Ludo Gelders,et al.  A large scale location-allocation problem in the natural rubber industry , 1981 .

[365]  M. J. Hodgson.  The location of public facilities intermediate to the journey to work , 1981 .

[366]  G. Laporte,et al.  An exact algorithm for minimizing routing and operating costs in depot location , 1981 .

[367]  Arjang A. Assad,et al.  Analytical Models In Rail Transportation: An Annotated Bibliography , 1981 .

[368]  R. Chandrasekaran,et al.  Location on Tree Networks: P-Centre and n-Dispersion Problems , 1981, Math. Oper. Res..

[369]  J. Schreuder.  Application of a location model to fire stations in Rotterdam , 1981 .

[370]  J. Beasley.  Adapting the savings algorithm for varying inter-customer travel times , 1981 .

[371]  Michael Fisher,et al.  Computational results for very large air crew scheduling problems , 1981 .

[372]  Bruce L. Golden,et al.  Two generalizations of the traveling salesman problem , 1981 .

[373]  Reuven R. Levary,et al.  Heuristic vehicle scheduling , 1981 .

[374]  H. Thuve.  Frequency planning as a set partitioning problem , 1981 .

[375]  L. R. Foulds,et al.  THE VEHICLE SCHEDULING PROBLEM: A SURVEY , 1981 .

[376]  Lawrence Bodin,et al.  EXPERIMENTATION WITH A COMPUTERIZED SYSTEM FOR SCHEDULING MASS TRANSIT VEHICLES AND CREWS. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT , 1981 .

[377]  J M Borret,et al.  CREW SCHEDULING BY COMPUTER: A TEST ON THE POSSIBILITY OF DESIGNING DUTIES FOR A CERTAIN BUS LINE. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT , 1981 .

[378]  Lawrence Bodin,et al.  Scheduling of Drivers for Mass Transit Systems Using Interactive Optimisation , 1981 .

[379]  P A Durant,et al.  A PROBLEM DECOMPOSITION APPROACH TO SCHEDULING THE DRIVERS AND CREWS OF MASS TRANSIT SYSTEMS. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT , 1981 .

[380]  Lawrence Bodin,et al.  Scheduling and estimation techniques for transportation planning , 1981, Comput. Oper. Res..

[381]  Edward K. Baker,et al.  Efficient heuristic algorithms for the weighted set covering problem , 1981, Comput. Oper. Res..

[382]  Gerald G. Brown,et al.  Real-Time Dispatch of Petroleum Tank Trucks , 1981 .

[383]  Oli B.G. Madsen,et al.  A comparative study of heuristics for a two-level routing-location problem , 1980 .

[384]  Robert P. Cerveny.  An Application of Warehouse Location Techniques to Bloodmobile Operations , 1980 .

[385]  Martin Dyer.  Calculating surrogate constraints , 1980, Math. Program..

[386]  Davis Avis.  A note on some computationally difficult set covering problems , 1980, Math. Program..

[387]  David A. Schilling,et al.  DYNAMIC LOCATION MODELING FOR PUBLIC‐SECTOR FACILITIES: A MULTICRITERIA APPROACH , 1980 .

[388]  James B. Orlin,et al.  Cyclic Scheduling via Integer Programs with Circular Ones , 1980, Oper. Res..

[389]  Helman I. Stern,et al.  Scheduling Aircraft Cleaning Crews , 1980 .

[390]  Jared L. Cohon,et al.  Some models for fire protection locational decisions , 1980 .

[391]  Arabinda Tripathy.  A Lagrangean Relaxation Approach to Course Timetabling , 1980 .

[392]  A Wren,et al.  A GENERAL REVIEW OF THE USE OF COMPUTERS IN SCHEDULING BUSES AND THEIR CREWS , 1980 .

[393]  Arjang A. Assad,et al.  MODELS FOR RAIL TRANSPORTATION , 1980 .

[394]  Yash P. Aneja,et al.  An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

[395]  R. L. Francis,et al.  Binding Inequalities for Tree Network Location Problems with Distance Constraints , 1980 .

[396]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

[397]  Phil McKenzie,et al.  Shift Scheduling in Banking Operations: A Case Application , 1980 .

[398]  S. Albers.  Implicit enumeration algorithms for the Set-Partitioning Problem , 1980 .

[399]  R. E. Marsten,et al.  A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem , 1980 .

[400]  Lawrence Bodin,et al.  A model for the blocking of trains , 1980 .

[401]  François Soumis,et al.  A model for large-scale aircraft routing and scheduling problems , 1980 .

[402]  C. Loren Doll.  Quick and Dirty Vehicle Routing Procedure , 1980 .

[403]  Victor Klee,et al.  Combinatorial Optimization: What is the State of the Art , 1980, Math. Oper. Res..

[404]  V. Mabert,et al.  Improving bank operations: A case study at BancOhio/Ohio National Bank , 1980 .

[405]  M. Fisher.  Worst-Case Analysis of Heuristic Algorithms , 1980 .

[406]  M. Guignard.  Fractional vertices, cuts and facets of the simple plant location problem , 1980 .

[407]  Lawrence Bodin,et al.  HIERARCHICAL PROCEDURES FOR DETERMINING VEHICLE AND CREW REQUIREMENTS FOR MASS TRANSIT SYSTEMS , 1980 .

[408]  A Charnes,et al.  A goal programming model for the siting of multilevel EMS systems. , 1980, Socio-economic planning sciences.

[409]  Russell C. Eberhart,et al.  Application of a multiobjective facility location model to power plant siting in a six-state region of the U.S , 1980, Comput. Oper. Res..

[410]  Jacques A. Ferland,et al.  School bus routes generator in urban surroundings , 1980, Comput. Oper. Res..

[411]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[412]  E. Balas.  Cutting planes from conditional bounds: A new approach to set covering , 1980 .

[413]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[414]  Michael W. Carter,et al.  Staff Scheduling with Day-Off and Workstretch Constraints , 1979 .

[415]  Roy E. Marsten,et al.  Crew Planning at Flying Tiger: A Successful Application of Integer Programming , 1979 .

[416]  Monique Guignard-Spielberg,et al.  A direct dual method for the mixed plant location problem with some side constraints , 1979, Math. Program..

[417]  George L. Nemhauser,et al.  Easy and hard bottleneck location problems , 1979, Discret. Appl. Math..

[418]  Frank Thomson Leighton,et al.  A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[419]  Lazaros P. Mavrides.  An Indirect Method for the Generalized k-Median Problem Applied to Lock-Box Location , 1979 .

[420]  J. A. M. Wolters.  Minimising the number of aircraft for a transportation network , 1979 .

[421]  George M. White,et al.  Towards The Construction Of Optimal Examination Schedules , 1979 .

[422]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[423]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[424]  Laurence A. Wolsey,et al.  An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit , 1979, Oper. Res..

[425]  E. Minieka.  The Chinese Postman Problem for Mixed Networks , 1979 .

[426]  Vincent A. Mabert,et al.  A Case Study of Encoder Shift Scheduling under Uncertainty , 1979 .

[427]  Amedeo R. Odoni,et al.  Locating new passenger facilities on a transportation network , 1979 .

[428]  Edward Keefer Baker,et al.  Efficient heuristic solutions for the airline crew scheduling problem , 1979 .

[429]  Lawrence Bodin,et al.  Routing and Scheduling of School Buses by Computer , 1979 .

[430]  Hilbert K. Schultz.  A Practical Method for Vehicle Scheduling , 1979 .

[431]  Adel Gaballa,et al.  Telephone Sales Manpower Planning at Qantas , 1979 .

[432]  Richard L. Church,et al.  The Team/Fleet Models for Simultaneous Facility and Equipment Siting , 1979 .

[433]  M. Woodbury,et al.  HLA serum screening based on an heuristic solution of the set cover problem. , 1979, Computer programs in biomedicine.

[434]  A. Odoni,et al.  Locations of Medians on Stochastic Networks , 1979 .

[435]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[436]  Bezalel Gavish,et al.  An approach for solving a class of transportation scheduling problems , 1979 .

[437]  R. H. Mole,et al.  A Survey of Local Delivery Vehicle Routing Methodology , 1979 .

[438]  R. Russell,et al.  An assignment routing problem , 1979, Networks.

[439]  R. Nauss,et al.  Solving Lock Box Location Problems , 1979 .

[440]  J. M. Lowerre.  ON PERSONNEL BUDGETING FOR CONTINUOUS OPERATIONS (WITH EMPHASIS ON HOSPITALS) , 1979 .

[441]  N. Patel.  Locating Rural Social Service Centers in India , 1979 .

[442]  S. Bechtold.  Quantitative models for optimal rest period scheduling: a note , 1979 .

[443]  J. Shapiro.  A Survey of Lagrangian Techniques for Discrete Optimization. , 1979 .

[444]  M. Padberg.  Covering, Packing and Knapsack Problems , 1979 .

[445]  Pitu B. Mirchandani,et al.  Location on networks : theory and algorithms , 1979 .

[446]  Moshe Dror,et al.  Routing electric meter readers , 1979, Comput. Oper. Res..

[447]  Lawrence Bodin,et al.  A detailed description of a computer system for the routing and scheduling of street sweepers , 1979, Comput. Oper. Res..

[448]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[449]  A. Barham,et al.  A Simple Heuristic to Facilitate Course Timetabling , 1978 .

[450]  A. Neebe.  Branch and Bound Algorithm for the p-Median Transportation Problem , 1978 .

[451]  Carlos F. Daganzo,et al.  An approximate analytic model of many-to-many demand responsive transportation systems , 1978 .

[452]  Der-San Chen.  A Simple Algorithm for A Workforce Scheduling Model , 1978 .

[453]  Kenneth Chelst.  An Algorithm for Deploying a Crime Directed Tactical Patrol Force , 1978 .

[454]  J. Chaiken,et al.  A Patrol Car Allocation Model: Background , 1978 .

[455]  David M. Stein,et al.  Scheduling Dial-a-Ride Transportation Systems , 1978 .

[456]  Lawrence Bodin,et al.  A Computer-Assisted System for the Routing and Scheduling of Street Sweepers , 1978, Oper. Res..

[457]  Timothy J. Lowe,et al.  Distance Constraints for Tree Network Multifacility Location Problems , 1978, Oper. Res..

[458]  Richard N. Burns,et al.  Manpower Scheduling With Variable Demands And Alternate Weekends Off , 1978 .

[459]  H. D. Ratliff,et al.  A Cut Approach to the Rectilinear Distance Facility Location Problem , 1978, Oper. Res..

[460]  R. Garfinkel,et al.  Locating an Obnoxious Facility on a Network , 1978 .

[461]  David M. Stein,et al.  An Asymptotic, Probabilistic Analysis of a Routing Problem , 1978, Math. Oper. Res..

[462]  H. D. Ratliff,et al.  Unnetworks, with Applications to Idle Time Scheduling , 1978 .

[463]  Jan M. Chaiken,et al.  Transfer of Emergency Service Deployment Models to Operating Agencies , 1978 .

[464]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[465]  S. Hakimi,et al.  On p -Centers in Networks , 1978 .

[466]  D. Werra.  Some comments on a note about timetabling , 1978 .

[467]  Joe. D. Megeath,et al.  Successful Hospital Personnel Scheduling , 1978 .

[468]  Elio Cunto.  Scheduling Boats to Sample Oil Wells in Lake Maracaibo , 1978, Oper. Res..

[469]  Leon F. McGinnis,et al.  One- and two-phase heuristics for workforce scheduling , 1978 .

[470]  Paul J. Schweitzer,et al.  Assigning buses to schedules in a metropolitan area , 1978, Comput. Oper. Res..

[471]  Bezalel Gavish,et al.  On obtaining the 'best' multipliers for a lagrangean relaxation for integer programming , 1978, Comput. Oper. Res..

[472]  D. Erlenkotter.  Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public , 1977 .

[473]  Jean-Louis Goffin,et al.  On convergence rates of subgradient optimization methods , 1977, Math. Program..

[474]  G. Ross,et al.  Modeling Facility Location Problems as Generalized Assignment Problems , 1977 .

[475]  Kenneth R. Baker,et al.  Workforce Scheduling with Cyclic Demands and Day-Off Constraints , 1977 .

[476]  Maurice Pollack,et al.  SOME ELEMENTS OF THE AIRLINE FLEET PLANNING PROBLEM , 1977 .

[477]  David J. Houck,et al.  An Algorithm for the Vertex Packing Problem , 1977, Oper. Res..

[478]  Javier Etcheberry,et al.  The Set-Covering Problem: A New Implicit Enumeration Algorithm , 1977, Oper. Res..

[479]  Edward Minieka,et al.  The Centers and Medians of a Graph , 1977, Oper. Res..

[480]  Subhash C. Narula,et al.  Technical Note - An Algorithm for the p-Median Problem , 1977, Oper. Res..

[481]  Donald R. Plane,et al.  Mathematical Programming and the Location of Fire Companies for the Denver Fire Department , 1977, Oper. Res..

[482]  C. S. Orloff.  A Theoretical Model of Net Accessibility in Public Facility Location , 1977 .

[483]  Javier Márquez Diez-Canedo,et al.  A network solution to a general vehicle scheduling problem , 1977 .

[484]  M. Rao,et al.  The m-Center Problem: Minimax Facility Location , 1977 .

[485]  Bruce L. Golden,et al.  Evaluating a Sequential Vehicle Routing Algorithm , 1977 .

[486]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

[487]  Robert A. Russell,et al.  Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions , 1977, Oper. Res..

[488]  James M. Lowerre.  Work Stretch Properties for the Scheduling of Continuous Operations Under Alternative Labor Policies , 1977 .

[489]  S. Arisawa,et al.  The "Hub" and "Wheel" Scheduling Problems II. The Hub Operation Scheduling Problem (HOSP): Multi Period and Infinite Horizon, and the Wheel Operation Scheduling Problem (WOSP) * , 1977 .

[490]  S. Elmaghraby,et al.  The “Hub” and “Wheel” Scheduling Problems , 1977 .

[491]  Robert G. Bland,et al.  New Finite Pivoting Rules for the Simplex Method , 1977, Math. Oper. Res..

[492]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[493]  Gary M. Roodman,et al.  Extensions of the Multi-Period Facility Phase-Out Model: New Procedures and Application to a Phase-In/Phase-Out Problem , 1977 .

[494]  E G Read,et al.  A manual solution procedure for the school bus routing problem , 1977 .

[495]  C. S. Orloff,et al.  An improvement of Orloff's general routing problem , 1977, Networks.

[496]  G. B. Sinclair,et al.  Computer Scheduling of Beer Tanker Deliveries , 1977 .

[497]  I. Gertsbach,et al.  Constructing an Optimal Fleet for a Transportation Schedule , 1977 .

[498]  R. R. Vemuganti,et al.  A Row Generation Scheme for Finding a Multi-Commodity Minimum Disconnecting Set , 1977 .

[499]  B. M. Khumawala,et al.  An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .

[500]  Vasek Chvátal,et al.  Determining the Stability Number of a Graph , 1976, SIAM J. Comput..

[501]  Vincent A. Mabert,et al.  THE DETAIL SCHEDULING OF A PART-TIME WORK FORCE: A CASE STUDY OF TELLER STAFFING , 1977 .

[502]  G. L. Gentzler,et al.  Quantitative models for optimal rest period scheduling , 1977 .

[503]  Lee J. Krajewski,et al.  Disaggregation in manufacturing and service organizations: survey of problems and research , 1977 .

[504]  W. L. Berry,et al.  DETERMINING OPTIMAL SHIFT SCHEDULES FOR TELEPHONE TRAFFIC EXCHANGE OPERATORS , 1977 .

[505]  Robert G. Jeroslow,et al.  Cutting-Plane Theory: Disjunctive Methods , 1977 .

[506]  J. Krarup,et al.  Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .

[507]  M. Guignard,et al.  Algorithms for Exploiting the Structure of the Simple Plant Location Problem , 1977 .

[508]  G. Nemhauser,et al.  On the Uncapacitated Location Problem , 1977 .

[509]  L. Douglas Smith,et al.  A computer-based nurse scheduling system , 1977, Comput. Oper. Res..

[510]  Michael J. Showalter,et al.  Manpower allocation in U.S. postal facilities: A heuristic approach , 1977, Comput. Oper. Res..

[511]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[512]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[513]  Clifford S. Orloff,et al.  Reduction and Solution of Large Scale Vehicle Routing Problems , 1976 .

[514]  D. Hearn,et al.  Minimax Multifacility Location with Euclidean Distances , 1976 .

[515]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[516]  Elwood S. Buffa,et al.  AN INTEGRATED WORK SHIFT SCHEDULING SYSTEM , 1976 .

[517]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[518]  Gustave J. Rath,et al.  Nurse Scheduling Using Mathematical Programming , 1976, Oper. Res..

[519]  D. Michael Warner,et al.  Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach , 1976, Oper. Res..

[520]  Jonathan Halpern,et al.  THE LOCATION OF A CENTER-MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE* , 1976 .

[521]  William L. Berry,et al.  Heuristic Methods for Telephone Operator Shift Scheduling: An Experimental Analysis , 1976 .

[522]  Larry P. Ritzman,et al.  The Disaggregation of Aggregate Manpower Plans , 1976 .

[523]  Michael Florian,et al.  The engine scheduling problem in a railway network , 1976 .

[524]  Clifford S. Orloff,et al.  Route Constrained Fleet Scheduling , 1976 .

[525]  David B. Weinberger,et al.  Network Flows, Minimum Coverings, and the Four-Color Conjectures , 1976, Oper. Res..

[526]  Douglas Smith.  The Application Of An Interactive Algorithm To Develop Cyclical Rotational Schedules For Nursing Personnel , 1976 .

[527]  Richard L. Francis,et al.  A Round-Trip Location Problem on a Tree Graph , 1976 .

[528]  Robert Richardson.  An Optimization Approach to Routing Aircraft , 1976 .

[529]  William S. Brownell,et al.  Scheduling of Work Forces Required in Continuous Operations Under Alternative Labor Policies , 1976 .

[530]  B. Gillett,et al.  Multi-terminal vehicle-dispatch algorithm , 1976 .

[531]  P. Macdonald.  Combinatorial Programming: Methods and Applications , 1976 .

[532]  Kenneth R. Baker,et al.  Workforce Allocation in Cyclical Scheduling Problems: A Survey , 1976 .

[533]  R. H. Mole,et al.  A Sequential Route-building Algorithm Employing a Generalised Savings Criterion , 1976 .

[534]  David M. Ryan,et al.  An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .

[535]  Graham K. Rand,et al.  Methodological Choices in Depot Location Studies , 1976 .

[536]  R. A. Holmes,et al.  A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme , 1976 .

[537]  C. S. Orloff.  On general routing problems: Comments , 1976, Networks.

[538]  Jan Karel Lenstra,et al.  On general routing problems , 1976, Networks.

[539]  R. J. Aust.  An Improvement Algorithm for School Timetabling , 1976, Comput. J..

[540]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[541]  John M. Gleason.  A set covering approach to bus stop location , 1975 .

[542]  D. de Werra.  On a particular conference scheduling problem , 1975 .

[543]  Richard C. Larson,et al.  Approximating the Performance of Urban Emergency Service Systems , 1975, Oper. Res..

[544]  Margaret K. Schaefer,et al.  Solutions of Constrained Location Problems , 1975 .

[545]  Wayne Turner,et al.  The Optimal Routing of Solid Waste Collection Vehicles , 1975 .

[546]  Gary M. Roodman,et al.  Optimal and Heuristic Facility Phase-out Strategies , 1975 .

[547]  Fred Glover,et al.  Surrogate Constraint Duality in Mathematical Programming , 1975, Oper. Res..

[548]  Chihchih C. Lin.  Letter to the Editor—On Vertex Addends in Minimax Location Problems , 1975 .

[549]  J. M. P. Booler.  A Method for Solving Crew Scheduling Problems , 1975 .

[550]  James H. Patterson,et al.  Technical Note - Assembly-Line Balancing: Zero-One Programming with Fibonacci Search , 1975, Oper. Res..

[551]  Egon Balas,et al.  On the Set-Covering Problem: II. An Algorithm for Set Partitioning , 1972, Oper. Res..

[552]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[553]  Nicos Christofides,et al.  Note—A Computational Survey of Methods for the Set Covering Problem , 1975 .

[554]  W. D. Northup,et al.  USING DUALITY TO SOLVE DISCRETE OPTIMIZATION PROBLEMS: THEORY AND COMPUTATIONAL EXPERIENCE* , 1975 .

[555]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[556]  Don B. Chaffin,et al.  PROBLEM OF MANUAL MATERIALS HANDLING. , 1975 .

[557]  D E Cullen,et al.  ALGORITHM FOR TRANSPORTATION ROUTING AND VEHICLE LOADING , 1975 .

[558]  E Heurgon,et al.  PREPARING DUTY ROSTERS FOR BUS ROUTES BY COMPUTER , 1975 .

[559]  Lawrence D. Bodin,et al.  A taxonomic structure for vehicle routing and scheduling problems , 1975 .

[560]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[561]  Jan Karel Lenstra,et al.  Some Simple Applications of the Travelling Salesman Problem , 1975 .

[562]  Geoffrey N. Berlin,et al.  Mathematical analysis of emergency ambulance location , 1974 .

[563]  Margaret K. Schaefer,et al.  An algorithm for the solution of a location problem with metric constraints , 1974 .

[564]  W. Turner,et al.  Transportation Routing Problem—A Survey , 1974 .

[565]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[566]  Bernd A. Knauer.  Solution of a timetable problem , 1974, Comput. Oper. Res..

[567]  Ashok Rao.  Technical Note - Counterexamples for the Location of Emergency Service Facilities , 1974, Oper. Res..

[568]  Leslie E. Trotter,et al.  Properties of vertex packing and independence system polyhedra , 1974, Math. Program..

[569]  Manfred W. Padberg,et al.  Perfect zero–one matrices , 1974, Math. Program..

[570]  R. V. Oakford,et al.  A graph formulation of a school scheduling algorithm , 1974, Commun. ACM.

[571]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[572]  R. L. Francis,et al.  A Minimax Location Problem on a Network , 1974 .

[573]  Basheer M. Khumawala,et al.  Note---A Note on El-Shaieb's New Algorithm for Locating Sources Among Destinations , 1974 .

[574]  R. Swain.  A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems , 1974 .

[575]  Kenneth R. Baker,et al.  Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements , 1974 .

[576]  Warren H. Thomas,et al.  Bus routing in a multi-school system , 1974, Comput. Oper. Res..

[577]  M. Segal,et al.  The Operator-Scheduling Problem: A Network-Flow Approach , 1974, Oper. Res..

[578]  G. Nemhauser,et al.  Set Partitioning and Chain Decomposition , 1974 .

[579]  Chung C. Wang,et al.  An Algorithm for the Chromatic Number of a Graph , 1974, JACM.

[580]  Mandell Bellmore,et al.  Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem , 1974, JACM.

[581]  M. Fisher,et al.  Constructive Duality in Integer Programming , 1974 .

[582]  H. O. Hartley,et al.  Computerized scheduling of seagoing tankers , 1974 .

[583]  C. B. Millham,et al.  The Optimal Location of Nuclear-Power Facilities in the Pacific Northwest , 1974, Oper. Res..

[584]  R. L. Francis,et al.  A Network Flow Solution to a Multifacility Minimax Location Problem Involving Rectilinear Distances , 1974 .

[585]  H Fullerton,et al.  AN OPTIMIZING NETWORK MODEL FOR THE CANADIAN RAILWAYS , 1974 .

[586]  Warren Walker,et al.  Using the Set-Covering Problem to Assign Fire Companies to Fire Houses , 1974, Oper. Res..

[587]  R. L. Francis,et al.  Technical Note - Location Theory: A Selective Bibliography , 1974, Oper. Res..

[588]  Peter J. Kolesar,et al.  An Algorithm for the Dynamic Relocation of Fire Companies , 1974, Oper. Res..

[589]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[590]  D. R. Fulkerson,et al.  On balanced matrices , 1974 .

[591]  S. Halfin.  Letter to the Editor—On Finding the Absolute and Vertex Centers of a Tree with Distances , 1974 .

[592]  D. R. Fulkerson,et al.  Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems , 1974 .

[593]  William J. Abernathy,et al.  COMPARISON OF NURSE ALLOCATION POLICIES‐A MONTE CARLO MODEL* , 1974 .

[594]  R. E. Marsten.  An Algorithm for Large Set Partitioning Problems , 1974 .

[595]  Raymond Breu,et al.  Branch and bound experiments in zero-one programming , 1974 .

[596]  Jeffrey D. Ullman,et al.  Worst case bounds for simple one-dimensional packing algorithms , 1974 .

[597]  Fjm Salzborn,et al.  MINIMUM FLEET SIZE MODELS FOR TRANSPORTATION SYSTEMS , 1974 .

[598]  C. S. Orloff.  A fundamental problem in vehicle routing , 1974, Networks.

[599]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[600]  C. S. Orloff.  Routing a fleet of M vehicles to/from a central facility , 1974, Networks.

[601]  Salah E. Elmaghraby,et al.  Symposium on the Theory of Scheduling and Its Applications , 1973 .

[602]  R. Crow,et al.  Alternative demand functions for “abstract” transportation modes , 1973 .

[603]  J. G. Church.  Sure Staf: A Computerized Staff Scheduling System for Telephone Business Offices , 1973 .

[604]  Bruce P. Graham,et al.  An Algorithm for Determining the Chromatic Number of a Graph , 1973, SIAM J. Comput..

[605]  Gautam Mitra.  Investigation of some branch and bound strategies for the solution of mixed integer linear programs , 1973, Math. Program..

[606]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[607]  Christoph Maier-Rothe,et al.  Cyclical scheduling and allocation of nursing staff , 1973 .

[608]  A. M. El-Shaieb,et al.  A New Algorithm for Locating Sources Among Destinations , 1973 .

[609]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..

[610]  J. L. Byrne,et al.  Scheduling of Toll Collectors , 1973 .

[611]  G. Handler.  Minimax Location of a Facility in an Undirected Tree Graph , 1973 .

[612]  George O. Wesolowsky,et al.  Dynamic Facility Location , 1973 .

[613]  Kenneth R. Baker,et al.  An Optimal Procedure for Allocating Manpower with Cyclic Requirements , 1973 .

[614]  J. J. McDonald,et al.  The Savings Method for Vehicle Scheduling , 1973 .

[615]  William J. Abernathy,et al.  A Three-Stage Manpower Planning and Scheduling Model - A Service-Sector Example , 1973, Oper. Res..

[616]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[617]  Harvey M. Salkin,et al.  Set Covering by an All Integer Algorithm: Computational Experience , 1973, JACM.

[618]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[619]  John A. White,et al.  On Solving Multifacility Location Problems using a Hyperboloid Approximation Procedure , 1973 .

[620]  B. M. Khumawala.  An efficient heuristic procedure for the uncapacitated warehouse location problem , 1973 .

[621]  A. Alan B. Pritsker.  A Note to Correct the Procedure of Pritsker and Ghare for Locating New Facilities with Respect to Existing Facilities , 1973 .

[622]  James A. Fitzsimmons,et al.  A Methodology for Emergency Ambulance Deployment , 1973 .

[623]  J. Rubin.  A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling , 1973 .

[624]  R. E. Wendell,et al.  Optimal Locations on a Network , 1973 .

[625]  D. Hearn,et al.  Letter to the Editor—A Note on a Minimax Location Problem , 1973 .

[626]  G. Owen.  Cutting planes for programs with disjunctive constraints , 1973 .

[627]  J. F. Pierce,et al.  Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems , 1973 .

[628]  G. O. Wesolowsky,et al.  A multi-facility minimax location method for Euclidean distances , 1973 .

[629]  K. G. Murty.  On The Set Representation and Set Covering Problems , 1973 .

[630]  G. Nemhauser,et al.  A Survey of Integer Programming Emphasizing Computation and Relations among Models , 1973 .

[631]  M. Rothstein.  Hospital manpower shift scheduling by mathematical programming. , 1973, Health services research.

[632]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[633]  G. Nemhauser,et al.  Integer Programming , 2020 .

[634]  D. Warner,et al.  A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital , 1972 .

[635]  Jon C. Liebman,et al.  Optimal location of public facilities , 1972 .

[636]  J. R. Brown.  Chromatic Scheduling and the Chromatic Number Problem , 1972 .

[637]  R. L. Francis.  A Geometrical Solution Procedure for a Rectilinear Distance Minimax Location Problem1 , 1972 .

[638]  A. M. Geoffrion.  Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[639]  Brian T. Bennett,et al.  SCHOOL BUS ROUTING BY COMPUTER , 1972 .

[640]  J. J. McDonald.  Vehicle Scheduling — A Case Study , 1972 .

[641]  Nicos Christofides,et al.  Algorithms for Large-scale Travelling Salesman Problems , 1972 .

[642]  Egon Balas,et al.  On the Set-Covering Problem , 1972, Oper. Res..

[643]  A. J. Goldman.  Minimax Location of a Facility in a Network , 1972 .

[644]  D. Hearn,et al.  Geometrical Solutions for Some Minimax Location Problems , 1972 .

[645]  P. Michaud.  Exact implicit enumeration method for solving the set partitioning problem , 1972 .

[646]  S. L. Hakimi,et al.  Optimum Locations of Centers in Networks , 1972, Oper. Res..

[647]  R. Tibrewala,et al.  Optimal Scheduiing of Two Consecutive Idle Periods , 1972 .

[648]  S. Eilon,et al.  The Depot Siting Problem with Discontinuous Delivery Cost , 1972 .

[649]  D. Hearn,et al.  The Minimum Covering Sphere Problem , 1972 .

[650]  M. H. J. Webb,et al.  Relative Performance of Some Sequential Methods of Planning Multiple Delivery Journeys , 1972 .

[651]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[652]  Robert F. Love,et al.  A COMPUTATIONAL PROCEDURE FOR OPTIMALLY LOCATING A FACILITY WITH RESPECT TO SEVERAL RECTANGULAR REGIONS , 1972 .

[653]  B. M. Khumawala.  An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .

[654]  F. Salzborn.  Letter to the Editor—A Note on Fleet Routing Models for Transportation Systems , 1972 .

[655]  G. O. Wesolowsky,et al.  A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem , 1972 .

[656]  F. A. Tillman,et al.  An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem , 1972 .

[657]  R. L. Francis,et al.  Properties of a multifacility location problem involving euclidian distances , 1972 .

[658]  P. J. Cassidy,et al.  TRAMP-A MULTI-DEPOT VEHICLE SCHEDULING SYSTEM , 1972 .

[659]  Ralph L. Keeney.  A Method for Districting Among Facilities , 1972, Oper. Res..

[660]  Richard C. Larson,et al.  On Insensitivities in Urban Redistricting and Facility Location , 1972, Oper. Res..

[661]  A. M. Geoffrion,et al.  Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[662]  A. J. Goldman.  Approximate Localization Theorems for Optimal Facility Placement , 1972 .

[663]  G. O. Wesolowsky.  Rectangular Distance Location under the Minimax Optimality Criterion , 1972 .

[664]  Patrick D. Krolak,et al.  A Man-Machine Approach Toward Solving the Generalized Truck-Dispatching Problem , 1972 .

[665]  C. Watson-Gandy.  A Note on the Centre of Gravity in Depot Location , 1972 .

[666]  D. F. Gibson,et al.  A Quantified Model for Facility Site Selection-Application to a Multiplant Location Problem , 1972 .

[667]  R. Love,et al.  Modelling Inter-city Road Distances by Mathematical Functions , 1972 .

[668]  D. G. Elson.  Site Location via Mixed-integer Programming , 1972 .

[669]  Andrew B. Whinston,et al.  Computer-Assisted School Bus Scheduling , 1972 .

[670]  Pertti Järvinen,et al.  Technical Note - A Branch-and-Bound Algorithm for Seeking the P-Median , 1972, Oper. Res..

[671]  Leon Cooper,et al.  The Transportation-Location Problem , 1972, Oper. Res..

[672]  E. Beale,et al.  Applications of Mathematical Programming Techniques. , 1971 .

[673]  Charles ReVelle,et al.  Optimal location under time or distance constraints , 1972 .

[674]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[675]  B. Roy.  AN ALGORITHM FOR A GENERAL CONSTRAINED SET COVERING PROBLEM , 1972 .

[676]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[677]  C. Rydell.  A NOTE ON THE PRINCIPLE OF MEDIAN LOCATION: COMMENT , 1971 .

[678]  Charles S. Tapiero.  TRANSPORTATION‐LOCATION‐ALLOCATION PROBLEMS OVER TIME* , 1971 .

[679]  H. D. Ratliff,et al.  Optimal Defense of Multi-Commodity Networks , 1971 .

[680]  R. Snyder.  A NOTE ON THE PRINCIPLE OF MEDIAN LOCATION , 1971 .

[681]  P. Gray,et al.  Solving Fixed Charge Location-Allocation Problems with Capacity and Configuration Constraints , 1971 .

[682]  K. Nair,et al.  Optimal location of a single service center of certain types , 1971 .

[683]  H. D. Ratliff,et al.  Set Covering and Involutory Bases , 1971 .

[684]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[685]  R. Snyder.  A Note on the Location of Depots , 1971 .

[686]  D. Deighton.  Communications to the Editor--A Comment on Location Models , 1971 .

[687]  Amos Levin.  Scheduling and Fleet Routing Models for Transportation Systems , 1971 .

[688]  F. A. Tillman,et al.  A study of a look-ahead procedure for solving the multiterminal delivery problem , 1971 .

[689]  Kurt Spielberg,et al.  Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..

[690]  Leon S. Lasdon,et al.  An Efficient Algorithm for Multi-Item Scheduling , 1971, Oper. Res..

[691]  Nicos Christofides,et al.  The Optimum Location of Multi-centres on a Graph , 1971 .

[692]  A. J. Goldman.  Optimal Center Location in Simple Networks , 1971 .

[693]  Richard A. Volz.  Optimum Ambulance Location in Semi-Rural Areas , 1971 .

[694]  G. O. Wesolowsky,et al.  Location of facilities with rectangular distances among point and area destinations , 1971 .

[695]  Nicos Christofides.  Fixed routes and areas for delivery operations , 1971 .

[696]  L. Appelgren.  Integer Programming Methods for a Vessel Scheduling Problem , 1971 .

[697]  E. Hauer.  Fleet Selection for Public Transportation Routes , 1971 .

[698]  Donald M. Simmons.  Technical Note - A Further Note on One-Dimensional Space Allocation , 1971, Oper. Res..

[699]  G. O. Wesolowsky,et al.  Technical Note - The Optimal Location of New Facilities Using Rectangular Distances , 1971, Oper. Res..

[700]  Nicos Christofides,et al.  An Algorithm for the Chromatic Number of a Graph , 1971, Comput. J..

[701]  Edward Ignall,et al.  Linear Programming Models of Crew Assignments for Refuse Collection. , 1971 .

[702]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[703]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[704]  Nicos Christofides,et al.  Zero-One Programming Using Non-Binary Tree-Search , 1971, Comput. J..

[705]  A. Pritsker,et al.  Locating New Facilities with Respect to Existing Facilities , 1970 .

[706]  James P. Ignizio,et al.  A Heuristic Programming Algorithm for Warehouse Location , 1970 .

[707]  J. L. Saha,et al.  An Algorithm for Bus Scheduling Problems , 1970 .

[708]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[709]  A. J. Goldman,et al.  Letter to the Editor---A Localization Theorem for Optimal Facility Placement , 1970 .

[710]  F. Salzborn.  The Minimum Fleetsize for a Suburban Railway System , 1970 .

[711]  Tenny Lam.  Letter to the Editor—Comments on a Heuristic Algorithm for the Multiple Terminal Delivery Problem , 1970 .

[712]  E. M. Price.  Techniques to Improve Staffing , 1970, The American journal of nursing.

[713]  Dennis R. Young,et al.  Scheduling a Fixed-Schedule, Common Carrier Passenger Transportation System , 1970 .

[714]  D. H. Marks,et al.  An Analysis of Private and Public Sector Location Models , 1970 .

[715]  Cabot A.Victor,et al.  A Network Flow Solution to a Rectilinear Distance Facility Location Problem , 1970 .

[716]  Jerry B. Schneider.  SOLVING URBAN LOCATION PROBLEMS: HUMAN INTUITION VERSUS THE COMPUTER , 1971 .

[717]  P. C. Yellow,et al.  A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .

[718]  Joseph E. Grimes.  Scheduling to reduce conflict in meetings , 1970, CACM.

[719]  A. Martin-Löf.  A Branch-and-Bound Algorithm for Determining the Minimal Fleet Size of a Transportation System , 1970 .

[720]  G. Nemhauser,et al.  Optimal Political Districting by Implicit Enumeration Techniques , 1970 .

[721]  D. H. Marks,et al.  Mathematical Models of Location: A Review , 1970 .

[722]  E. Minieka.  The m-Center Problem , 1970 .

[723]  Richard M. Bodner,et al.  Optimal Routing of Refuse Collection Vehicles , 1970 .

[724]  Robert Stricker,et al.  Public sector vehicle routing : the Chinese postman problem. , 1970 .

[725]  R. Love.  Locating facilities in three-dimensional space by convex programming , 1969 .

[726]  Graciano Sá,et al.  Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem , 1969, Oper. Res..

[727]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[728]  A. J. Goldman.  Optimal Locations for Centers in a Network , 1969 .

[729]  K. Spielberg.  Plant Location with Generalized Search Origin , 1969 .

[730]  Franz J. M. Salzborn,et al.  Timetables for a Suburban Rail Transit System , 1969 .

[731]  George L. Nemhauser,et al.  The Set-Partitioning Problem: Set Covering with Equality Constraints , 1969, Oper. Res..

[732]  Donald M. Simmons.  One-Dimensional Space Allocation: An Ordering Algorithm , 1969, Oper. Res..

[733]  Ronald F. Kirby,et al.  The minimum route problem for networks with turn penalties and prohibitions , 1969 .

[734]  P. S. Davis,et al.  A branch‐bound algorithm for the capacitated facilities location problem , 1969 .

[735]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[736]  F. Tillman.  The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .

[737]  Mary Almond.  A University Faculty Timetable , 1969, Comput. J..

[738]  C. A. Olson,et al.  Medium-Range Scheduling for a Freighter Fleet , 1969, Oper. Res..

[739]  J.-F. Raimond.  Minimaximal paths in disjunctive graphs by direct search , 1969 .

[740]  Warren H. Thomas,et al.  Design of school bus routes by computer , 1969 .

[741]  S. Eilon,et al.  Profile of Current Members of the Operational Research Society , 1969 .

[742]  R. Roth,et al.  Computer Solutions to Minimum-Cover Problems , 1969, Oper. Res..

[743]  William W. White,et al.  A Network Algorithm for Empty Freight Car Allocation , 1969, IBM Syst. J..

[744]  G. Nemhauser.  Scheduling Local and Express Service , 1969 .

[745]  J. P. Arabeyre,et al.  The Airline Crew Scheduling Problem: A Survey , 1969 .

[746]  J. F. Pierce.  Direct search algorithms for truck-dispatching problems , 1969 .

[747]  R. Linder.  The Development of Manpower and Facilities Planning Methods for Airline Telephone Reservations Offices , 1969 .

[748]  P. J. Pengilly,et al.  The Number and Location of Depots Required for Handling Products for Distribution to Retail Stores in South-East England , 1969 .

[749]  A. Sommers.  A Technique for Estimating V/STOL Market Shares , 1969 .

[750]  Leif H. Appelgren,et al.  A Column Generation Algorithm for a Ship Scheduling Problem , 1969 .

[751]  Kurt Spielberg,et al.  Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..

[752]  David C. Wood,et al.  A technique for colouring a graph applicable to large scale timetabling problems , 1969, Computer/law journal.

[753]  Leon Cooper,et al.  AN EXTENSION OF THE GENERALIZED WEBER PROBLEM , 1968 .

[754]  J. F. Pierce.  Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems , 1968 .

[755]  Jr. James McN. Stancill.  A Lock-Box Model , 1968 .

[756]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[757]  K. W. Knight,et al.  Vehicle Scheduling with Timed and Connected Calls: A Case Study , 1968 .

[758]  Jane M. Hogg,et al.  The Siting of Fire Stations , 1968 .

[759]  Z. A. Melzak,et al.  Steiner’s problem for set-terminals , 1968 .

[760]  E. G. Unwin.  Bases for Vehicle Fleet Scheduling , 1968 .

[761]  Warren Hyman,et al.  Commercial airline scheduling technique , 1968 .

[762]  B. T. Bennett,et al.  Rotating Roster for a Transit System , 1968 .

[763]  M. R. Rao,et al.  Allocation of Transportation Units to Alternative Trips - A Column Generation Scheme with Out-of-Kilter Subproblems , 1968, Oper. Res..

[764]  G. G. Httchings.  ANALOGUE TECHNIQUES FORTHE OPTIMAL LOCATION OF A MAIN FACILITY JN RELATION TO ANCILLARY FACILITIES , 1968 .

[765]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[766]  W. H. Hausman,et al.  A multi-period truck delivery problem☆ , 1967 .

[767]  C. Rydell.  A NOTE ON A LOCATION PRINCIPLE: BETWEEN THE MEDIAN AND THE MODE , 1967 .

[768]  Joseph Levy.  An Extended Theorem for Location on a Network , 1967 .

[769]  Richard L. Francis,et al.  Letter to the Editor - Some Aspects of a Minimax Location Problem , 1967, Oper. Res..

[770]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

[771]  I. A. Pappas.  DYNAMIC JOB ASSIGNMENT FOR RAILWAY PERSONNEL , 1967 .

[772]  Leon Cooper,et al.  SOLUTIONS OF GENERALIZED LOCATIONAL EQUILIBRIUM MODELS , 1967 .

[773]  Richard L. Francis.  Sufficient Conditions for Some Optimum-Property Facility Designs , 1967, Oper. Res..

[774]  Andrew D. Hall,et al.  Scheduling university course examinations by computer , 1967, CACM.

[775]  Roger C. Vergin,et al.  An Algorithm and Computational Procedure for Locating Economic Facilities , 1967 .

[776]  E. Hoover.  Some Programmed Models of Industry Location , 1967 .

[777]  R. Love.  A NOTE ON THE CONVEXITY OF THE PROBLEM OF SITING DEPOTS , 1967 .

[778]  H. G. M. Pullen,et al.  A computer application to a transport scheduling problem , 1967, Comput. J..

[779]  J. Lions,et al.  The Ontario school scheduling program , 1967, Comput. J..

[780]  Bernstein Ah.  The law in brief. Appointment to hospital medical staff. , 1966 .

[781]  J. Laderman,et al.  Vessel allocation by linear programming , 1966 .

[782]  E. Lawler.  Covering Problems: Duality Relations and a New Method of Solution , 1966 .

[783]  Mary Ann Frances Str.  Implementing a program of cyclical scheduling of nursing personnel. , 1966 .

[784]  T. L. Ray,et al.  A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[785]  H. Frank,et al.  Optimum Locations on a Graph with Probabilistic Demands , 1966, Oper. Res..

[786]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

[787]  J. W. Gavett,et al.  The Optimal Assignment of Facilities to Locations by Branch and Bound , 1966, Oper. Res..

[788]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[789]  Howell Jp,et al.  Cyclical scheduling of nursing personnel. , 1966 .

[790]  Mary Almond.  An Algorithm for Constructing University Timetables , 1966, Comput. J..

[791]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[792]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[793]  B. P. Dzielinski,et al.  Optimal Programming of Lot Sizes, Inventory and Labor Allocations , 1965 .

[794]  S. Hakimi.  Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[795]  Richard H. Day,et al.  Letter to the Editor-On Optimal Extracting from a Multiple File Data Storage System: An Application of Integer Programming , 1965 .

[796]  Leo Polopolus.  Optimum Plant Numbers and Locations for Multiple Product Processing , 1965 .

[797]  H Wolfe,et al.  Staffing the nursing unit. II. The multiple assignment technique. , 1965, Nursing research.

[798]  H. Wolfe,et al.  STAFFING THE NURSING UNIT. I. CONTROLLED VARIABLE STAFFING. , 1965, Nursing research.

[799]  R. Bellman.  An Application of Dynamic Programming to Location—Allocation Problems , 1965 .

[800]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[801]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[802]  A. Manne.  Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .

[803]  George L. Nemhauser,et al.  An Algorithm for the Line Balancing Problem , 1964 .

[804]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

[805]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[806]  Sol Broder,et al.  Final examination scheduling , 1964, Commun. ACM.

[807]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[808]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[809]  Calvin C. Gotlieb,et al.  Tests on a computer method for constructing school timetables , 1964, CACM.

[810]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .

[811]  S. Eilon.  ON A MECHANISTIC APPROACH TO FATIGUE AND REST PERIODS , 1964 .

[812]  Henry A. Young.  On the Optimum Location of Checking Stations , 1963 .

[813]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[814]  L. Cooper.  Location-Allocation Problems , 1963 .

[815]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[816]  Harold W. Kulin,et al.  AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICS , 1962 .

[817]  J. E. Sussams,et al.  Evaluation of Transport Costs for Alternative Factory Sites — A Case Study , 1962 .

[818]  K. Eisemann.  The Optimum Location of a Center , 1962 .

[819]  Maurice Kilbridge,et al.  A REVIEW OF ANALYTICAL SYSTEMS OF LINE BALANCING , 1962 .

[820]  J. Edmonds.  Covers and packings in a family of sets , 1962 .

[821]  M. Tideman,et al.  Comment on A network minimization problem , 1962 .

[822]  Russell L. Ackoff,et al.  Progress in Operations Research. , 1961 .

[823]  F. P. Palermo.  A network minimization problem , 1961 .

[824]  William W. White,et al.  Letter to the Editor---Comments on a Paper by Bowman , 1961 .

[825]  M. Balinski.  Fixed‐cost transportation problems , 1961 .

[826]  E. H. Bowman.  Assembly-Line Balancing by Linear Programming , 1960 .

[827]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[828]  R. Z. Norman,et al.  An algorithm for a minimum cover of a graph , 1959 .

[829]  L. G. Mitten,et al.  The Hub Operation Scheduling Problem , 1958 .

[830]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[831]  W. Baumol,et al.  A Warehouse-Location Problem , 1958 .

[832]  Alan S. Manne,et al.  Programming of Economic Lot Sizes , 1958 .

[833]  J. F. McCloskey,et al.  An analysis of stewardess requirements and scheduling for a major domestic airline , 1957 .

[834]  A. Charnes,et al.  Part II ‐ Generalization and analysis , 1957 .

[835]  W. Garvin,et al.  Applications of Linear Programming in the Oil Industry , 1957 .

[836]  T. E. Bartlett,et al.  An algorithm for the minimum number of transport units to maintain a fixed schedule , 1957 .

[837]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[838]  G. Dantzig,et al.  The Allocation of Aircraft to Routes—An Example of Linear Programming Under Uncertain Demand , 1956 .

[839]  Abraham Charnes,et al.  A MODEL FOR THE OPTIMAL PROGRAMMING OF RAILWAY FREIGHT TRAIN MOVEMENTS , 1956 .

[840]  David Valinsky.  Symposium on Applications of Operations Research to Urban Services—A Determination of the Optimum Location of Fire-Fighting Units in New York City , 1955 .

[841]  George B. Dantzig,et al.  Letter to the Editor - A Comment on Edie's "Traffic Delays at Toll Booths" , 1954, Oper. Res..