Narrow your search

Library

KBR (1)

KU Leuven (1)

LUCA School of Arts (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

UCLouvain (1)

UCLL (1)

UGent (1)

ULB (1)

More...

Resource type

book (2)


Language

English (2)


Year
From To Submit

1995 (2)

Listing 1 - 2 of 2
Sort by
Integer programming and combinatorial aoptimization. 4th international IPCO conference, Copenhaegen, Denmark, May 1995. Proceedings
Author:
ISBN: 3540594086 0387594086 3540492453 9780387594088 9783540594086 Year: 1995 Volume: 920 Publisher: Berlin : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This volume constitutes the proceedings of the Fourth International Conference on Integer Programming and Combinatorial Optimization, IPCO '95, held in Copenhagen in May 1995 under the sponsorship of the Mathematical Programming Society. Integer programming and combinatorial optimization provide a fruitful theoretical and algorithmic basis for the solution of a number of optimization problems occuring in real-world situations, such as production planning and scheduling, routing, crew scheduling, or network construction. This volume presents 36 revised papers selected from a total of 105 submissions and offers a representative up-to-date snapshot on the state of the art in this interdisciplinary area of research and applications.


Book
Adaption of simulated annealing to chemical optimization problems
Author:
ISBN: 9780444818959 0444818952 9780080544748 0080544746 9786611058135 1281058130 Year: 1995 Publisher: New York : Elsevier,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Optimization problems occurring regularly in chemistry, vary from selecting the best wavelength design for optimal spectroscopic concentration predictions to geometry optimization of atomic clusters and protein folding. Numerous optimization tactics have been explored to solve these problems. While most optimizers maintain the ability to locate global optima for simple problems, few are robust against local optima convergence with regard to difficult or large scale optimization problems. Simulated annealing (SA) has shown a great tolerance to local optima convergence and is often called a glob

Listing 1 - 2 of 2
Sort by