Choose an application

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

Genetic algorithms --- Parallel processing (Electronic computers) --- GAs (Algorithms) --- Genetic searches (Algorithms) --- Algorithms --- Combinatorial optimization --- Evolutionary computation --- Genetic programming (Computer science) --- Learning classifier systems --- Data processing

Choose an application

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

This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems. After discussing the classical approaches described in the literature, the book addresses how to extend these tools to other non-standard formulations that may be applied to a broad set of applications. Examples are provided to illustrate the underlying concepts and to pave the way for future contributions.

Business. --- Operations research. --- Decision making. --- Management science. --- Mathematical optimization. --- Business and Management. --- Operation Research/Decision Theory. --- Operations Research, Management Science. --- Discrete Optimization. --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Quantitative business analysis --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management --- Management decisions --- Operational analysis --- Operational research --- Trade --- Decision making --- Operations Research/Decision Theory. --- Industrial engineering --- Management science --- Research --- System theory --- Combinatorial optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Problem solving --- Statistical decision --- Choice (Psychology)

Choose an application

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

Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. Contents Decomposition for Multi-Period Network Design Solving Network Design Problems via Aggregation Approximate Second-Order Cone Robust Optimization Target Groups Researchers, teachers and students in mathematical optimization and operations research Network planners in the field of logistics and beyond < About the Author Dr. Andreas Bärmann is currently working as a postdoctoral researcher at the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) at the chair of Economics, Discrete Optimization and Mathematics. His research is focussed on mathematical optimization, especially the optimization of logistic processes.

Mathematics. --- Business logistics. --- Operations research. --- Decision making. --- Mathematical optimization. --- Optimization. --- Operation Research/Decision Theory. --- Logistics. --- Combinatorial optimization --- Data processing. --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Operations Research/Decision Theory. --- Supply chain management --- Industrial management --- Logistics --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management --- Management decisions --- Choice (Psychology) --- Problem solving --- Decision making

Choose an application

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

This book constitutes the refereed proceedings of the 10th International Conference on Combinatorial Optimization and Applications, COCOA 2016, held in Hong Kong, China, in December 2016. The 60 full papers included in the book were carefully reviewed and selected from 122 submissions. The papers are organized in topical sections such as graph theory, geometric optimization, complexity and data structure, combinatorial optimization, and miscellaneous.

Computer science. --- Computer communication systems. --- Algorithms. --- Numerical analysis. --- Computer science --- Computer graphics. --- Computer Science. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Numeric Computing. --- Computer Communication Networks. --- Computer Graphics. --- Mathematics. --- Algorism --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Informatics --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Mathematics --- Algebra --- Arithmetic --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Science --- Computer art --- Graphic arts --- Engineering graphics --- Image processing --- Mathematical analysis --- Foundations --- Distributed processing --- Digital techniques --- Computer software. --- Computational complexity. --- Electronic data processing. --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Complexity, Computational --- Machine theory --- Software, Computer --- Computer systems --- Automation --- Combinatorial optimization --- Computer science—Mathematics. --- Discrete mathematics. --- Computer networks. --- Numerical Analysis. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis

Choose an application

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

This book constitutes the proceedings of the 13th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2016, held in Banff, Canada, in May/June 2016. The 21 full papers presented together with 8 short papers were carefully reviewed and selected from 51 submissions. The conference brings together interested researchers from constraint programming, artificial intelligence, and operations research to present new techniques or applications in combinatorial optimization and provides an opportunity for researchers in one area to learn about techniques in the others, and to show how the integration of techniques from different fields can lead to interesting results on large and complex problems.

Computer science. --- Algorithms. --- Numerical analysis. --- Computer science --- Artificial intelligence. --- Operations research. --- Management science. --- Computer Science. --- Numeric Computing. --- Math Applications in Computer Science. --- Discrete Mathematics in Computer Science. --- Algorithm Analysis and Problem Complexity. --- Artificial Intelligence (incl. Robotics). --- Operations Research, Management Science. --- Mathematics. --- Quantitative business analysis --- Operational analysis --- Operational research --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Algorism --- Informatics --- Mathematics --- Management --- Problem solving --- Operations research --- Statistical decision --- Industrial engineering --- Management science --- Research --- System theory --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Mathematical analysis --- Algebra --- Arithmetic --- Science --- Foundations --- Electronic data processing. --- Computational complexity. --- Computer software. --- Artificial Intelligence. --- 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 --- Automation --- Constraint programming (Computer science) --- Combinatorial optimization --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Computer science—Mathematics. --- Discrete mathematics. --- Numerical Analysis. --- Mathematical Applications in Computer Science. --- Operations Research, Management Science . --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis