Log in

Relevant bibliographies by topics / Méthode branch and bound / Books

To see the other types of publications on this topic, follow the link: Méthode branch and bound.

Books on the topic 'Méthode branch and bound'

Author: Grafiati

Published: 4 June 2021

Last updated: 4 February 2022

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

Select a source type:

Consult the top 26 books for your research on the topic 'Méthode 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.

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

1

Turpin, Heather Jane. The branch-and-bound paradigm. 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. CIACO, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Brusco, Michael. Branch-and-bound applications in combinatorial data analysis. Springer, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kedia, Pradeep. Optimal solution of set covering problems using dual heuristics. 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. 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. 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. 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. 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. Springer Fachmedien Wiesbaden, 2020. http://dx.doi.org/10.1007/978-3-658-29149-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

12

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. Brunel University, Department of Mathematics and Statistics, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

13

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

14

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

15

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

16

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

18

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

19

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

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 inhere

APA, Harvard, Vancouver, ISO, and other styles

25

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

APA, Harvard, Vancouver, ISO, and other styles

26

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

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!