메뉴 건너뛰기




Volumn 130, Issue 1-4, 2004, Pages 19-39

Hybrid modelling for robust solving

Author keywords

Application; Constraint programming; Integer linear programming; Integration; Modelling

Indexed keywords


EID: 3142742396     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000032568.51115.0d     Document Type: Article
Times cited : (17)

References (15)
  • 1
    • 3142739976 scopus 로고    scopus 로고
    • Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems
    • Benoist, T., F. Laburthe, and B. Rottembourg. (2001). "Lagrange Relaxation and Constraint Programming Collaborative Schemes for Travelling Tournament Problems." In Proceedings of CP-AI-OR'01.
    • (2001) Proceedings of CP-AI-OR'01
    • Benoist, T.1    Laburthe, F.2    Rottembourg, B.3
  • 2
    • 3142734055 scopus 로고    scopus 로고
    • Variable and value ordering when solving balanced academic curriculum problem
    • Castro, C. and S. Manzano. (2001). "Variable and Value Ordering when Solving Balanced Academic Curriculum Problem." In Proceedings of the ERCIM WG on Constraints.
    • (2001) Proceedings of the ERCIM WG on Constraints
    • Castro, C.1    Manzano, S.2
  • 3
    • 0000386002 scopus 로고    scopus 로고
    • Increasing constraint propagation by redundant modelling: An experience report
    • Cheng, B.M.W., K.M.F. Choi, J.H.M. Lee, and J.C.K. Wu. (1999). "Increasing Constraint Propagation by Redundant Modelling: An Experience Report." Constraints 4, 167-192.
    • (1999) Constraints , vol.4 , pp. 167-192
    • Cheng, B.M.W.1    Choi, K.M.F.2    Lee, J.H.M.3    Wu, J.C.K.4
  • 4
    • 0034288713 scopus 로고    scopus 로고
    • Probe backtrack search for minimal perturbation in dynamic scheduling
    • El Sakkout, H. and M. Wallace. (2000). "Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling." Constraints 5(4), 359-388.
    • (2000) Constraints , vol.5 , Issue.4 , pp. 359-388
    • El Sakkout, H.1    Wallace, M.2
  • 8
    • 0002434786 scopus 로고
    • Dual viewpoint heuristics for binary constraint satisfaction problems
    • Geelen, P.A. (1992). "Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems." In Proceedings of ECAI'92, pp. 31-35.
    • (1992) Proceedings of ECAI'92 , pp. 31-35
    • Geelen, P.A.1
  • 10
    • 0032596630 scopus 로고    scopus 로고
    • On integrating constraint propagation and linear programming for combinatorial optimization
    • Hooker, J.N., G. Ottosson, E.S. Thorsteinsson, and H-J. Kim. (1999). "On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization." In AAAI/IAAI, pp. 136-141.
    • (1999) AAAI/IAAI , pp. 136-141
    • Hooker, J.N.1    Ottosson, G.2    Thorsteinsson, E.S.3    Kim, H.-J.4
  • 12
    • 84957376979 scopus 로고    scopus 로고
    • A generic model and hybrid algorithm for hoist scheduling problems
    • Rodosek, R. and M. Wallace. (1998). "A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems." In Proceedings of CP-98, pp. 385-399.
    • (1998) Proceedings of CP-98 , pp. 385-399
    • Rodosek, R.1    Wallace, M.2
  • 13
    • 84873010592 scopus 로고    scopus 로고
    • CP-based lagrangian relaxation for a multimedia application
    • Sellmann, M. and T. Fahle. (2001). "CP-Based Lagrangian Relaxation for a Multimedia Application." In Proceedings of CP-AI-OR'01.
    • (2001) Proceedings of CP-AI-OR'01
    • Sellmann, M.1    Fahle, T.2
  • 14
    • 3142725307 scopus 로고    scopus 로고
    • Dual models in constraint programming
    • University of Leeds (UK), School of Computing
    • Smith, B.M. (2001). "Dual Models in Constraint Programming." Research Report 2001.02, University of Leeds (UK), School of Computing.
    • (2001) Research Report 2001.02
    • Smith, B.M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.