Discrepancy-based additive bounding for the AllDifferent constraint

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 510-524

  Lodi, Andrea ^a   Milano, Michela ^a   Rousseau, Louis Martin ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION;

ALLDIFFERENT; BOUNDING PROCEDURES; COMBINATORIAL OPTIMIZATION PROBLEMS; CONSTRAINT PROGRAMMING; OPTIMALITY; SEARCH STRATEGIES; SPEED UP;

INTEGER PROGRAMMING;

EID: 33847059971     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_35     Document Type: Article

References (17)

1. G. Carpaneto, M. Dell'Amico, P. Toth. Exact solution of large-scale asymmetric traveling salesman problems. ACM Transactions on Mathematical Software, 21:394-409, 1995.
2. G. Carpaneto, S. Martello, P. Toth. Algorithms and codes for the assignment problem. Annals of Operations Research 13, 193-223, 1988.
3. J. Cirasella, D.S. Johnson, L.A. McGeoch, W. Zhang. The asymmetric traveling salesman problem: algorithms, instance generators, and tests. In A.L. Buchsbaum and J. Snoeyink, editors, Proceedings of ALENEX'01, volume 2153 of Lecture Notes in Computer Science, pages 32-59. Springer-Verlag, Heidelberg, 2001.
4. M. Dell'Amico, A. Lodi, S. Martello. Efficient algorithms and codes for k-cardinality assignment problems. Discrete Applied Mathematics 110, 25-40, 2001.
5. M. Dell'Amico, S. Martello. Linear assignment. In F. Maffioli M. Dell'Amico and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, pages 355-371. Wiley, 1997.
6. M. Dell'Amico, S. Martello. The k-cardinality Assignment Problem. Discrete Applied Mathematics, 76:103-121, 1997.
7. H. El Sakkout, M. Wallace. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5:359-388, 2000.
8. M. Fischetti, P. Toth. An additive bounding procedure for combinatorial optimization problems. Operations Research, 37:319-328, 1989.
9. M. Fischetti, P. Toth. An additive bounding procedure for the asymmetric traveling salesman problem. Mathematical Programming, 53:173-197, 1992.
10. F. Focacci. Solving combinatorial optimization problems in constraint programming. PhD thesis, University of Ferrara, Italy, 2001.
11. F. Focacci, A. Lodi, M. Milano. Cost-based domain filtering. In J. Jaffar, editor, Principle and Practice of Constraint Programming - CP 1999, LNCS 1713, pages 189-203. Springer-Verlag, 1999.
12. F. Focacci, A. Lodi, M. Milano. Exploting relaxations in CP. In M. Milano, ed, Constraint and Integer Programming combined. Kluwer, to appear.
13. W. Harvey, M. Ginsberg. Limited discrepancy search. In Proceedings of the 14th IJCAI, pages 607-615, Morgan Kaufmann, 1995.
14. A. Lodi, M. Milano. Discrepancy-based additive bounding. Proceedings of CP-AI-OR 2003, pages 17-23, Montréal, Canada, 2003.
15. M. Milano, W.J. van Hoeve. Reduced cost-based ranking for generating promising subproblems. In P. Van Hentenryck, editor, Principle and Practice of Constraint Programming - CP 2002, LNCS 2470, pages 1-16. Springer-Verlag, 2002.
16. G. Pesant, M. Gendreau, J.-Y. Potvin, J.-M. Rousseau. An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows. Transportation Science, 32:12-29, 1998.
17. W.J. van Hoeve, M. Milano. Decomposition-based search. A theoretical and experimental evaluation. LIA Technical Report LIA00203, University of Bologna, 2003.