Discrepancy-Based Additive Bounding Procedures

References

• Carpaneto G., Dell’Amico M., Toth P. Exact solution of large-scale asymmetric traveling salesman problems. ACM Trans. Math. Software (1995) 21:394–409Crossref, Google Scholar
• Carpaneto G., Martello S., Toth P. Algorithms and codes for the assignment problem. Ann. Oper. Res. (1988) 13:193–223Crossref, Google Scholar
• Cirasella J., Johnson D. S., McGeoch L. A., Zhang W., Buchsbaum A. L., Snoeyink J. The asymmetric traveling salesman problem: Algorithms, instance generators, and tests. Proc. ALENEX’01, LNCS 2153 (2001) (Springer-Verlag, Berlin and Heidelberg) 32–59Crossref, Google Scholar
• Dechter R. Constraint satisfaction. The MIT Encyclopedia of Cognitive Sciences (MITECS) (1999) (MIT Press, Cambridge, MA) 195–197Google Scholar
• Dell’Amico M., Martello S., Maffioli F., Dell’Amico M., Martello S. Linear assignment. Annotated Bibliographies in Combinatorial Optimization (1997a) (Wiley, New York) 355–371Google Scholar
• Dell’Amico M., Martello S. The k-cardinality assignment problem. Discrete Appl. Math. (1997b) 76:103–121Crossref, Google Scholar
• Dell’Amico M., Lodi A., Martello S. Efficient algorithms and codes for k-cardinality assignment problems. Discrete Appl. Math. (2001) 110:25–40Crossref, Google Scholar
• El Sakkout H., Wallace M. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints (2000) 5:359–388Crossref, Google Scholar
• Fischetti M., Lodi A. Local branching. Math. Programming (2003) 98:23–47Crossref, Google Scholar
• Fischetti M., Toth P. An additive bounding procedure for combinatorial optimization problems. Oper. Res. (1989) 37:319–328Link, Google Scholar
• Fischetti M., Toth P. An additive bounding procedure for the asymmetric traveling salesman problem. Math. Programming (1992) 53:173–197Crossref, Google Scholar
• Fischetti M., Lodi A., Toth P., Gutin G., Punnen A. Exact methods for the asymmetric traveling salesman problem. The Traveling Salesman Problems and its Variations (2002) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 169–205Google Scholar
• Focacci F. Solving combinatorial optimization problems in constraint programming. (2001) . Ph.D. thesis, Dipartimento di Ingegneria, University of Ferrara, ItalyGoogle Scholar
• Focacci F., Lodi A., Milano M., Jaffar J. Cost-based domain filtering. Principle and Practice of Constraint Programming—CP 1999, LNCS 1713 (1999) (Springer-Verlag, Berlin and Heidelberg) 189–203Crossref, Google Scholar
• Focacci F., Lodi A., Milano M. A hybrid exact algorithm for the TSPTW. INFORMS J. Comput. (2002) 14:403–417Link, Google Scholar
• Focacci F., Lodi A., Milano M., Milano M. Exploiting relaxations in CP. Constraint and Integer Programming: Toward a Unified Methodology (2003) (Kluwer, Boston, MA) 137–167Google Scholar
• Harvey W., Ginsberg M. Limited discrepancy search. Proc. 14th IJCAI (1995) (Morgan Kaufmann, San Francisco, CA) 607–615Google Scholar
• Korf R. Improved limited discrepancy search. Proc. Thirteenth National Conf. Artificial Intelligence and the Eighth Innovative Appl. Artificial Intelligence Conf. 1 (1996) (The AAAI Press, Menlo Park, CA) 286–291Google Scholar
• Lodi A., Milano M., Rousseau L.-M., Rossi F. Discrepancy-based additive bounding for the AllDifferent constraint. Principle and Practice of Constraint Programming—CP 2003, LNCS 2833 (2003) (Springer-Verlag, Berlin and Heidelberg) 510–524Crossref, Google Scholar
• Milano M., van Hoeve W. J., Van Hentenryck P. Reduced cost-based ranking for generating promising subproblems. Principle and Practice of Constraint Programming—CP 2002, LNCS 2470 (2002) (Springer-Verlag, Berlin and Heidelberg) 1–16Crossref, Google Scholar
• Pesant G., Gendreau M., Potvin J.-Y., Rousseau J.-M. An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Sci. (1998) 32:12–29Link, Google Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. (1987) 35:254–265Link, Google Scholar
• van Hoeve W. J., Milano M. Decomposition-based search. A theoretical and experimental evaluation. (2003) . LIA technical report, LIA00203, University of Bologna, Bologna, ItalyGoogle Scholar
• Zhang W. Depth-first branch-and-bound versus local search: A case study. Proc. Seventeenth National Conf. on Artificial Intelligence (2000) (The AAAI Press, Menlo Park, CA) 930–935Google Scholar