Optimization Methods for Solving Problems of Transcomputational Complexity

Сергиенко, И. В.

doi:10.1007/978-1-4939-0476-1_6

Search citation statements

Order By: Relevance

Paper Sections

Select...

Classification Of Problems and Selection Of The Solution Met...1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem (1) -( 4) is an integer linear programming problem and can be solved using Gomory cutting plane methods as well as combinatorial approaches such as the branch-and-bound method. If the problem is augmented with the conditions (5) it can be classified as a linear function minimization problem with nonlinear constraints, which can be solved using discrete optimization methods involving penalty functions, or with heuristic algorithms (approaches) [3,4].…”

Section: Classification Of Problems and Selection Of The Solution Met...mentioning

confidence: 99%

On Mathematical Models of Some Optimization Problems Arising in the Production of Autoclaved Aerated Concrete

Koriashkina

Saveliev

Zhelo³

2017

AEF

View full text Add to dashboard Cite

A mathematical model of an optimization problem to define a short-term (one month) production plan which implements the best use of the production capacity with the condition of meeting the demand is proposed. Long-term planning of autoclaved production (up to six months) with the account of the dynamics of demand and possible residual products in stock are also considered. The results of computational experiments are presented.

show abstract

Section: Classification Of Problems and Selection Of The Solution Met...mentioning

confidence: 99%