To see the other types of publications on this topic, follow the link: Branch and bound algorithm.

Books on the topic 'Branch and bound algorithm'

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

Select a source type:

Consult the top 27 books for your research on the topic 'Branch and bound algorithm.'

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.

Browse books on a wide variety of disciplines and organise your bibliography correctly.

1

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
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

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
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

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
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

Hajian, Mozafar Taghi. Design, implementation and testing of an integrated branch and bound algorithm for piecewise linear and discrete programming problems within an LP framework. Uxbridge: Brunel University, Department of Mathematics and Statistics, 1992.

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

Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997.

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

Automatic verification of sequential infinite-state processes. Berlin: Springer, 1997.

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

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

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

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
12

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
13

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
14

Eagle, James N. An optimal branch-and-bound procedure for the constrained path, moving target search problem. Monterey, Calif: Naval Postgraduate School, 1987.

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

Rocktäschel, Stefan. A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization. Springer, 2020.

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

Bolouri, Maryam. Network models with generalized upper bound side constraints. 1989.

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

Crainic, Teodor Gabriel, and Catherine Roucairol. Parallel Branch and Bound. John Wiley & Sons Inc, 2007.

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

Branch-and-Bound Applications in Combinatorial Data Analysis. New York: Springer-Verlag, 2005. http://dx.doi.org/10.1007/0-387-28810-4.

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

Network Interdiction by Lagrandian Relaxation and Branch-and-Bound. Storming Media, 2002.

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

Scholz, Daniel. Deterministic Global Optimization: Geometric Branch-and-bound Methods and their Applications. Springer, 2011.

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

Branch-and-Bound Applications in Combinatorial Data Analysis (Statistics and Computing). Springer New York, 2006.

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

Separable Optimierung Durch Innere-Punkte-Methoden: Ein Ansatz Auf Der Grundlage Des Branch-And-Bound Prinzips (Europaische Hochschulschriften). Peter Lang Publishing, 2002.

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

Gregory, Richard, Sir British Science Guild. A catalogue of British scientific and technical books, covering every branch of science and technology carefully classified and indexed 1921 [Leather Bound]. Generic, 2019.

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

Robert F, Williams. Part III Structure of State Government, 10 The State Judicial Branch. Oxford University Press, 2009. http://dx.doi.org/10.1093/acprof:oso/9780195343083.003.0010.

Full text
Abstract:
This chapter discusses the differences between the federal and state judiciary. Many state judges are elected through a variety of mechanisms. The workload of state supreme courts has evolved over the years from a private-law orientation to more constitutional law and public policy kinds of cases. In addition, state courts exercise a number of nonadjudicatory powers such as rulemaking on practice and procedure before the courts and regulation of lawyers. Some state courts have the authority to issue advisory opinions and answer certified questions, and some of them have asserted certain inherent powers such as to require adequate funding levels. State courts also retain the power to develop common law doctrine, as well as to resolve disputes among state and local government officials and agencies in ways that rarely involve the federal judiciary. State courts are also not bound by the rigid federal doctrines of standing, mootness, and ripeness.
APA, Harvard, Vancouver, ISO, and other styles
25

Compston, Alastair. A short history of clinical neurology. Oxford University Press, 2011. http://dx.doi.org/10.1093/med/9780198569381.003.0014.

Full text
Abstract:
More than any other branch of medicine, the practice of neurology depends on the classical methods of intuitive conversation, structured examination, and selective investigation. We teach the importance of eliciting an accurate neurological history. The key symptoms at onset are identified and their subsequent course defined. For the experienced clinician, this process becomes routine, efficient, and quick. The competent neurologist is the one who instinctively senses relevant components of the history, appreciates the most likely underlying disease mechanisms, reliably elicits the relevant physical signs, knows which investigations are necessary and assesses their relevance in the clinical context, provides a sensible clinical formulation, and communicates the situation accurately and sensitively to the patient and relatives. Rather than slavishly collecting an encyclopaedia of facts, in which the key issues may be lost in a surfeit of redundant information, the critical components are sifted and the subsequent conversation steered down an algorithm that seeks anatomical, physiological, and pathological explanations for what the patient describes.
APA, Harvard, Vancouver, ISO, and other styles
26

Davidson, Donald. The Perils and Pleasures of Interpretation. Edited by Ernest Lepore and Barry C. Smith. Oxford University Press, 2009. http://dx.doi.org/10.1093/oxfordhb/9780199552238.003.0041.

Full text
Abstract:
There is a contrast between the difficulties that stand in the way of explaining in detail how we manage to find out what is in other people's minds and the relative ease with which we do it in practice. The first part of the article explores the obstacles that thwart theory, the second part describes features of our minds that work in our favor when it comes to practice. At the end it is suggested that the project of fully naturalizing our understanding of other minds — a project philosophers are bound to find enticing — is doomed. We understand others, but we cannot reduce this understanding to a branch of the natural sciences.
APA, Harvard, Vancouver, ISO, and other styles
27

Koenderink, Jan. Visual Illusions? Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780199794607.003.0008.

Full text
Abstract:
The very definition of “illusion” is elusive. Various distinct ontologies are considered. The concept is tightly bound to the understanding of reality, awareness, “God’s eye,” objectivity, subjectivity, emphatic relations, and several others. Here the distinctions between “illusion,” “ambiguity, “delusion,” and “deception,” are clarified. The very notion of illusion is closely tied to conceptual approaches to mind. Especially the dichotomy between a top-down “controlled hallucination” and a bottom-up “inverse physics” approach accounts for much confusion in the literature. It is suggested that a thoroughly biological approach might be preferable. In such an approach, experimental psychobiology would be a special sub-branch—devoted to the genus homo—of ethology. Does this help to impose a formal structure, such as a partial order, on the zoo of illusions as we know them? Unfortunately, not really. At this moment in history, we are still far from such a reasoned inventory.
APA, Harvard, Vancouver, ISO, and other styles
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