Bounding and dominance approaches in improving the efficiency of branch and bound type solution to the 'SCLS' problems

Download
002852.pdf
1988
Demirli, Kudret
Show full item record
60
views
0
downloads
https://hdl.handle.net/11511/6307
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Bounding procedures on bi-directional labeling algorithm of tdvrptw in branch-and-cut-and-price framework
Kökten, Selen; İyigün, Cem; Woensel, Tom Van; Department of Industrial Engineering (2011)
In this thesis we consider a Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW) which is solved by a Branch and Cut and Price (BCP) algorithm. The decomposition of an arc based formulation leads to a set-partitioning problem as the master problem, and a Time-Dependent Elementary Shortest Path Problem with Resource Constraints (TDESPPRC) as the pricing problem. The main contribution of this thesis is the modified fathoming and bounding procedures applied on bi-directional Time-Dependent Label...
Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints
GEİL, Olav; Özbudak, Ferruh (2017-08-31)
We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in [12, Example 3.2]. Among the codes that we construct almost all have parameters as good as the best known codes according to [9] and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound [7,10] from Grobner basis theory and for this purpose we develop a new method where we inspired by Buchbergers algor...
Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems
Özpeynirci, Selin; Azizoğlu, Meral (Elsevier BV, 2009-9)
This study considers an operation assignment and capacity allocation problem that arises in flexible manufacturing systems. Automated machines are assumed to have scarce time and tool magazine capacities and the tools are available in limited quantities. The aim is to select a subset of operations with maximum total weight. The weight of an operation may represent its profit, processing load, relative priority. Several upper bounding procedures have been taken into account. The results of computational test...
Bound energy for the exponential-cosine-screened Coulomb potential
Ikhdair, Sameer M.; Sever, Ramazan (Springer Science and Business Media LLC, 2007-05-01)
An alternative approximation scheme has been used in solving the Schrodinger equation for the exponential-cosine-screened Coulomb potential. The bound state energies for various eigenstates and the corresponding wave functions are obtained analytically up to the second perturbation term.
Bound-states of a semi-relativistic equation for the PT-symmetric generalized Hulthen potential by the Nikiforov-Uvarov method
IKHDAİR, SAMEER; Sever, Ramazan (World Scientific Pub Co Pte Lt, 2008-06-01)
The one-dimensional semi-relativistic equation has been solved for the PT-symmetric generalized Hulthen potential. The Nikiforov-Uvarov (NU) method which is based on solving the second-order linear differential equations by reduction to a generalized equation of hypergeometric type, is used to obtain exact energy eigenvalues and corresponding eigenfunctions. We have investigated the positive and negative exact bound states of the s-states for different types of complex generalized Hulthen potentials.
Citation Formats
K. Demirli, “Bounding and dominance approaches in improving the efficiency of branch and bound type solution to the ‘SCLS’ problems,” Middle East Technical University, 1988.
METU IIS - Integrated Information Service open@metu.edu.tr