Narrow your search

Library

KU Leuven (5)

ULB (4)

ULiège (3)

Odisee (2)

Thomas More Kempen (2)

Thomas More Mechelen (2)

UCLouvain (2)

UCLL (2)

UGent (2)

VIVES (2)

More...

Resource type

book (4)

periodical (2)


Language

English (6)


Year
From To Submit

2000 (6)

Listing 1 - 6 of 6
Sort by
Scheduling : control-based theory and polynomial-time algorithms.
Authors: ---
ISBN: 0792364864 Year: 2000 Publisher: Boston Kluwer

Loading...
Export citation

Choose an application

Bookmark

Abstract

A set of examples of global and discrete optimization : applications of Bayesian Heuristic Approach
Author:
ISBN: 0792363590 Year: 2000 Publisher: Dordrecht Kluwer

Loading...
Export citation

Choose an application

Bookmark

Abstract

Combinatorial optimization : theory and algorithms
Authors: ---
ISBN: 3540672265 3662217104 3662217082 9783540672265 Year: 2000 Volume: 21 Publisher: Berlin: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.


Periodical
Genetic programming and evolvable machines.
ISSN: 15737632 13892576 Year: 2000 Publisher: Dordrecht : Kluwer Academic Publishers,

Approximation Algorithms for Combinatorial Optimization : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings
Authors: --- ---
ISSN: 03029743 ISBN: 3540679960 9783540679967 354044436X Year: 2000 Volume: 1913 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Computer algorithms --- Approximation theory --- Combinatorial optimization --- Computer Science --- Engineering & Applied Sciences --- Data processing --- Optimization, Combinatorial --- Theory of approximation --- Computer science. --- Computer programming. --- Data structures (Computer science). --- Algorithms. --- Computer graphics. --- Application software. --- Computer Science. --- Programming Techniques. --- Data Structures, Cryptology and Information Theory. --- Computer Applications. --- Algorithm Analysis and Problem Complexity. --- Data Structures. --- Computer Graphics. --- Combinatorial analysis --- Mathematical optimization --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems --- Data structures (Computer scienc. --- Computer software. --- Data Structures and Information Theory. --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Software, Computer --- Computer systems --- Informatics --- Science --- Digital techniques --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Algorism --- Algebra --- Arithmetic --- Application computer programs --- Application computer software --- Applications software --- Apps (Computer software) --- Computer software --- Programming --- Foundations --- Computer algorithms - Congresses --- Approximation theory - Data processing - Congresses --- Combinatorial optimization - Data processing - Congresses --- Information theory. --- Artificial intelligence—Data processing. --- Computer and Information Systems Applications. --- Data Science. --- Communication theory --- Communication --- Cybernetics --- Data structures (Computer science)

Listing 1 - 6 of 6
Sort by