Results 41 to 50 of about 328,146 (173)
Cutting plane methods for general integer programming [PDF]
, 1993 Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on them. A technique for solving these problems is the cutting plane method.
Darby-Dowman, K, Hamid, FA, Mitra, G
core
Measuring Inaccessible Residual Stresses Using Multiple Methods and Superposition [PDF]
, 2011 The traditional contour method maps a single component of residual stress by cutting a body carefully in two and measuring the contour of the cut surface. The cut also exposes previously inaccessible regions of the body to residual stress measurement
Clausen,B +6 more
core +1 more source
Direct method of hierarchical nonlinear optimization - reassessment after 30 years
Journal of Telecommunications and Information Technology, 2004 We consider the optimization problems which may be solved by the direct decomposition method. It is possible when the performance index is a monotone function of other performance indices, which depend on two subsets of decision variables: an individual
Andrzej Karbowski
doaj +1 more source
PENERAPAN BRANCH AND BOUND ALGORITHM DALAM OPTIMALISASI PRODUKSI ROTI
E-Jurnal Matematika, 2016 Companies which engaged in production activities such as Ramadhan Bakery would want optimal profit in their every production. The aim of this study was to find optimal profit and optimal combination of bread production (original chocolate bread, extra ...
GEDE SURYAWAN +2 more
doaj +1 more source
Finding an optimal seating arrangement for employees
Croatian Operational Research Review, 2015 The paper deals with modelling a specifc problem called the Optimal Seating Arrangement (OSA) as an Integer Linear Program and demonstrated that the problem can be efficiently solved by combining branch-and-bound and cutting plane methods.
Ninoslav Čerkez +3 more
doaj +1 more source
Stabilized Benders methods for large-scale combinatorial optimization, with appllication to data privacy [PDF]
, 2017 The Cell Suppression Problem (CSP) is a challenging Mixed-Integer Linear Problem arising in statistical tabular data protection. Medium sized instances of CSP involve thousands of binary variables and million of continuous variables and constraints ...
Baena, Daniel +2 more
core +1 more source
Cutting-plane theory: Algebraic methods
Discrete Mathematics, 1978 AbstractThis paper is a survey, with new results, of the algebraic approach to cutting-planes. The new results are a subadditive dual program for integer programs, and a generalization of R. Gomory's linear inequality characterization of the cuts valid for the group problem.
openaire +1 more source
Cutting-plane methods witout nested approximating sets
, 2023 In connection with the needs of solving optimization problems, the development of conditional minimization methods with convenient numerical implementation continues to attract the attention of mathematicians. In this monograph we propose methods for solving mathematical programming problems that belong to the class of cutting methods.
Zabotin, Igor, Yarullin, Rashid
openaire +2 more sources
Известия Иркутского государственного университета: Серия "Математика", 2015 In this paper it is considered the modified simplex imbeddings method, which is related to the class of cutting plane methods. The main feature of this method is the convergence estimation, which depends only on the quantity of simplex vertices, that are
A.V. Kolosnitcyn
doaj
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2016 Wavelength division multiplexing (WDM) technology transmits multiple optical communication channels in an optical fiber. Routing and wavelength assignment (RWA) problems on WDM network have widely attracted interest of many researchers.
Yosuke WATANABE +6 more
doaj +1 more source