Narrow your search

Library

Thomas More Kempen (20)

Thomas More Mechelen (20)

UCLL (20)

VIVES (20)

KU Leuven (19)

Odisee (19)

ULB (19)

ULiège (19)

LUCA School of Arts (12)

UGent (3)

More...

Resource type

book (21)

periodical (4)


Language

English (24)

French (1)


Year
From To Submit

2010 (25)

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

Book
Polyhedral and semidefinite programming methods in combinatorial optimization
Author:
ISBN: 0821833529 9780821833520 Year: 2010 Publisher: Providence: American mathematical society,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Periodical
International journal of combinatorial optimization problems and informatics.
Year: 2010 Publisher: [Mexico] : [International journal of combinatorial optimization problems and informatics],

Loading...
Export citation

Choose an application

Bookmark

Abstract


Periodical
International journal of combinatorial optimization problems and informatics.
Year: 2010 Publisher: [Mexico] : [International journal of combinatorial optimization problems and informatics],


Periodical
International journal of combinatorial optimization problems and informatics.
Year: 2010 Publisher: [Mexico] : [International journal of combinatorial optimization problems and informatics],


Periodical
International journal of operations research and optimization.
Author:
ISSN: 22314741 Year: 2010 Publisher: Meerut : Association for Advancement in Combinatorial Sciences,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Traveling salesman problem, theory and applications
Author:
ISBN: 9535155016 9533074264 Year: 2010 Publisher: IntechOpen

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem. It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented. Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering.


Book
50 years of integer programming, 1958-2008 : from the early years to the state-of-the-art
Author:
ISBN: 3540682740 9786612509940 1282509942 3540682791 9783540682745 Year: 2010 Publisher: Berlin : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a short paper that described his cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In January of 2008, to commemorate the anniversary of Gomory's seminal paper, a special session celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. This book is based on the material presented during this session. 50 Years of Integer Programming offers an account of featured talks at the 2008 Aussois workshop, namely - Michele Conforti, Gérard Cornuéjols, and Giacomo Zambelli: Polyhedral Approaches to Mixed Integer Linear Programming - William Cook: 50+ Years of Combinatorial Integer Programming - Francois Vanderbeck and Laurence A. Wolsey: Reformulation and Decomposition of Integer Programs The book contains reprints of key historical articles together with new introductions and historical perspectives by the authors: Egon Balas, Michel Balinski, Jack Edmonds, Ralph E. Gomory, Arthur M. Geoffrion, Alan J. Hoffman & Joseph B. Kruskal, Richard M. Karp, Harold W. Kuhn, and Ailsa H. Land & Alison G. Doig. It also contains written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community: - Friedrich Eisenbrand: Integer Programming and Algorithmic Geometry of Numbers - Raymond Hemmecke, Matthias Köppe, Jon Lee, and Robert Weismantel: Nonlinear Integer Programming - Andrea Lodi: Mixed Integer Programming Computation - Francois Margot: Symmetry in Integer Linear Programming - Franz Rendl: Semidefinite Relaxations for Integer Programming - Jean-Philippe P. Richard and Santanu S. Dey: The Group-Theoretic Approach to Mixed Integer Programming Integer programming holds great promise for the future, and continues to build on its foundations. Indeed, Gomory's finite cutting-plane method for the pure integer case is currently being reexamined and is showing new promise as a practical computational method. This book is a uniquely useful celebration of the past, present and future of this important and active field. Ideal for students and researchers in mathematics, computer science and operations research, it exposes mathematical optimization, in particular integer programming and combinatorial optimization, to a broad audience.


Book
50 years of integer programming 1958-2008 : from the early years to the state-of-the-art
Authors: --- --- --- --- --- et al.
ISBN: 9783540682790 9783540682745 3540682740 Year: 2010 Publisher: Berlin: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a short paper that described his cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In January of 2008, to commemorate the anniversary of Gomory's seminal paper, a special session celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. This book is based on the material presented during this session. 50 Years of Integer Programming offers an account of featured talks at the 2008 Aussois workshop, namely - Michele Conforti, Gérard Cornuéjols, and Giacomo Zambelli: Polyhedral Approaches to Mixed Integer Linear Programming - William Cook: 50+ Years of Combinatorial Integer Programming - Francois Vanderbeck and Laurence A. Wolsey: Reformulation and Decomposition of Integer Programs The book contains reprints of key historical articles together with new introductions and historical perspectives by the authors: Egon Balas, Michel Balinski, Jack Edmonds, Ralph E. Gomory, Arthur M. Geoffrion, Alan J. Hoffman & Joseph B. Kruskal, Richard M. Karp, Harold W. Kuhn, and Ailsa H. Land & Alison G. Doig. It also contains written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community: - Friedrich Eisenbrand: Integer Programming and Algorithmic Geometry of Numbers - Raymond Hemmecke, Matthias Köppe, Jon Lee, and Robert Weismantel: Nonlinear Integer Programming - Andrea Lodi: Mixed Integer Programming Computation - Francois Margot: Symmetry in Integer Linear Programming - Franz Rendl: Semidefinite Relaxations for Integer Programming - Jean-Philippe P. Richard and Santanu S. Dey: The Group-Theoretic Approach to Mixed Integer Programming Integer programming holds great promise for the future, and continues to build on its foundations. Indeed, Gomory's finite cutting-plane method for the pure integer case is currently being reexamined and is showing new promise as a practical computational method. This book is a uniquely useful celebration of the past, present and future of this important and active field. Ideal for students and researchers in mathematics, computer science and operations research, it exposes mathematical optimization, in particular integer programming and combinatorial optimization, to a broad audience.


Book
Optimisation combinatoire : théorie et algorithmes
Authors: --- --- ---
ISBN: 1282835335 9786612835339 2287990372 Year: 2010 Publisher: Paris : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Ce livre est la traduction fran aise de la quatri me et derni re dition de Combinatorial Optimization: Theory and Algorithms crit par deux minents sp cialistes du domaine: Bernhard Korte et Jens Vygen de l'universit de Bonn en Allemagne. Il met l accent sur les aspects th oriques de l'optimisation combinatoire ainsi que sur les algorithmes efficaces et exacts de r solution de probl mes. Il se distingue en cela des approches heuristiques plus simples et souvent d crites par ailleurs. L ouvrage contient de nombreuses d monstrations, concises et l gantes, de r sultats difficiles. Destin aux tudia


Book
Computational intelligence in expensive optimization problems
Authors: ---
ISBN: 3642107001 9786612836978 364210701X 1282836978 Year: 2010 Publisher: Berlin : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

In modern science and engineering, laboratory experiments are replaced by high fidelity and computationally expensive simulations. Using such simulations reduces costs and shortens development times but introduces new challenges to design optimization process. Examples of such challenges include limited computational resource for simulation runs, complicated response surface of the simulation inputs-outputs, and etc. Under such difficulties, classical optimization and analysis methods may perform poorly. This motivates the application of computational intelligence methods such as evolutionary algorithms, neural networks and fuzzy logic, which often perform well in such settings. This is the first book to introduce the emerging field of computational intelligence in expensive optimization problems. Topics covered include: Dedicated implementations of evolutionary algorithms, neural networks and fuzzy logic. Reduction of expensive evaluations (modelling, variable-fidelity, fitness inheritance). Frameworks for optimization (model management, complexity control, model selection). Parallelization of algorithms (implementation issues on clusters, grids, parallel machines). Incorporation of expert systems and human-system interface. Single and multiobjective algorithms. Data mining and statistical analysis. Analysis of real-world cases (such as multidisciplinary design optimization). The edited book provides both theoretical treatments and real-world insights gained by experience, all contributed by leading researchers in the respective fields. As such, it is a comprehensive reference for researchers, practitioners, and advanced-level students interested in both the theory and practice of using computational intelligence for expensive optimization problems.

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