Choose an application

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

Operations research --- Combinatorial optimization --- Recherche opérationnelle --- Optimisation combinatoire --- Recherche opérationnelle

Choose an application

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

It has widely been recognized that submodular functions play essential roles in efficiently solvable combinatorial optimization problems. Since the publication of the 1st edition of this book fifteen years ago, submodular functions have been showing further increasing importance in optimization, combinatorics, discrete mathematics, algorithmic computer science, and algorithmic economics, and there have been made remarkable developments of theory and algorithms in submodular functions. The 2nd edition of the book supplements the 1st edition with a lot of remarks and with new two chapters: ""Sub

Submodular functions. --- Combinatorial optimization. --- Optimization, Combinatorial --- Functions, Submodular --- Combinatorial analysis --- Mathematical optimization --- Matroids --- Submodular functions --- Combinatorial optimization --- Fonctions sous modulaires --- Optimisation combinatoire --- ELSEVIER-B EPUB-LIV-FT

Choose an application

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

"With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"-- "With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"--

Iterative methods (Mathematics) --- Combinatorial optimization --- Itération (Mathématiques) --- Optimisation combinatoire --- Combinatorial optimization. --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Iteration (Mathematics) --- Numerical analysis --- Iterative methods (Mathematics).

Choose an application

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

Mathematical optimization --- Integer programming --- Integer programming. --- Mathematical optimization. --- Programmation en nombres entiers. --- Optimisation mathématique. --- Optimisation combinatoire. --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Optimisation mathématique. --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Programming (Mathematics) --- Operations Research --- Optimisation mathématique --- Optimisation mathématique

Choose an application

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

This journal publishes on research in hybrid metaheuristics (including evolutionary hybrids) for optimization, control and design in continuous and discrete optimization domains, thereby investigating promising new hybrid algorithmic technologies. Articles published in this journal discuss innovative research on the emergence of cultural artifacts such as game, trade and negotiation strategies and, more generally, rules of behavior as they apply to, for example, robotic, multi-agent and artificial life systems. The journal tries to publish results in Natural Computation, Artificial Intelligence, Machine Learning, Operational Research and Natural Sciences (e.g. cognitive, animal and insect's behavior, etc.) in order to transcend the intrinsic limitations of a single discipline.

Combinatorial optimization --- Data processing --- Data processing. --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- optimalisatiemethoden --- optimization methods --- robots --- bioinformatics --- algoritmen --- algorithms --- kunstmatige intelligentie --- artificial intelligence --- heuristiek --- heuristics --- toegepaste wiskunde --- applied mathematics --- Bioinformatics (General) --- Applied Mathematics --- Bioinformatica (algemeen) --- Toegepaste wiskunde --- Optimisation combinatoire --- Informatique --- Information Technology --- General and Others --- Optimització combinatòria --- Algorismes computacionals --- Intel·ligència artificial --- Optimització combinatòria. --- Algorismes computacionals. --- Intel·ligència artificial. --- Optimització combinatòria. --- Intel·ligència artificial.