Reduced cost-based ranking for generating promising subproblems

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

Volumn 2470, Issue , 2002, Pages 1-16

  Milano, Michela ^a   van Hoeve, Willem J ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

LOWER BOUNDS; OPTIMAL SOLUTIONS; REDUCED COST; SEARCH PROCEDURES; SEARCH TREES; SUB-PROBLEMS; VALUE RANKING; VARIABLE DOMAIN;

COST REDUCTION;

EID: 84957016075     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_1     Document Type: Conference Paper

References (23)

1. N. Ascheuer. ATSPTW - Problem instances. http://www.zib.de/ascheuer/ATSPTWinstances.html.
2. G. Carpaneto, S. Martello, and P. Toth. Algorithms and codes for the Assignment Problem. In B. Simeone et al., editor, Fortran Codes for Network Optimization - Annals of Operations Research, pages 193–223. 1988.
3. M. Dell’Amico and S. Martello. Linear assignment. In F. Maffioli M. Dell’Amico and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, pages 355–371. Wiley, 1997.
4. T. Fahle and M. Sellman. Cp-based lagrangean relaxation for a multi-media application. In [13], 2001.
5. T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109–133, 1995.
6. M. Fischetti and P. Toth. An additive bounding procedure for combinatorial optimization problems. Operations Research, 37:319–328, 1989.
7. M. Fischetti and P. Toth. An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming, 53:173–197, 1992.
8. F. Focacci, P. Laborie, and W. Nuijten. Solving scheduling problems with setup times and alternative resources. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS2000), 2000.
9. F. Focacci, A. Lodi, and M. Milano. Cost-based domain filtering. In CP’99 Conference on Principles and Practice of Constraint Programming, pages 189–203, 1999.
10. F. Focacci, A. Lodi, and M. Milano. A hybrid exact algorithm for the TSPTW. INFORMS Journal of Computing, to appear. Special issue on The merging of Mathematical Programming and Constraint Programming
11. F. Focacci, A Lodi, M. Milano, and D. Vigo. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 1999.
12. F. Focacci, A. Lodi, M. Milano, and D. Vigo. Solving TSPt hrough the integration of OR and CPt echniques. Proc. CP98 Workshop on Large Scale Combinatorial Optimisation and Constraints, 1998.
13. C. Gervet and M. Wallace, Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 2001.
14. M. L. Ginsberg and W. D. Harvey. Iterative broadening. Artificial Intelligence, 55(2):367–383, 1992.
15. W. D. Harvey and M. L. Ginsberg. Limited Discrepancy Search. In C. S. Mellish, editor, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95); Vol. 1, pages 607–615, 1995.
16. ILOG. ILOG Scheduler 4.4, Reference Manual, 2000.
17. ILOG. ILOG Solver 4.4, Reference Manual, 2000.
18. U. Junker, S. Karisch, and S. Tschoeke. Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 2000
19. F. Laburthe and N. Jussien. Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 2002
20. P. Langley. Systematic and nonsystematic search strategies. In Proceedings of the 1st International Conference on AI Planning Systems, pages 145–152, 1992
21. A. Lodi. Personal communication
22. M. Padberg and G. Rinaldi. An efficient algorithm for the minimum capacity cut problem. Mathematical Programming, 47:19–36, 1990
23. G. Reinelt. TSPLIB - a Travelling Salesman Problem Library. ORSA Journal on Computing, 3:376–384, 1991