Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Combinatorial optimization --- Programming (Mathematics) --- Padberg, M. W.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book presents an extensive variety of multi-objective problems across diverse disciplines, along with statistical solutions using multi-objective evolutionary algorithms (MOEAs). The topics discussed serve to promote a wider understanding as well as the use of MOEAs, the aim being to find good solutions for high-dimensional real-world design applications. The book contains a large collection of MOEA applications from many researchers, and thus provides the practitioner with detailed algorithmic direction to achieve good results in their selected problem domain.

Combinatorial optimization. --- Evolutionary computation. --- Computation, Evolutionary --- Neural networks (Computer science) --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Combinatorial optimization --- Evolutionary computation

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Certain constrained combinatorial optimization problems have a natural analogue in the continuous setting of the classical isoperimetric problem. The study of so called combinatorial isoperimetric problems exploits similarities between these two, seemingly disparate, settings. This text focuses on global methods. This means that morphisms, typically arising from symmetry or direct product decomposition, are employed to transform new problems into more restricted and easily solvable settings whilst preserving essential structure. This book is based on Professor Harper's many years' experience in teaching this subject and is ideal for graduate students entering the field. The author has increased the utility of the text for teaching by including worked examples, exercises and material about applications to computer science. Applied systematically, the global point of view can lead to surprising insights and results, and established researchers will find this to be a valuable reference work on an innovative method for problem solving.

Combinatorial optimization. --- Calculus of variations. --- Morphisms (Mathematics) --- Categories (Mathematics) --- Set theory --- Isoperimetrical problems --- Variations, Calculus of --- Maxima and minima --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume contains the proceedings of the First International Conference on IntegrationofAIandORTechniquesinConstraintProgrammingforCombina- rialOptimisation Problems.This new conferencefollows the seriesof CP-AI-OR International Workshops on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems held in Ferrara (1999), Paderborn (2000), Ashford (2001), Le Croisic (2002), and Montreal (2003). The success of the previous workshops has demonstrated that CP-AI-OR is bec- ing a major forum for exchanging ideas and methodologiesfrom both ?elds. The aim of this new conference is to bring together researchersfrom AI and OR, and to give them the opportunity to show how the integration of techniques from AI and OR can lead to interesting results on large scale and complex problems. The integration of techniques from Arti?cial Intelligence and Operations - search has provided e?ective algorithms for tackling complex and large scale combinatorial problems with signi?cant improvements in terms of e?ciency, scalability and optimality. The bene?t of this integration has been shown in applications such as hoist scheduling, rostering, dynamic scheduling and vehicle routing. At the programming and modelling levels, most constraint languages embed OR techniques to reason about collections of constraints, so-calledglobal constraints. Some languages also provide support for hybridization allowing the programmer to build new integrated algorithms. The resulting multi-paradigm programmingframeworkcombines the ?exibility and modelling facilities of C- straint Programming with the special purpose and e?cient methods from - erations Research.

Constraints (Artificial intelligence) --- Constraint programming (Computer science) --- Combinatorial optimization --- Artificial intelligence --- Operations research --- Technique --- Combinatorics. --- Numeric Computing. --- Operations Research/Decision Theory. --- Constraint satisfaction (Artificial intelligence) --- Computer science. --- Operations research. --- Decision making. --- Software engineering. --- Algorithms. --- Numerical analysis. --- Computer science --- Artificial intelligence. --- Computer Science. --- Software Engineering/Programming and Operating Systems. --- Discrete Mathematics in Computer Science. --- Algorithm Analysis and Problem Complexity. --- Artificial Intelligence (incl. Robotics). --- Operation Research/Decision Theory. --- Mathematics. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Electronic data processing. --- Computational complexity. --- Computer software. --- Artificial Intelligence. --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Software, Computer --- Computer systems --- Complexity, Computational --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Computer software engineering --- Engineering --- Automation --- Computer science—Mathematics. --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management --- Management decisions --- Choice (Psychology) --- Problem solving --- Algorism --- Algebra --- Arithmetic --- Mathematical analysis --- Decision making --- Foundations --- Constraints (Artificial intelligence) - Congresses --- Constraint programming (Computer science) - Congresses --- Combinatorial optimization - Congresses --- Artificial intelligence - Technique - Congresses --- Operations research - Congresses --- Discrete mathematics. --- Software Engineering. --- Numerical Analysis. --- Operations Research and Decision Theory. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Computer mathematics --- Mathematics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The two volume set LNCS 3102/3103 constitutes the refereed proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2004, held in Seattle, WA, USA, in June 2004. The 230 revised full papers and 104 poster papers presented were carefully reviewed and selected from 460 submissions. The papers are organized in topical sections on artificial life, adaptive behavior, agents, and ant colony optimization; artificial immune systems, biological applications; coevolution; evolutionary robotics; evolution strategies and evolutionary programming; evolvable hardware; genetic algorithms; genetic programming; learning classifier systems; real world applications; and search-based software engineering.

Genetic algorithms --- Parallel processing (Electronic computers) --- Data processing --- Evolutionary computation. --- Genetic computation. --- GAs (Algorithms) --- Genetic searches (Algorithms) --- Computer science. --- Microprocessors. --- Computers. --- Algorithms. --- Computer science --- Artificial intelligence. --- Bioinformatics. --- Computer Science. --- Computation by Abstract Devices. --- Algorithm Analysis and Problem Complexity. --- Artificial Intelligence (incl. Robotics). --- Processor Architectures. --- Discrete Mathematics in Computer Science. --- Mathematics. --- Computer Science, general. --- Algorithms --- Combinatorial optimization --- Evolutionary computation --- Genetic programming (Computer science) --- Learning classifier systems --- Computer software. --- Computational complexity. --- Artificial Intelligence. --- Bio-informatics --- Biological informatics --- Biology --- Information science --- Computational biology --- Systems biology --- Complexity, Computational --- Electronic data processing --- Machine theory --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Software, Computer --- Computer systems --- Informatics --- Science --- Computer science—Mathematics. --- Minicomputers --- Algorism --- Algebra --- Arithmetic --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Cybernetics --- Calculators --- Cyberspace --- Foundations --- Genetic algorithms - Data processing - Congresses --- Parallel processing (Electronic computers) - Congresses