LOCAL SEARCH AS A FIXED POINT OF FUNCTIONS

Eric Monfroy, Frédéric Saubion, Broderick Crawford, Carlos Castro

2008

Abstract

Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications (planning, scheduling, time tabling, . . . ). CSPs can be solved with complete methods (e.g., constraint propagation), or incomplete methods (e.g., local search). Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. Here we are concerned with the design and use of a generic framework to model local search as the computation of a fixed point of functions.

Paper Citation

in Harvard Style

Monfroy E., Saubion F., Crawford B. and Castro C. (2008). LOCAL SEARCH AS A FIXED POINT OF FUNCTIONS . In Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 978-989-8111-37-1, pages 431-434. DOI: 10.5220/0001681804310434

in Bibtex Style

@conference{iceis08,
author={Eric Monfroy and Frédéric Saubion and Broderick Crawford and Carlos Castro},
title={LOCAL SEARCH AS A FIXED POINT OF FUNCTIONS},
booktitle={Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2008},
pages={431-434},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001681804310434},
isbn={978-989-8111-37-1},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - LOCAL SEARCH AS A FIXED POINT OF FUNCTIONS
SN - 978-989-8111-37-1
AU - Monfroy E.
AU - Saubion F.
AU - Crawford B.
AU - Castro C.
PY - 2008
SP - 431
EP - 434
DO - 10.5220/0001681804310434