References by Alphabetical Order

• Abdelaziz F.B., Krichen S., Chaouachi J. (1997), Hybrid Heuristic for Multi-objective Knapsack Problems, in Meta -Heuristics. Advances and Trends in Local Search Paradigms for Optimization, textbook Edited by Stefan Voss, Silvano Martello, Ibrahim H. Osman, Catherine Roucairol. Kluwer Academic Publishers.
• Abramson (1991) Constructing School timetables using simulated annealing: sequential and parallel algorithms. Management Science 37(1):98-113.
• Affane M-S., Bennaceur H. (1998) A weight arc consistency technique for Max-CSP, Proc. of ECAI-98, 209-213.
• Alvarez-Valdes, Martin, G., Tamarit, J.M. (1996) Constructing Good Solutions for the Spanish School Timetabling problem. Journal of the Operational Research Society.
• Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., Protasi M. (??), Complexity and Approximation: Combinatorial optimization problems and their approximability properties by Springer Verlag, ISBN 3-540-65431-3.
• Battiti, R., and Tecchioli G. (1994) The Reactive Tabu Search. ORSA Journal on Computing 6:126-140.
• Battiti, R., and Tecchioli, G (1995). Local search with memory: Benchmarking RTS. Operations Research Spektrum, 17(2/3):67-86.
• Beasley J. (1990) OR-Library: distributing test problems by electronic mail, Journal of theOperational Research Society 41(11) (1990) 1069-1072.
• Belegundu A.D. and Murthy D.V. and Salagame and Constant E.W. (1994), Multi-objective Optimization of Laminated Ceramic Composites Using Genetic algorithms, In Fifth AIAA/ USAF/ NASA Symposium on Multidisciplinary Analysis and Optimization, volume Paper 84-4363-CP, pages 1015- 1022, Panama City , Florida, 1994 . AIAA.
• Beldiceanu N., Contejean E., Introducing global constraints in CHIP, Journal of Mathematical and Computer Modelling, Vol 20, No12, pp 97-123,1994
• Bellicha A. (1993) Maintenance of solution in a dynamic Constraint Satisfaction Problem. Proc. Of applications of Artificial Intelligence in Engineering VIII, 261-274, Toulouse.
• Bensana E., Lemaitre M., Verfaillie G. (1999) Earth Observation Satellite Management, Constraints Vol4 Num 3.
• Berlandier P. ( ) The use and interpretation of meta level constraints. Proc. EPIA . 271-280, Springer -Verlag
• Berlandier,P. and Neveu, B. (1994) Maintaining Arc Consistency through Constraint Retraction: Proc.of the 16th IEEE International conference on tools with Artificial Intelligence (TAI94) - New Orleans, LA.
• Berlandier P., Trousse B. (1993) Expression and Interpretation of metaconstraints for the maintenance of solution in design. Proc.of the 13th international Avignon-workshop. Avignon.
• Bessière C. (1999) Non-Binary Constraints. Proc. CP-99, 24-27.
• Bessière C. and Régin J.C. (1997) Arc consistency for general constraint networks: preliminary results. Proc. IJCAI-97, 398-404.
• Bessière, Christian (1991), Arc-consistency in dynamic constraint satisfaction problems. Proc. of AAAI-91, 221-226. - Anaheim, CA.
• Bistarelli S., Montanari U., Rossi F. (1995) Constraint solving over semirings. Proc. IJCAI-95.
• Bistarelli S., Montanari U., Rossi F., Schiex T., Verfaille G., Fargier H. (1999) Semiring-based CSPs and Valued CSPs: Frameworks, Properties and Comparison. Constraints, 4, 199-240.
• Borges P.C. and M.P.Hansen (1998): A basis for future successes in multi-objective combinatorial optimization. IMM Technical report IMM_REP-1998-8
• Borning A., Freeman-Benson B., Wilson M. (1992) Constraint hierarchies. Lisp and symbolic computation, 5, 223-270.
• Borning A., Freeman-Benson B., Wilson M. (1994) Bouyssou D. and Ph. Vincke (1998) Introduction to topics on preference modelling, Annals of Operations Research,, 80, 1998, i-xiv
• Boyce, J.F., Dimitropoulis, C.H.D., vom Scheidt, G., and Taylor, J.G (1995). GENET and Tabu Search for Combinatorial Optimization Problems. World Congress on Neural Networks, Washighton D.C. (1995).
• Brailsford S., Hubbard P., Smith B., and Williams H. (1996) The Progressive Party Problem:A Difficult Problem of Combinatorial Optimization, Computers and Operations Research 23(1996) 845-856
• Brand P., Haridi S., Olsson O. (??) Some radar surveillance problems, Technical report, Swedish Institute of Computer Science SICS, To appear
• Cabon B., De Givry S,, Lobjois L., Schiex T., Warners J. (1999) Radio Link Frequency Assignement, Constraints vol 4, Number 1.
• Cabon B., Verfaillie G., Martinez D., Bourret P. (1996) Using mean field methods for boosting backtrack search in constraint satisfaction problems. Proc of ECAI-96, 165-169.
• Cabon B., Givry S., Verfaillie G. (1998) Anytime lower bounds for constraint violation minimization problems, Proc. of CP-98.
• Carlsson M., Ottosson G. (1996) Anytime frequency allocation with soft constraints, Proc. of CP-96.
• Charnes, A. and W.W. Cooper (1977), Goal Programming and Multiple Objective Optimizations, European Journal of Operational Research, Vol. 1, 39-54 (1977).
• Chu, P., and Beasley, J.E. (1997) Genetic algorithms for the generalized assignment problem. Computers and Operations Research, Vol.24, pp:17-23, 1997.
• Colorni, Dorigo and Maniezzo (1992) A genetic algorithm, to solve the timetable problem. Technical report 90.060, Politecnico di Milano, Italy.
• Costa, D (1994). A Tabu Search Algorithm for Computing an Operational Timetable. European Journal of Operational Research 76:98-110.
• Cvetkovic D. and Parmee I.and Eric Webb (1998), Multi-objective Optimization and Preliminary Airframe Design In Ian Parmee, editor, The Integration of evolutionary and Adaptive Computing Technologies with Product/System Design and Reallisation, pages 255-267, Polymouth, United Kingdom, April 1998. Pymount Engegineering Design Center, Springer-Verlag .
• Czyzak,P. and Jaszkiewicz, A., (1998) Pareto Simulated Annealing - a metaheuuristic technique for multiple-objective combinatorial optimization. Journal of Multi-criteria decision analysis, vol 7, 34-47, 1998.
• Czyzak,P. Hapke, M. and and Jaskiewicz,A. (1994): Applications of the pareto simulated annealing to the multiple criteria shortes path problem. Technical report, Politechnika Poznanska Intytut Informatyki, 1994.
• Dasgupta P., P. P. Chakrabarti, S. C. Desarkar (1999): "Multi-objective Heuristic Search : An Introduction to Intelligent Search Methods for Multicriteria Optimization". Morgan Kaufmann Publishers; ISBN: 3528057084, 1999
• Davenport A., Tsang E., Wang C., Zhu K. (1994) GENET:A Connectionist architecture for solving constraint satisfaction problems by iterative improvement. Proc. of AAAI-94, 325-330.
• Dechter R. (1990) Enhancement schemes for constraint processing : Backjumping, learning and cutset decomposition. Artificial Intelligence, vol. 41 , n° 3, 273-312.
• Dechter R. (1990) On the expressiveness of networks with hidden variables. Proc. AAAI-90, 556-562.
• Dechter, R., (1992) Constraint networks (survey). Encyclopedia of Artificial Intelligence, 2nd edition, 276-285.
• Dechter R., Dechter A. (1988), Belief maintenance in dynamic constraint networks. Proc.of AAAI-88, 37-42.- St. Paul, MN.
• Dechter R., Pearl J. (1989) Tree clustering for constraint networks. Artificial Intelligence, 38:353-366
• Dorne R., Hao J.K. Tabu search for graph coloring, T-Coloring and Set T-Colorings. In Meta-Heuristics, advances and trends in local search paradigms for optimization. INRIA, Kluwer Academic Publishers.
• Dowsland K. (1988) Simulated annealing. In Modern heuristic techniques for combinatorial problems, C.R. Reeves (Ed.), John Wiley & Sons, 20-69, 1988.
• Dubois D., Fargier H, Prade H. (1996) Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty. Applied Intelligence 6, 287-309.
• Eiben, A.E., Raua, P-E., and Ruttkay, Zs. (1994) Solving constraint satisfaction problem using genetic algorithms. Proc., 1st IEEE Conference on Evolutionary Computing, pp: 543-547, 1994.
• Engrand, P. (1997): A multi-objective optimization approach based on simulated annealing and its application to nuclear fuel management. Proceedings of the 5th International Conference onNuclear Engineering, 1997
• Fargier H., Lang J. (1993) Uncertainty in constraint satisfaction problems: a probabilistic approach. Proc. ECSQARU-93, Lecture Notes Computer Science 747, 97-104.
• Fargier H. (1994) Problemes de satisfaction de constraintes flexibles:application a l'ordonnancement de production. Ph. D. Thesis, Univ. Paul Sabatier, Toulouse, France.
• Fonseca, C.M. and Fleming, P.J. (1995) An overview of evolutionary algorithms in mulitobjective optimization, Evolutionary Computation, Vol 3., pp.1-16, 1995
• Fonsesca, C. M., and Fleming, P.J (1993). Genetic Algorithms for Multi-objective optimization: Formulation, Discussion and Generalization. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms. University of Illinois at Urbana-Champaign, Morgan Kauffman Publishers, San Mateo, California.
• Freuder E., Wallace R. (1992) Partial constraint satisfaction. Artificial Intelligence, 58, 21-71.
• Galinier P., Hao J. (1997) Tabu search for maximal constraint satisfaction problems. Proc of CP-97, 196-208.
• Gandibleaux, X. Mezdaoui,N., Freville, A. (1996): A tabu search procedure to solve multi-objective combinatorial optimization problems. Proceedings, volume MOPGP 1996, R.Caballero and R. Steuer (eds), Springer-Verlag.
• Gandibleux, X. and Freville, A. (2000), Tabu Search based procedure for solving the 0-1 multobjective knapsack problem: The two objectives case. To appear in Journal of Heuristics, Special issue on multiple objective MetaHeuristics6:2, Summer 2000, Kluwer Academic Publishers.
• Ghedira K. (1993) MASC : A multi agent approch of constraint satisfaction problems PhD thesis, Toulouse, Higher National School of Aeronautics and Space (ENSAE), June 1993.
• Ghedira K. (1994) Distributed simulated re-annealing for dynamic contraint satisfaction problems. Proc. of the 6th IEEE International Conference on Tools with Artificial Intelligence. - New Orleans, USA .
• Ghedira K. (1994) Partial constraint satisfaction by a multi-agent approch combined with simulated annealing process. Proc.of the 14th international Avignon workshop, Paris.
• Gent I., Walsh T. (1993) Towards an understanding of Hill-Climbing Procedures for SAT. Proc. of AAAI, 28-33.
• Gent I., Walsh T. (1993) An Empirical Analysis of search in GSAT. Journal of Artificial Intelligence Research, vol. 1, 47- 59.
• Gent I., Walsh T. (1999) CSPLib: A benchmark Library for Constraints, Proc. of CP-99.
• Gilbert, K. C. and Shane, R.M. (1982) TVA Hydro scheduling model: Theoretical aspect. Journal of water resources Planning and Management Divisio, 1981,108 (WR1), 1-19.1982.
• Ginberg M. (1993) Dynamic backtracking. Journal of Artificial Intelligence Research, vol. 1, 25- 46.
• Givry S., G.Verfaillie, T. Schiex (1997) Bounding the Optimum of Constraint Optimization Problems, Proc of CP-97.
• Glover, F. (1989) Tabu search- Part I. ORSA Journal on computing 1, 190-206.
• Glover F. (1993) Futur path for integer programming and links to artificial intelligence. Computer & Ops. Res., 5:533-549.
• Glover F., Laguna M. (1996) Tabu search. In Modern heuristic techniques for combinatorial problems, C.R. Reeves (Ed.), John Wiley & Sons, 70-150.
• Goldberg, D.E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning. Addition-Wesley Publishing Co., Reading, Massachusetts, 1989.
• Hajela, P., and Lee, J. (1995) Constrained Genetic Search via Schema Adaptation. An Immune Network Solution. In N. Olhoff and G. I.N. Rozvany, editors, Proceedings of the First World Congress of Structural and Multidisciplinary Optimization, pp: 915-920. Pergamon, Goslar, Germany 1995.
• Hansen, M.P. (1997): Tabu search for multi-objective optimization: MOTS, 13th International COnference on Multiple Criteria Decision Making, University of Cape Town, January 6-10, 1997.
• Hapke, M., Jaszkiewicz, A., and Slowinski, R. (2000) Pareto Simulated Annealing for fuzzy multi-objective combinatorial optimization. To appear in Journal of Heuristics, Special issue on multiple objective MetaHeuristics6:2, Summer 2000, Kluwer Academic Publishers
• Holland J. H. (1975) Adaptation in natural and artificial systems. University of Michigan press, Ann Arbor, MI.
• Homaifar A, Lai S. H.Y., and Qi, X. (1994), Constrained Optimization via Genetic Algorithms. Simulation 62(4):242-254.
• Horn J. and Nafpliotis N. (1993), Multi-objective Optimization using the Niched Pareto Genetic Algorithm, Technical Report Illi GA1 Report 93005, University of Illinois at urbana Champaign, Urbana, Illonois , USA, 1993.
• Janssen P., Jegou P., Jougier B., Vilarem M.C. (1989) A filtering process for general constraint satisfaction problems: achieving pairewise-consistency using an associated binary representation. Proc. of the IEEE-89 Workshop on Tools for Artificial Intelligence, 420-427.
• Jussien. (1997) Relaxation de Contraintes pour les problemes dynamiques. Ph.D. thesis, Universite de Rennes I.
• Jussien M., Boizumault P. (1997) A best first approach for solving over-constrained dynamic problems. Proc. of IJCAI-97, Nagoya, Japan.
• Jussien M., Boizumault P. (1997) Best first search for property maintenance in reactive constraints systems. International Logic Programming Symposium.
• Kang, White (1992) A logic approach to the resolution of constraints in timetabling, European Journal of Operational Research 61: 306-317
• Kirkpatrick, S., Gelat, C.,and Vicci, M. (1983) Optimization by simulated annealing. Science, Vol.220, No.4598, pages:671-80.
• Knowles, J.D and Corne, D.W. (1999), Approximating the Nondominated Front using the Pareto Archived Evolution Strategy, Technical Report RUCS/ 1999/005/A, submitted to The IEEE Transactions on Evolutionary Computation, March 1999.
• Koktener, E. and Koksalan, M., (2000) A simulated annealing approach to bicriteria scheduling problems on a single machine. To appear in Journal of Heuristics, Special issue on multiple objective MetaHeuristics6:2, Summer 2000, Kluwer Academic Publishers.
• Kolen A., van Hoesel S. (??) A constraint satisfaction approach to the radio link frequency assignment problem, download: ftp://ftp.win.tue.nl/pub/techreports/CALMA/222.ps
• Kumar V. (1992) Algorithms for constraint satisfaction problems: A survey. AI Magazine, spring 1992, 32-44.
• Lanfear (1989) Graph theory and radio link frequency assignment problems. Technical report, NATO, Allied Radio Frequency.
• Larrosa J., Meseguer P. (1996) Exploiting the use of DAC in Max-CSP. Proc. of CP-96, 308-322.
• Larrosa J., Meseguer P. (1999). Partition-Based Lower Bound for Max-CSP, Proc. of CP-99, 303-315.
• Larrosa J., Meseguer P., Schiex T. (1999) Maintaining reversible DAC for Max-CSP. Artificial Intelligence, 107(1), 149-163.
• Lemaitre M, Verfaillie G. (1997) Daily management of an earth observation satellite: comparairon of ILOG Solver with dedicated algorithms for Valued CSP, Proc. of the Third ILOG International Users Meeting, Paris, France. ftp://ftp.cert.fr/pub/verfaillie/ilog97.ps
• Li, Y. H. (1997) Directed Annealing Search In constraint Satisfaction and Optimization. PhD Thesis, Imperial College of Science, Department of Computing, 1997.
• Lin S., Kernighan B. W. (1973) An effective heuristic algorithm for the travelling salesman problem. Operations Research, 21, 498-516. McAllester D., Selman B., Kautz H. (1997) Evidence for invariants in local search. Proc. of AAAI-97.
• Meseguer P., Larrosa J. (1997) Solving fuzzy constraint satisfaction problems. Proc. FUZZ-IEEE-97, 1233-1238.
• Miettinen K. (1999), "Nonlinear Multi-objective Optimization", Kluwer Academic Publishers, Boston, 1999.
• Mills P., Tsang E. (1999) Solving the Max-SAT Problem using Guided Local Search. Technical Report CSM-327, University of Essex, Colchester, UK.
• Minton S., Johnson M., Philips A., Laird P. (1990) Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. Proc. of AAAI-90, 17-24.
• Minton S., Johnson M., Philips A., Laird P. (1992) Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161-205.
• Mitra G. (1987), Mathematical Models for Decision Support, Springer-Verlag, 1987, Series F: Computer and Systems Sciences.
• Mittal S. Falkenhainer B. (1990) Dynamic constraint satisfaction problems. Proc. of AAAI- 90, 25-32, Boston , MA.
• Morris P. (1993) The breakout method for escaping from local minima. Proc. of AAAI-93, 40-45.
• Neufeld, Tartar (1974) Graph Coloring Conditions for the Existence of solutions to the timetable problem. Communications of the ACM 17(8) 450-453.
• Osyczka A. (1984), Multicriterion Optimization in Engineering with FORTRAN programs, Ellis Horwood Limited , 1984.
• Parmee I. (1989) The integration of evolutionary and adaptive computing technologies with Product/System design and realization. Springer-Verlag, Plymouth, United Kingdom, 1998.
• Pirlot M., Denis Bouyssou (1997): A General Framework for the Aggregation of Preferences. INFORMS San Diego, May, 1997Locn: Invited, Time: Sunday 10:00-11:30 ID : SB34.1
• Pirlot M., Denis Bouyssou, and Ph. Vincke (1997) A general model of preference agregation, Essays in Decision Making, M.H. Karwan, J. Spronk and J. Wallenius (Eds), 120-134, Springer Verlag, 1997.
• Puget, J.F. (1994) A C++ implementation of CLP. Proc. of SPICIS-94. Régin J.C. (1994) A filtering algorithm for constraints of difference in CSPs. Proc. AAAI-94, 362-367.
• Régin J.C. (1996) Generalized arc consistency for global cardinality constraint. Proc. AAAI-96, 209-215.
• Regin J.C., Rueher M. (1999) A global constraint combining a sum constraint and binary inequalities. IJCAI-99 Workshop on Non binary constraints.
• Ritzel and J. Wayland Eheart and S. Ranijithan (1994), Using genetic algorithms to solve a multiple objective groundwater pollution containment problem . Water Ressources Research , 30(5) : 1589-1603, may 1994.
• Ruttkay Zs, Eiben, A.E, and Raue, P.E (1995). Improving the performance of GAs on a GA-hard CSP. Proceedings, CP95 Workshop on Studying and Solving Really Hard Problems, 157-171, 1995.
• Schaffer, J.D (1993): Multiple objective optimization with vector evaluated genetic algorithms. In J.J. Grefenstette (ed.), Genetic algorithms and their applications: Proceedings of the thrid International Conference on Genetic Algorithms, Lawrence Erlbaum, Hillsdale, NJ,93-100.
• Schaerf A. (1996) Tabu Search Techniques for large High-School Timetabling problems. Proc. of ECAI-96, 634-639.
• Schaerf A. (1999) A Survey of Automated Timetabling, Artificial Intelligence Review 13:87-127.
• Schiex, T., Verfaillie, G (1994). Nogood Recording for Static and Dynamic Constraint Satisfaction Problems International Journal of Artificial Intelligence Tools, vol. 3n° 2, 1994, pp. 187-207.
• Schiex T., Verfaillie G. (1994) Stubborness: an enhancement scheme for back- jumping and nogood recording. Proc. of the 12th ECAI, 165-169.
• Schiex T., Verfaille G., Fargier H. (1995) Valued constraint satisfaction problems: Hard and easy problems. Proc. IJCAI-95 631-637.
• Selman B., Kautz H. (1993) An Empirical Study of Greedy Local Search for Satisfiability Testing. Proc. of AAAI-93, 46-51.
• Selman B., Kautz H. (1993) Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. Proc. of IJCAI-93.
• Selman, B., Kautz, H.A., and Cohen, B. (1993) Local Search Strategies for Satisfiability Testing. Presented at the Second DIMACS challenge on Cliques, Coloring, and Satisfiability, Oct. 1993.
• Selman B., Kautz H., Cohen B. (1994) Noise Strategies for Improving Local Search. Proc. of AAAI-94, Seatle..
• Selman B., Levesque H., Mitchell D. (1992) A New Method for Solving Hard Satisfiability Problems. Proc. of AAAI-92, 440-446.
• Simonis H (1995), The CHIP system and Its Applications, COSYTEC SA, CP95
• Simonis H., P.Kay (1995) Building Industrial CHIP applications from reusable software components, 3rd Conference on Practical Applications of Prolog April 1995
• Srinivas N. and K.Deb (1993), Multi -objective Optimization using nondominated sorting in genetic algorithms, Technical report, Department of Mechanical Engeneering, Indian Institute of technology, Kanput, India, 1993.
• Smith B., Brailsford S., Hubbard P., Williams H. (1996) The progressive party problem: Integer Linear Programming and Constraint Programming Compared, Constraints Vol 1, Num 1&2.
• Spears, W. M. (1993) Simulated Annealing for hard satisfiability problems. Technical report, Naval Research Laboratory, Washington D.C., 1993.
• Srinivas N. and Deb K. (93), Multi -objective Optimization using nondominated sorting in genetic algorithms, Technical report, Department of Mechanical Engeneering, Indian Institute of technology, Kanput, India, 1993.
• Surry, P. D, Radcliffe, N. J., and Boyd I.D. (1995) A Multi-Objective Approach to Constrained Optimization of Gas Supply Networks: The COMOGA Method. In T. C. Fogarty, editor, Evolutionary Computing. AISB Workshop. Selected papers, Lecture Notes in Computer Science, 166-180. Springer-Verlag, UK, 1995.
• Suppapitnarm, A., K.A. Seffen, G.T. Parks, P.J. Clarkson, J.S. Liu (1999): Design by multi-objective optimization using simulated annealing. Proceedings of ICED99, International Conference on Engineering Design, Munich, August 24-26, 1999, pgs 1395-1400.
• Tiourine S., Hurkens C., Lenstra J. (??) An overview of algorithmic approaches to frequency assignment problems, download: ftp://ftp.win.tue.nl/pub/techreports/CALMA/overview.ps
• Trombettoni, G. (1993), A constraint maintenance algorithm based on value propagation. Poster in the 6th Portuguese Conference on Artificial Intelligence, EPIA'93, LNCS 727, 360, Porto, Portugal.
• Tsang E. (1993) Foundations of Constraint Satisfaction. Academic Press.
• Tsang E., Voudouris C. () Fast Local Search and guided local search and their applications to British Telecoms workforce scheduling problem. Operations Research letters 20, 119-127.
• Tsang E., Wang C., Davenport A., Voudouris C., Lau T. (1999) A Family of Stochastic Methods For Constraint Satisfaction and Optimization. The first International Conference on The Practical Application of Constraint Technologies and Logic Programming, London.
• Tuyttens, D., Teghem, J., Fortemps, Ph. and van Nieuwenhuyze, K., (2000) Performance of the MOSA method for the bicriteria assignment problem. To appear in Journal of Heuristics, Special issue on multiple objective MetaHeuristics6:2, Summer 2000, Kluwer academic Publishers.
• Ulungu, E.L., J. Teghem and Ph. Fortemps (1997) Heuristics for multi-objective combinatorial optimization by Simulated Annealing, in Gu, J., Chen, G., Wei, Q. and Wang, S. (eds), Multicriteria Analysis, Springer -Verlag, Berlin, 1997, pp. 269-278.
• Ulungu E.L., J. Teghem, P.H. Fortemps, D. Tuyttens (1999), MOSA method: a tool for solving multi-objective combinatorial optimization problems, Journal of Multi-Criteria Decision Analysis Volume: 8, Issue: 4, Date: July 1999, Pages: 221-236.
• Ulungu E.L., J. Teghem, and Ost, C.(1998) Interactive Simulate Annealing in a multi-objective framework: application to an industrial problem, J. Oper. Res. Soc., 49, 1044-1050 (1998).
• Verfaille G. Schiex T. (1994) Solution reuse in dynamic constraint satisfaction problems. Proc. of AAAI-94, 307- 312.
• Verfaillie G. and Schiex T. (1994). Dynamic backtracking for dynamic CSPs Proc. ECAI' 94 Workshop on constraint Satisfaction Issues raised by Practical Applications , ed. by Schiex and Bessière - Amsterdam.
• Verfaillie G., Lemaitre M., Schiex T. (1996) Russian doll search for solving constraint satisfaction problems. Proc of AAAI-96, 181-187.
• Voudouris C. (1997) Guided Local Search for Combinatorial Optimization Problems. PhD thesis. Department of Computer Science, University of Essex, 1997.
• Voudouris C., Tsang E. (1998) Solving the Radio Link Frequency Assignment Problem using Guided Local Search. Proc. NATO Symposium on Radio Length Frequency Assignment, Sharing and Conservation Aalborg, Denmark.
• Wah B., Wang T., (1999) Simulated annealing with asymptotic convergence for nonlinear constrained global optimization. Proc. of CP-99, 461-475.
• Wallace R. (1995) Directed Arc Consistency Preprocessing. Selected papers from the ECAI-94 Workshop on Constraint Processing, LNCS-923, M. Meyer editor, 121-137.
• Wallace R. (1996) Enhancements of branch and bound methods for the maximal constraint satisfaction problem. Proc. of AAAI-96, 188-195.
• Wallace R. (1996) Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems. Proc. CP-96. LNCS, No.1118. Berlin: Springer.
• Wallace R., Freuder E.C. (1993) Conjunctive width heuristics for maximal constraint satisfaction. Proc. of AAAI-93, 762-768.
• Wallace R., Freuder E.C. (1995) Heuristics Methods for Over-Constrained Constraint Satisfaction Problems. Proc. of CP-95, France.
• Wallace R., Freuder E.C. (1998) Stable Solutions for dynamic constraint satisfaction problems Proc. of CP-98, LNCS No. 1520, 447-461.
• Walser J. (1997) Solving Linear Pseudo-Boolean Constraints Problems with Local Search, Proc. of AAAI-97.
• Wierzbicki, A.P. (1986), On the completeness and constructiveness of parametric characterizations to vector optimization problems, OR Spectrum, Vol.8, 1986, pp. 73-87,
• Yokoo M. (1994) Weak-commitment search for solving constraint satisfaction problems. Proc. of AAAI-94, 313-318.
• Yoshikawa, Kaneko, Yamanouchi Watanabe (1996), A Constraint-Based High School Scheduling System. IEEE 11(1) 63-72.
• Yugami N., Ohta Y., Hara H. (1994) Improving Repair-Based Constraint Satisfaction Methods by Value Propagation. Proc. of AAAI-94, 344-349.