نتایج جستجو برای: discrete optimization

تعداد نتایج: 467118  

2005
Kazuo Murota

“Discrete Convex Analysis” is aimed at establishing a novel theoretical framework for solvable discrete optimization problems by means of a combination of the ideas in continuous optimization and combinatorial optimization. The theoretical framework of convex analysis is adapted to discrete settings and the mathematical results in matroid/submodular function theory are generalized. Viewed from ...

Journal: :Math. Program. 1998
Kazuo Murota

Discrete convex analysis [18, 40, 43, 47] aims to establish a general theoretical framework for solvable discrete optimization problems by means of a combination of the ideas in continuous optimization and combinatorial optimization. The framework of convex analysis is adapted to discrete settings and the mathematical results in matroid/submodular function theory are generalized. Viewed from th...

2005
S. Kravanja

This paper presents a structural synthesis using the Mixed-Integer Non-Linear Programming (MINLP) approach. The MINLP is a combined discrete/continuous optimization technique, where discrete binary 0-1 variables are defined for optimization of discrete alternatives and continuous variables for optimization of parameters. The MINLP optimization to a structural synthesis is performed through thre...

Journal: :Math. Program. 1997
Michael R. Bussieck Thomas Winter Uwe T. Zimmermann

Journal: :Informatica (Slovenia) 2012
Thomas Kämpke

The motion of water or the atmosphere that surrounds or supports a mobile platform affects the motion of the platform in a favorable or unfavorable way. Exploiting and compensating the ambient field is investigated for different motion objectives like the classical point to point motion, observation motion, exploration motion and so-called survival motion. Time and energy optimal trajectories i...

B. Dizangian, M. R. Ghasemi , M. Salar,

Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...

A. Adib , M. A. Samandizadeh,

Planning for supply water demands (drinkable and irrigation water demands) is a necessary problem. For this purpose, three subjects must be considered (optimization of water supply systems such as volume of reservoir dams, optimization of released water from reservoir and prediction of next droughts). For optimization of volume of reservoir dams, yield model is applied. Reliability of yield mod...

2000
James R. Swisher Sheldon H. Jacobson Paul D. Hyden

Discrete-event simulation optimization is a problem of significant interest to practitioners interested in extracting useful information about an actual (or yet to be designed) system that can be modeled using discrete-event simulation. This paper presents a brief survey of the literature on discrete-event simulation optimization over the past decade (1988 to the present). Swisher et al. (2000)...

2005
Stacy D. Hill

n optimization problem involves fi nding the best value of an objective function or fi gure of merit—the value that optimizes the function. If the set of options is fi nite in number, then the problem is discrete. If the value of the objective function is uncertain because of measurement noise or some other source of random variation, the problem is stochastic. Mathematically, the discrete opti...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید