Listing 1 - 2 of 2 |
Sort by
|
Choose an application
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.
Integer programming --- Combinatorial optimization --- Programmation en nombres entiers --- Optimisation combinatoire --- Congresses. --- Congrès --- Congresses --- Congrès --- Information theory. --- Distribution (Probability theory. --- Mathematics. --- Computer software. --- Numerical analysis. --- Combinatorics. --- Theory of Computation. --- Probability Theory and Stochastic Processes. --- Applications of Mathematics. --- Algorithm Analysis and Problem Complexity. --- Numerical Analysis. --- Combinatorics --- Algebra --- Mathematical analysis --- Software, Computer --- Computer systems --- Math --- Science --- Distribution functions --- Frequency distribution --- Characteristic functions --- Probabilities --- Communication theory --- Communication --- Cybernetics --- Integer programming - Congresses --- Combinatorial optimization - Congresses
Choose an application
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
Chemistry --- Simulated annealing (Mathematics) --- Algorithm, Annealing --- Algorithm, Probabilistic exchange --- Annealing, Monte Carlo --- Annealing, Simulated --- Annealing algorithm --- Cooling, Statistical --- Exchange algorithm, Probabilistic --- Hill climbing, Probabilistic --- Monte Carlo annealing --- Probabilistic exchange algorithm --- Probabilistic hill climbing --- Relaxation, Stochastic --- Statistical cooling --- Stochastic relaxation --- Combinatorial optimization --- Mathematics.
Listing 1 - 2 of 2 |
Sort by
|