Listing 1 - 10 of 24 | << page >> |
Sort by
|
Choose an application
Combinatorial optimization --- Optimisation combinatoire --- Congresses --- Congrès --- Congresses. --- Congrès --- Combinatorial optimization - Congresses.
Choose an application
Choose an application
Bonn Workshop on Combinatorial Optimization
Combinatorial optimization --- Optimisation combinatoire --- Congresses --- Congrès --- ELSEVIER-B EPUB-LIV-FT --- Combinatorial analysis --- Combinatorial optimization - Congresses
Choose an application
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
A collection of papers surveying recent progress in the field of Combinatorial Optimization.Topics examined include theoretical and computational aspects (Boolean Programming, Probabilistic Analysis of Algorithms, Parallel Computer Models and Combinatorial Algorithms), well-known combinatorial problems (such as the Linear Assignment Problem, the Quadratic Assignment Problem, the Knapsack Problem and Steiner Problems in Graphs) and more applied problems (such as Network Synthesis and Dynamic Network Optimization, Single Facility Location Problems on Networks, the Vehicle Routing Problem
Choose an application
Mathematics --- Mathematical optimization --- Integer programming --- Optimisation mathématique --- Programmation en nombres entiers --- Periodicals. --- Périodiques --- Integer programming. --- Mathematical optimization. --- Programmation en nombres entiers. --- Optimisation mathématique. --- Optimisation combinatoire. --- Mathematical Sciences --- Algorithms --- Applied Mathematics --- Logic --- Mathematical Analysis & Logic
Choose an application
Combinatorial optimization. --- Optimisation combinatoire --- Combinatorial optimization --- 519.212 --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Abstract probability theory. Combinatorial probabilities. Geometric probabilities --- 519.212 Abstract probability theory. Combinatorial probabilities. Geometric probabilities
Choose an application
Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. It became a subject in its own right about 50 years ago. This book describes the most important ideas, theoretical results, and algo rithms in combinatorial optimization. We have conceived it as an advanced gradu ate text which can also be used as an up-to-date reference work for current research. The book includes the essential fundamentals of graph theory, linear and integer programming, and complexity theory. It covers classical topics in combinatorial optimization as well as very recent ones. The emphasis is on theoretical results and algorithms with provably good performance. Applications and heuristics are mentioned only occasionally. Combinatorial optimization has its roots in combinatorics, operations research, and theoretical computer science. A main motivation is that thousands of real-life problems can be formulated as abstract combinatorial optimization problems. We focus on the detailed study of classical problems which occur in many different contexts, together with the underlying theory. Most combinatorial optimization problems can be formulated naturally in terms of graphs and as (integer) linear programs. Therefore this book starts, after an introduction, by reviewing basic graph theory and proving those results in linear and integer programming which are most relevant for combinatorial optimization.
Combinatorial optimization. --- Optimisation combinatoire --- Combinatorial optimization --- Combinatorics. --- Calculus of variations. --- Computer science—Mathematics. --- Calculus of Variations and Optimal Control; Optimization. --- Mathematics of Computing. --- Isoperimetrical problems --- Variations, Calculus of --- Maxima and minima --- Combinatorics --- Algebra --- Mathematical analysis
Choose an application
Combinatorial optimization. --- Optimisation combinatoire --- Combinatorial optimization --- 519.2 --- 519.212 --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Probability. Mathematical statistics --- Abstract probability theory. Combinatorial probabilities. Geometric probabilities --- 519.212 Abstract probability theory. Combinatorial probabilities. Geometric probabilities --- 519.2 Probability. Mathematical statistics
Choose an application
Combinatorial geometry --- Geometry of numbers --- Mathematical optimization --- Programming (Mathematics) --- Géométrie combinatoire --- Geometrie des nombres --- Optimisation mathématique --- Programmation (Mathématiques) --- Combinatorial geometry. --- Geometry of numbers. --- Mathematical optimization. --- Programming (Mathematics). --- Programmation mathematique --- Geometrie algorithmique --- Geometrie convexe --- Optimisation combinatoire --- Corps convexes
Listing 1 - 10 of 24 | << page >> |
Sort by
|