Relevant bibliographies by topics / Method of «branch and bound»

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Method of «branch and bound»'

Author: Grafiati
Published: 30 May 2022
Last updated: 31 May 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Method of «branch and bound».'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Method of «branch and bound»"

1

Kahribt, Tahani Jabbar, and Mohammed Kadhim Al- Zuwaini. "Branch and Bound Method to Solve Multi Objectives Function." JOURNAL OF ADVANCES IN MATHEMATICS 12, no. 3 (April 27, 2016): 5964–74. http://dx.doi.org/10.24297/jam.v12i3.494.

Full text
Abstract:
This paper presents a branch and bound algorithm for sequencing a set of n independent jobs on a single machine to minimize sum of the discounted total weighted completion time and maximum lateness, this problems is NP-hard. Two lower bounds were proposed and heuristic method to get an upper bound. Some special cases were proved and some dominance rules were suggested and proved, the problem solved with up to 50 jobs.
APA, Harvard, Vancouver, ISO, and other styles
2

Rácz, Attila. "Determining Initial Bound by "Ray-method" in Branch and Bound Procedure." Acta Cybernetica 19, no. 1 (2009): 135–46. http://dx.doi.org/10.14232/actacyb.19.1.2009.9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kondoh, Hitoshi, Fuminori Kobayashi, Shinji Hara, and Nobuo Takehira. "Parallel Branch and Bound Method Using Systematic Shuffling." IEEJ Transactions on Electronics, Information and Systems 113, no. 3 (1993): 211–18. http://dx.doi.org/10.1541/ieejeiss1987.113.3_211.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tseng, C. H., L. W. Wang, and S. F. Ling. "Enhancing Branch-and-Bound Method for Structural Optimization." Journal of Structural Engineering 121, no. 5 (May 1995): 831–37. http://dx.doi.org/10.1061/(asce)0733-9445(1995)121:5(831).

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tarray, Tanveer Ahmad, and Muzafar Rasool Bhat. "New Mathematical Strategy Using Branch and Bound Method." Journal of Multiscale Modelling 08, no. 02 (May 4, 2017): 1750005. http://dx.doi.org/10.1142/s1756973717500056.

Full text
Abstract:
In this paper, the problem of optimal allocation in stratified random sampling is used in the presence of nonresponse. The problem is formulated as a nonlinear programming problem (NLPP) and is solved using Branch and Bound method. Also the results are formulated through LINGO.
APA, Harvard, Vancouver, ISO, and other styles
6

Belyi, B. M. "Branch-and-bound method for inherited choice functions." Cybernetics 22, no. 5 (1987): 658–63. http://dx.doi.org/10.1007/bf01068363.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kariwala, Vinay, and Yi Cao. "Branch and bound method for multiobjective pairing selection." Automatica 46, no. 5 (May 2010): 932–36. http://dx.doi.org/10.1016/j.automatica.2010.02.014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wu, Shiquan. "A branch bound method for subset sum problem." Acta Mathematicae Applicatae Sinica 10, no. 3 (July 1994): 302–14. http://dx.doi.org/10.1007/bf02006860.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Onishi, Katsumi, Hiroyuki Ebara, and Hideo Nakano. "Effect of the selection of branch variables in parallel branch and bound method." Electronics and Communications in Japan (Part II: Electronics) 89, no. 1 (2005): 53–62. http://dx.doi.org/10.1002/ecjb.20244.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kariwala, Vinay, and Yi Cao. "Bidirectional Branch and Bound Method for Selecting Controlled Variables." IFAC Proceedings Volumes 42, no. 11 (2009): 625–30. http://dx.doi.org/10.3182/20090712-4-tr-2008.00101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Method of «branch and bound»"

1

Stix, Volker. "Stochastic branch & bound applying target oriented branch & bound method to optimal scenario tree reduction." Institut für Informationsverarbeitung und Informationswirtschaft, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/1212/1/document.pdf.

Full text
Abstract:
In this article a new branch & bound method is described. It uses an artificial target to improve its bounding capabilities. Therefore the new approach is faster compared to the classical one. It is applied to the stochastic problem of optimal scenario tree reduction. The aspects of global optimization are emphasized here. All necessary components for that problem are developed and some experimental results underline the benefits of the new approach. (author's abstract)
Series: Working Papers on Information Systems, Information Business and Operations
APA, Harvard, Vancouver, ISO, and other styles
2

Stix, Volker. "Target oriented branch & bound method for global optimization." Institut für Informationsverarbeitung und Informationswirtschaft, WU Vienna University of Economics and Business, 2002. http://epub.wu.ac.at/1696/1/document.pdf.

Full text
Abstract:
We introduce a very simple but efficient idea for branch & bound (B&B) algorithms in global optimization (GO). As input for our generic algorithm, we need an upper bound algorithm for the GO maximization problem and a branching rule. The latter reduces the problem into several smaller subproblems of the same type. The new B&B approach delivers one global optimizer or, if stopped before finished, improved upper and lower bounds for the problem. Its main difference to commonly used B&B techniques is its ability to approximate the problem from above and from below while traversing the problem tree. It needs no supplementary information about the system optimized and does not consume more time than classical B&B techniques. Experimental results with the maximum clique problem illustrate the benefit of this new method. (author's abstract)
Series: Working Papers on Information Systems, Information Business and Operations
APA, Harvard, Vancouver, ISO, and other styles
3

Ryoo, Moo Bong. "A constraint branch-and-bound method for set partitioning problems." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA227092.

Full text
Abstract:
Thesis (M.S. in Operations Research)--Naval Postgraduate School, March 1990.
Thesis Advisor(s): Wood, R. Kevin. Second Reader: Brown, Gerald Gerard. "March 1990." Description based on signature page as viewed on October 21, 2009. Author(s) subject terms: Set partitioning problem, constraint branch and bound method, enumeration tree. Includes bibliographical references (p. 34-36). Also available online.
APA, Harvard, Vancouver, ISO, and other styles
4

Hu, Sha S. M. Massachusetts Institute of Technology. "Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/39217.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2006.
Includes bibliographical references (leaves 73-75).
In this thesis, we use a semidefinite relaxation based branch-and-bound method to solve nonconvex quadratic programming problems. Firstly, we show an interval branch-and-bound method to calculate the bounds for the minimum of bounded polynomials. Then we demonstrate four SDP relaxation methods to solve nonconvex Box constrained Quadratic Programming (BoxQP) problems and the comparison of the four methods. For some lower dimensional problems, SDP relaxation methods can achieve tight bounds for the BoxQP problem; whereas for higher dimensional cases (more than 20 dimensions), the bounds achieved by the four Semidefinite programming (SDP) relaxation methods are always loose. To achieve tight bounds for higher dimensional BoxQP problems, we combine the branch-and-bound method and SDP relaxation method to develop an SDP relaxation based branch-and-bound (SDPBB) method. We introduce a sensitivity analysis method for the branching process of SDPBB. This sensitivity analysis method can improve the convergence speed significantly.
(cont.) Compared to the interval branch-and-bound method and the global optimization software BARON, SDPBB can achieve better bounds and is also much more efficient. Additionally, we have developed a multisection algorithm for SDPBB and the multisection algorithm has been parallelized using Message Passing Interface (MPI). By parallelizing the program, we can significantly improve the speed of solving higher dimensional BoxQP problems.
by Sha Hu.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
5

Mutlu, Mustafa Cagdas. "A Branch And Bound Algorithm For Resource Leveling Problem." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612259/index.pdf.

Full text
Abstract:
Resource Leveling Problem (RLP) aims to minimize undesired fluctuations in resource distribution curves which cause several practical problems. Many studies conclude that commercial project management software packages can not effectively deal with RLP. In this study a branch and bound algorithm is presented for solving RLP for single and multi resource, small size networks. The algorithm adopts a depth-first strategy and stores start times of non-critical activities in the nodes of the search tree. Optimal resource distributions for 4 different types of resource leveling metrics can be obtained via the developed procedure. To prune more of the search tree and thereby reduce the computation time, several lower bound calculation methods are employed. Experiment results from 20 problems showed that the suggested algorithm can successfully locate optimal solutions for networks with up to 20 activities. The algorithm presented in this study contributes to the literature in two points. First, the new lower bound improvement method (maximum allowable daily resources method) introduced in this study reduces computation time required for achieving the optimal solution for the RLP. Second, optimal solutions of several small sized problems have been obtained by the algorithm for some traditional and recently suggested leveling metrics. Among these metrics, Resource Idle Day (RID) has been utilized in an exact method for the first time. All these solutions may form a basis for performance evaluation of heuristic and metaheuristic procedures for the RLP. Limitations of the developed branch and bound procedure are discussed and possible further improvements are suggested.
APA, Harvard, Vancouver, ISO, and other styles
6

Poliquit, Elmer S. "A method for solving the minimization of the maximum number of open stacks problem within a cutting process." View electronic thesis, 2008. http://dl.uncw.edu/etd/2008-1/r1/poliquite/elmerpoliquit.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ku, Wen-Yang. "Lattice preconditioning for the real relaxation based branch and bound method for integer least squares problems." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=106555.

Full text
Abstract:
Lattice basis reduction is a powerful tool for solving complex problems both in pure mathematics and practical applications. In this thesis, we use lattice basis reduction as a preconditioning technique to accelerate the real relaxation based branch and bound (RRBB) method for solving integer least squares (ILS) problems. We give theoretical arguments and simulation results to show that applying lattice preconditioning to the RRBB method can greatly reduce the size of the RRBB tree for ordinary ILS problems, making the method more efficient. We then propose new reduction strategies, which are more effective than some typical existing reduction strategies for lattice preconditioning. Finally we extend the preconditioning techniques to the RRBB method for box-constrained and more general linear-inequality constrained ILS problems. Numerical test results indicate lattice preconditioning is also very effective to reduce the computation time of the RRBB method for these constrained problems.
Les techniques de réduction de réseaux est un outil puissant pour résoudre des problèmes complexes tant en mathématiques pures et les applications pratiques. Dans cette thèse, nous utilisons reduction de réseaux comme une technique de préconditionnement pour accélérer la branche réelle détente et de base lié (RRBB) méthode pour résoudre les problèmes de moindres carrés en nombres entiers (ILS). Nous donnons des arguments théoriques et des résultats de simulation pour montrerque l'application de treillis de préconditionnement de la méthode RRBB peut réduire considérablement la taille de l'arbre RRBB pour des problèmes ILS ordinaires, cequi rend la méthode plus efficace. Nous proposons ensuite de nouvelles stratégies de réduction, qui sont plus efficaces que certaines stratégies de réduction de type existants pour le préconditionnement treillis. Enfin nous étendons les techniques de préconditionnement de la méthode RRBB pour la contrainte des boîtes et des contraintes linéaires-inégalité plus générales des problémes ILS. Les résultats des simulations numériques indiquent que le préconditionnement treillis est également très efficace pour réduire le temps de calcul de la méthode RRBB pour ces problèmes contraints.
APA, Harvard, Vancouver, ISO, and other styles
8

Morén, Björn. "Utilizing problem specic structures in branch and bound methods for manpower planning." Thesis, Linköpings universitet, Optimeringslära, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-84327.

Full text
Abstract:
This thesis is about solving the manpower planning problem concerning stangand transitioning of pilots. The objective of the planning is to have enoughpilots to satisfy the demand while minimizing the cost. The main decisions totake are how many pilots to hire, which pilots to train and which courses toschedule. The planning problems that arise are both large and dicult whichmakes it important to use ecient solution methods. Seniority rules betweenpairs of pilots are the most complicating factor.A major part in the solution process is the solving of mixed integer programs.The emphasis in the thesis is to develop and test adaptations of the branch andbound algorithm to solve mixed integer programs faster. One of these is abranching principle that takes a problem specic structure into account. Agraph of implications is constructed from the seniority rules and this graph isthen used to estimate the impact of each branching candidate. The implementedmethods outperform the software XPRESS on some instances, while for mostinstances the performance is comparable.
APA, Harvard, Vancouver, ISO, and other styles
9

Hailer, Angelika Christina. "Verification of branch and bound algorithms applied to water distribution network design." Berlin Logos-Verl, 2006. http://deposit.d-nb.de/cgi-bin/dokserv?id=2844475&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bischoff, Martin. "Location of connection facilities /." Aachen : Shaker, 2008. http://d-nb.info/988141434/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Method of «branch and bound»"

1

Turpin, Heather Jane. The branch-and-bound paradigm. Norwich: University of East Anglia, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Moursli, Omar. Scheduling the hybrid flowshop: Branch and bound algorithms. Louvain-la-Neuve: CIACO, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Brusco, Michael. Branch-and-bound applications in combinatorial data analysis. New York, NY: Springer, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Stephanie, Stahl, ed. Branch-and-bound applications in combinatorial data analysis. New York: Springer, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kedia, Pradeep. Optimal solution of set covering problems using dual heuristics. West Lafayette, Ind: Institute for Research in the Behavioral, Economic, and Management Sciences, Krannert Graduate School of Management, Purdue University, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Xinghao. Efficient Branch and Bound Search with Application to Computer-Aided Design. Boston, MA: Springer US, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rush, S. A. Implementation of parallel branch-and-bound on a network of transputers. Norwich: University of East Anglia, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

1950-, Bushnell Michael L., ed. Efficient branch and bound search with application to computer-aided design. Boston: Kluwer Academic Publishers, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Xinghao, and Michael L. Bushnell. Efficient Branch and Bound Search with Application to Computer-Aided Design. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1329-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rocktäschel, Stefan. A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization. Wiesbaden: Springer Fachmedien Wiesbaden, 2020. http://dx.doi.org/10.1007/978-3-658-29149-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Method of «branch and bound»"

1

Thoft-Christensen, Palle, and Yoshisada Murotsu. "The Branch-and-Bound Method." In Application of Structural Systems Reliability Theory, 215–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-82764-8_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Martí, Rafael, and Gerhard Reinelt. "Branch-and-Bound." In Exact and Heuristic Methods in Combinatorial Optimization, 125–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2022. http://dx.doi.org/10.1007/978-3-662-64877-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Domínguez-Marín, Patricia. "A Specific Branch-and-Bound Method." In The Discrete Ordered Median Problem, 71–89. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4419-8511-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Charon, Irène, and Olivier Hudry. "Branch-and-Bound Methods." In Concepts of Combinatorial Optimization, 39–69. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118600245.ch3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Walukiewicz, Stanisław. "Branch-and-Bound Methods." In Integer Programming, 79–89. Dordrecht: Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-015-7945-2_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Eiselt, H. A., and C. L. Sandblom. "Branch and Bound Methods." In Integer Programming and Network Models, 205–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-04197-0_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Charon, Iréne, and Olivier Hudry. "Branch-and-Bound Methods." In Concepts of Combinatorial Optimization, 39–69. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2014. http://dx.doi.org/10.1002/9781119005216.ch3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Großmann, Christian, and Johannes Terno. "Die Methode branch and bound." In Numerik der Optimierung, 283–96. Wiesbaden: Vieweg+Teubner Verlag, 1993. http://dx.doi.org/10.1007/978-3-322-93110-8_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kubica, Bartłomiej Jacek. "Branch-and-Bound-Type Methods." In Interval Methods for Solving Nonlinear Constraint Satisfaction, Optimization and Similar Problems, 27–45. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-13795-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dudek-Dyduch, Ewa. "Optimization of Discrete Manufacturing Processes — Branch and Bound Method." In Operations Research ’91, 19–22. Heidelberg: Physica-Verlag HD, 1992. http://dx.doi.org/10.1007/978-3-642-48417-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Method of «branch and bound»"

1

Posypkin, Mikhail, and Nikolay Khrapov. "Branch and bound method on desktop grid systems." In 2017 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus). IEEE, 2017. http://dx.doi.org/10.1109/eiconrus.2017.7910607.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Todoroki, Akira, and Yuichiro Terada. "Stacking Sequence Optimizations Using Fractal Branch and Bound Method." In 43rd AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2002. http://dx.doi.org/10.2514/6.2002-1298.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kariwala, Vinay, and Yi Cao. "Branch and bound method for multiobjective control structure design." In 2009 4th IEEE Conference on Industrial Electronics and Applications (ICIEA). IEEE, 2009. http://dx.doi.org/10.1109/iciea.2009.5138660.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Utsumi, Yuzuko, Yuta Matsumoto, and Yoshio Iwai. "An efficient branch and bound method for face recognition." In 2009 IEEE International Conference on Signal and Image Processing Applications. IEEE, 2009. http://dx.doi.org/10.1109/icsipa.2009.5478626.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kariwala, Vinay, Lingjian Ye, and Yi Cao. "Branch and bound method for globally optimal controlled variable selection." In 2012 UKACC International Conference on Control (CONTROL). IEEE, 2012. http://dx.doi.org/10.1109/control.2012.6334620.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

"Complexity Based Load Balancing for Distributed Branch and Bound Method." In 2015 The 5th International Workshop on Computer Science and Engineering-Information Processing and Control Engineering. WCSE, 2015. http://dx.doi.org/10.18178/wcse.2015.04.020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Strachacki, Marek. "Speedup of branch and bound method for hardware/software partitioning." In 2008 1st International Conference on Information Technology (IT 2008). IEEE, 2008. http://dx.doi.org/10.1109/inftech.2008.4621608.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Smith, Andrew P., Luis G. Crespo, Cesar A. Munoz, and Mark H. Lowenberg. "Bifurcation analysis using rigorous branch and bound methods." In 2014 IEEE Conference on Control Applications (CCA). IEEE, 2014. http://dx.doi.org/10.1109/cca.2014.6981612.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lalami, Mohamed Esseghir, and Didier El-Baz. "GPU Implementation of the Branch and Bound Method for Knapsack Problems." In 2012 26th IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2012. http://dx.doi.org/10.1109/ipdpsw.2012.219.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Miklos, Poth, and Galfi Csongor. "Discrete tomographic reconstruction of binary matrices using branch and bound method." In 2009 7th International Symposium on Intelligent Systems and Informatics (SISY). IEEE, 2009. http://dx.doi.org/10.1109/sisy.2009.5291191.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Method of «branch and bound»"

1

Washburn, Alan R. Branch and Bound Methods for Search Problems. Fort Belvoir, VA: Defense Technical Information Center, April 1995. http://dx.doi.org/10.21236/ada294522.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Subrahmanian, V. S., Dana Nau, and C. Vago. WFS + Branch and Bound = Stable Models. Fort Belvoir, VA: Defense Technical Information Center, January 1992. http://dx.doi.org/10.21236/ada455012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

ECKSTEIN, JONATHAN, WILLIAM E. HART, and CYNTHIA A. PHILLIPS. PICO: An Object-Oriented Framework for Branch and Bound. Office of Scientific and Technical Information (OSTI), December 2000. http://dx.doi.org/10.2172/771506.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Balas, Egon, and Maria C. Carrera. A Dynamic Subgradient-Based Branch and Bound Procedure for Set Covering. Revision,. Fort Belvoir, VA: Defense Technical Information Center, May 1992. http://dx.doi.org/10.21236/ada257416.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Trienekens, Harry W. Parallel Branch and Bound on an MIMD (Multiple Instruction Stream, Multiple Data Stream) System. Fort Belvoir, VA: Defense Technical Information Center, February 1987. http://dx.doi.org/10.21236/ada178816.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Miller, D. L., J. F. Pekny, and G. L. Thompson. An Exact Two-Matching Based Branch and Bound Algorithm for the Symmetric Traveling Salesman Problem. Fort Belvoir, VA: Defense Technical Information Center, February 1991. http://dx.doi.org/10.21236/ada237878.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hartland, Tucker, Cosmin Petra, Noemi Petra, and Jingyi Wang. Bound Constrained Partial DifferentialEquation Inverse Problem Solution by theSemi-Smooth Newton Method. Office of Scientific and Technical Information (OSTI), February 2021. http://dx.doi.org/10.2172/1765792.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Derbentsev, V., A. Ganchuk, and Володимир Миколайович Соловйов. Cross correlations and multifractal properties of Ukraine stock market. Politecnico di Torino, 2006. http://dx.doi.org/10.31812/0564/1117.

Full text
Abstract:
Recently the statistical characterizations of financial markets based on physics concepts and methods attract considerable attentions. The correlation matrix formalism and concept of multifractality are used to study temporal aspects of the Ukraine Stock Market evolution. Random matrix theory (RMT) is carried out using daily returns of 431 stocks extracted from database time series of prices the First Stock Trade System index (www.kinto.com) for the ten-year period 1997-2006. We find that a majority of the eigenvalues of C fall within the RMT bounds for the eigenvalues of random correlation matrices. We test the eigenvalues of C within the RMT bound for universal properties of random matrices and find good agreement with the results for the Gaussian orthogonal ensemble of random matrices—implying a large degree of randomness in the measured cross-correlation coefficients. Further, we find that the distribution of eigenvector components for the eigenvectors corresponding to the eigenvalues outside the RMT bound display systematic deviations from the RMT prediction. We analyze the components of the deviating eigenvectors and find that the largest eigenvalue corresponds to an influence common to all stocks. Our analysis of the remaining deviating eigenvectors shows distinct groups, whose identities correspond to conventionally identified business sectors. Comparison with the Mantegna minimum spanning trees method gives a satisfactory consent. The found out the pseudoeffects related to the artificial unchanging areas of price series come into question We used two possible procedures of analyzing multifractal properties of a time series. The first one uses the continuous wavelet transform and extracts scaling exponents from the wavelet transform amplitudes over all scales. The second method is the multifractal version of the detrended fluctuation analysis method (MF-DFA). The multifractality of a time series we analysed by means of the difference of values singularity stregth (or Holder exponent) ®max and ®min as a suitable way to characterise multifractality. Singularity spectrum calculated from daily returns using a sliding 250 day time window in discrete steps of 1. . . 10 days. We discovered that changes in the multifractal spectrum display distinctive pattern around significant “drawdowns”. Finally, we discuss applications to the construction of crushes precursors at the financial markets.
APA, Harvard, Vancouver, ISO, and other styles
9

Bano, Masooda, and Zeena Oberoi. Embedding Innovation in State Systems: Lessons from Pratham in India. Research on Improving Systems of Education (RISE), December 2020. http://dx.doi.org/10.35489/bsg-rise-wp_2020/058.

Full text
Abstract:
The learning crisis in many developing countries has led to searches for innovative teaching models. Adoption of innovation, however, disrupts routine and breaks institutional inertia, requiring government employees to change their way of working. Introducing and embedding innovative methods for improving learning outcomes within state institutions is thus a major challenge. For NGO-led innovation to have largescale impact, we need to understand: (1) what factors facilitate its adoption by senior bureaucracy and political elites; and (2) how to incentivise district-level field staff and school principals and teachers, who have to change their ways of working, to implement the innovation? This paper presents an ethnographic study of Pratham, one of the most influential NGOs in the domain of education in India today, which has attracted growing attention for introducing an innovative teaching methodology— Teaching at the Right Level (TaRL) – with evidence of improved learning outcomes among primary-school students and adoption by a number of states in India. The case study suggests that while a combination of factors, including evidence of success, ease of method, the presence of a committed bureaucrat, and political opportunity are key to state adoption of an innovation, exposure to ground realities, hand holding and confidence building, informal interactions, provision of new teaching resources, and using existing lines of communication are core to ensuring the co-operation of those responsible for actual implementation. The Pratham case, however, also confirms existing concerns that even when NGO-led innovations are successfully implemented at a large scale, their replication across the state and their sustainability remain a challenge. Embedding good practice takes time; the political commitment leading to adoption of an innovation is often, however, tied to an immediate political opportunity being exploited by the political elites. Thus, when political opportunity rather than a genuine political will creates space for adoption of an innovation, state support for that innovation fades away before the new ways of working can replace the old habits. In contexts where states lack political will to improve learning outcomes, NGOs can only hope to make systematic change in state systems if, as in the case of Pratham, they operate as semi-social movements with large cadres of volunteers. The network of volunteers enables them to slow down and pick up again in response to changing political contexts, instead of quitting when state actors withdraw. Involving the community itself does not automatically lead to greater political accountability. Time-bound donor-funded NGO projects aiming to introduce innovation, however large in scale, simply cannot succeed in bringing about systematic change, because embedding change in state institutions lacking political will requires years of sustained engagement.
APA, Harvard, Vancouver, ISO, and other styles
10

Friedman, Shmuel, Jon Wraith, and Dani Or. Geometrical Considerations and Interfacial Processes Affecting Electromagnetic Measurement of Soil Water Content by TDR and Remote Sensing Methods. United States Department of Agriculture, 2002. http://dx.doi.org/10.32747/2002.7580679.bard.

Full text
Abstract:
Time Domain Reflectometry (TDR) and other in-situ and remote sensing dielectric methods for determining the soil water content had become standard in both research and practice in the last two decades. Limitations of existing dielectric methods in some soils, and introduction of new agricultural measurement devices or approaches based on soil dielectric properties mandate improved understanding of the relationship between the measured effective permittivity (dielectric constant) and the soil water content. Mounting evidence indicates that consideration must be given not only to the volume fractions of soil constituents, as most mixing models assume, but also to soil attributes and ambient temperature in order to reduce errors in interpreting measured effective permittivities. The major objective of the present research project was to investigate the effects of the soil geometrical attributes and interfacial processes (bound water) on the effective permittivity of the soil, and to develop a theoretical frame for improved, soil-specific effective permittivity- water content calibration curves, which are based on easily attainable soil properties. After initializing the experimental investigation of the effective permittivity - water content relationship, we realized that the first step for water content determination by the Time Domain Reflectometry (TDR) method, namely, the TDR measurement of the soil effective permittivity still requires standardization and improvement, and we also made more efforts than originally planned towards this objective. The findings of the BARD project, related to these two consequential steps involved in TDR measurement of the soil water content, are expected to improve the accuracy of soil water content determination by existing in-situ and remote sensing dielectric methods and to help evaluate new water content sensors based on soil electrical properties. A more precise water content determination is expected to result in reduced irrigation levels, a matter which is beneficial first to American and Israeli farmers, and also to hydrologists and environmentalists dealing with production and assessment of contamination hazards of this progressively more precious natural resource. The improved understanding of the way the soil geometrical attributes affect its effective permittivity is expected to contribute to our understanding and predicting capability of other, related soil transport properties such as electrical and thermal conductivity, and diffusion coefficients of solutes and gas molecules. In addition, to the originally planned research activities we also investigated other related problems and made many contributions of short and longer terms benefits. These efforts include: Developing a method and a special TDR probe for using TDR systems to determine also the soil's matric potential; Developing a methodology for utilizing the thermodielectric effect, namely, the variation of the soil's effective permittivity with temperature, to evaluate its specific surface area; Developing a simple method for characterizing particle shape by measuring the repose angle of a granular material avalanching in water; Measurements and characterization of the pore scale, saturation degree - dependent anisotropy factor for electrical and hydraulic conductivities; Studying the dielectric properties of cereal grains towards improved determination of their water content. A reliable evaluation of the soil textural attributes (e.g. the specific surface area mentioned above) and its water content is essential for intensive irrigation and fertilization processes and within extensive precision agriculture management. The findings of the present research project are expected to improve the determination of cereal grain water content by on-line dielectric methods. A precise evaluation of grain water content is essential for pricing and evaluation of drying-before-storage requirements, issues involving energy savings and commercial aspects of major economic importance to the American agriculture. The results and methodologies developed within the above mentioned side studies are expected to be beneficial to also other industrial and environmental practices requiring the water content determination and characterization of granular materials.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Method of «branch and bound»' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography