Narrow your search

Library

UGent (24)

KU Leuven (18)

ULB (18)

ULiège (15)

UCLouvain (14)

VUB (11)

Odisee (7)

Thomas More Kempen (7)

Thomas More Mechelen (7)

UCLL (7)

More...

Resource type

book (20)

periodical (4)


Language

English (24)


Year
From To Submit

2009 (1)

2008 (1)

2006 (3)

2005 (2)

2003 (1)

More...
Listing 1 - 10 of 24 << page
of 3
>>
Sort by

Book
Combinatorial optimization : new frontiers in theory and practice
Authors: ---
ISBN: 3540554394 0387554394 3642774911 364277489X 9783540554394 Year: 1992 Volume: 82 Publisher: Berlin: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Combinatorial optimization : theory and algorithms
Authors: ---
ISSN: 09375511 ISBN: 9783540718437 9783540718444 3540718435 Year: 2008 Volume: 21 Publisher: Berlin: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Bonn Workshop on Combinatorial Optimization
Authors: --- --- ---
ISBN: 0444863664 9780444863669 9780080871776 0080871771 1281797456 9781281797452 9786611797454 6611797459 Year: 1982 Volume: 66 16 Publisher: Amsterdam ; New York : New York, N.Y. : North-Holland Pub. Co. ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Bonn Workshop on Combinatorial Optimization

Submodular functions and optimization
Author:
ISBN: 1280628960 9786610628964 008046162X 0444520864 Year: 2005 Volume: 58 Publisher: Boston : Elsevier,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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

Surveys in combinatorial optimization
Author:
ISBN: 1281797944 9786611797942 0080872433 0444701362 Year: 1987 Volume: 132 31 Publisher: Amsterdam ; New York : New York : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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


Periodical
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.

Geometric algorithms and combinatorial optimization
Authors: --- ---
ISBN: 3540567402 0387567402 9783642782428 3642782426 364278240X 9783540567400 Year: 1993 Volume: 2 Publisher: Berlin : Springer-Verlag,

Listing 1 - 10 of 24 << page
of 3
>>
Sort by