Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut

References

• Applegate D., Bixby R., Chvátal V., Cook W. Solving traveling salesman problems. (1994) . PreprintGoogle Scholar
• Balas E., Zemel E., Cottle R. W., et al. Lifting and complementing yields all the facets of positive zero-one programming polytopes. Mathematical Programming, Proc. Internat. Conf. Math. Programming (1984) 13–24Google Scholar
• Bixby R. E., Boyd E. A., Dadmehr S. S., Indovina R. R. The MIPLIB mixed integer programming library. COAL Bull. (1993) 22Google Scholar
• Bodin L. D. Twenty years of routing and scheduling. Opns. Res. (1990) 38:571–579Link, Google Scholar
• Chvátal V. On certain polytopes associated with graphs. J. Combin. Theory (1975) B13:138–154Crossref, Google Scholar
• Cormen T. H., Leiserson C. E., Rivest R. L.Introduction to Algorithms (1990) (MIT Press, Cambridge, MA) Google Scholar
• Using the CPLEX™ Callable Library and the CPLEX™ Mixed Integer Library (1993) (CPLEX Optimization, Inc., Incline Village, Nevada) . CPLEX ManualGoogle Scholar
• Crowder H., Johnson E. L., Padberg M. Solving large-scale zero-one linear programming problems. Opns. Res. (1983) 31:803–834Link, Google Scholar
• Ferreira C. E., Martin A., Weismantel R. Facets for the multiple knapsack problem. (1993) . Preprint. Konrad-Zuse-Zentrum für Informationstechnik BerlinGoogle Scholar
• Golden B. L., Assad A.Vehicle Routing: Methods and Studies (Studies in Management Science and Systems, Volume 16) (1988) (North Holland, Amsterdam)Google Scholar
• Gomory R. E. Some polyhedra related to combinatorial problems. Linear Algebra and Its Appl. (1969) 2:451–558Crossref, Google Scholar
• Grötschel M., Holland O. Solution of largescale symmetric travelling salesman problems. Math. Programming (1991) 51:141–202Crossref, Google Scholar
• Hammer P. L., Peled U. N. Computing lowcapacity 0-1 knapsack polytopes. Zeitschrift für Oper. Res. (1982) 26:243–249Crossref, Google Scholar
• Hoffman K. L., Padberg M. Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA J. Comput. (1991) 3:121–134Link, Google Scholar
• Hoffman K. L., Padberg M. Solving airline crew-scheduling problems by branch-and-cut. Management Sci. (1993) 39:657–682Link, Google Scholar
• Johnson E. L., Kostreva M. M., Suhl U. H. Solving 0-1 integer programming problems arising from large-scale planning models. Opns. Res. (1985) 33:803–819Link, Google Scholar
• Johnson E. L., Nemhauser G. L. Recent developments and future directions in mathematical programming. (1991) . Research report, Computational Optimization Center, Georgia Institute of Technology, Atlanta, GeorgiaGoogle Scholar
• Lee E. K. Solving structured 0/1 integer programming problems arising from truck dispatching scheduling problems. (1993a) . Ph.D. thesis, Rice University, Houston, TexasGoogle Scholar
• Lee E. K. Facets of special knapsack equality polytopes. (1993b) . Technical report TR93-38. Rice University, Houston, TexasGoogle Scholar
• Lee E. K. On facets of knapsack equality polytopes. J. Optim. Theory Appl. (1994) 94(1):223–239Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
• Padberg M. On the facial structure of set packing polyhedra. Math. Programming (1973) 5:199–215Crossref, Google Scholar
• Padberg M., Rinaldi G. A branch-and-cut approach to a traveling salesman problem with side constraints. Management Sci. (1989) 35:1393–1412Link, Google Scholar
• Padberg M., Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. (1991) 33:60–100Crossref, Google Scholar
• Savelsbergh M. W. P. Preprocessing and probing for mixed integer programming problems. ORSA J. Comput. (1994) 6:445–454Link, Google Scholar
• Suhl U. H., Szymanski R. Supernode processing of mixed integer models. Computational Optim. Appl. (1994) 3:317–331Crossref, Google Scholar
• Trotter L. E. A class of facet-producing graphs for vertex packing polyhedra. Discrete Math. (1975) 12:373–388Crossref, Google Scholar
• Weismantel R. On the 0/1 knapsack polytope. (1994) . Research report SC 94-1. Konrad-Zuse-Zentrum für Informationstechnik BerlinGoogle Scholar
• Wolsey L. A. Facets and strong valid inequalities for integer programs. Opns. Res. (1976a) 24:367–372Link, Google Scholar
• Wolsey L. A. Further facet generating procedures for vertex packing polytopes. Math. Programming (1976b) 11:158–163Crossref, Google Scholar
• Zemel E. Lifting the facets of zero-one polytopes. Math. Programming (1978) 15:268–277Crossref, Google Scholar