linear combinatorial programming (29 résultats)

Hardcover. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 0.85.

Etat : Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1250grams, ISBN:0471573701.

Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Sq 672 471573701 Sprache: Englisch Gewicht in Gramm: 550.

Hardcover. Etat : Very Good. 1st Edition. harback book in very good condition.

Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Hardcover. Etat : UsedGood. Hardcover; surplus library copy with the usual stampings; reference number taped to spine; fading and edge wear to exterior; otherwise in good condition with clean text, firm binding.

paperback. Etat : Very Good. Fast Shipping - Safe and Secure 7 days a week!

Etat : Used. pp. 220.

Paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!

Etat : Used. pp. 220.

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : As New. Unread book in perfect condition.

Etat : Used. pp. 220.

Etat : New.

Etat : New. In.

Etat : New.

Etat : New.

Hardback. Etat : New. Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering.Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes 'P' (polynomial time) and 'NP' (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs).On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general.

Etat : As New. Unread book in perfect condition.

Hardback. Etat : New. Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering.Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes 'P' (polynomial time) and 'NP' (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs).On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general.

hardcover. Etat : New. In shrink wrap. Looks like an interesting title!

Hardcover. Etat : Brand New. 220 pages. 9.00x6.00x0.75 inches. In Stock.

Etat : New.

hardcover. Etat : Good. Good. book.

Etat : new.

Hardcover. Etat : Very Good. G.B. Dantzig, D.R. Fulkerson, S.M. Johnson. Two Papers. (1) "Solution for a large-scale traveling-salesman problem" (1954) AND (Ibid.) (2) "On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem" (1959) both in "Operations Research". Two items. [++] (Dantzig 1954, #1 is found in the "Journal of the Operations Research Society of America" 2 (1954), pp. 393-41 in the full bound volume of 470, 40pp. Bound in cloth and decorated boards. FINE copy. AND #2, Operations Research, January-February 1959, vol 7 number 1, with the Dantzig on pp 58-66 in the issue of pp 1-142. This is the original issue, in wrappers. The spine has been expertly restored. [++] "Dantzig, Fulkerson and Johnson solved the 49-city instance by solving a sequence of linear programs, starting with the fundamental inequalities, and adding successive cuts as required to exclude fractional optimal solutions."--"George Dantzig's impact on the theory of computation" by Richard M. Karp, in "Discrete Optimization," Volume 5, Issue 2, May 2008, Pages 174-185. Karp continues: "George Dantzig will go down in history as one of the founders and chief contributors to the field of mathematical programming, and as the creator of the simplex algorithm for linear programming, perhaps the most important algorithm developed in the 20th century. --"George Dantzig's impact on the theory of computation"--Karp, ibid. Dantzig "was one of the three founders of linear programming, a mathematical method used for the optimum allocation of scarce resources among competing activities [Dantzig] discovered that many such allocation problems could be formulated as linear computer programs" (Jeremy Norman, Origins of Cyberspace, 92) [++] Also in the issue with #2 is Alfred HAUSRATH, "Utilization of Negro Manpower in the Army", a foundation paper in equality and race relations.  The ORO (The Johns Hopkins University Operations Research Office) instituted a study in 1951 by a team of five analysts headed by Dr. Alfred Hausrath (a war games researcher) to study the effects of integration, part of which was published in the report "Utilization of Negro Manpower in the Army",  with the full three-volume publication of the study coming slightly later in 1954.   (Two earlier interim reports were issued in July and December 1951.) Basically, after everything was said and done, Hausrath and his team found that integrated units work much better than segregated units. The report "provided policymakers in the Army with the objective arguments in favor of integrated units", and the policy changes for full integration of the Army were issued just months after this report was rendered, in July 1951. This document was printed for the first time in a general format for OR folks in 1953.  (The term "landmark" was used to describe this paper in Saul Gass' "An Annotated Timeline of Operations Research," an Informal History, page 80.).

1st Edition. FIRST EDITION, full volume inclusive of many important papers: one of only two declassified papers written by the physicist Hugh Everett during his long tenure "analyzing the cost-benefits of global and limited nuclear warfare," for the top secret Weapons Systems Evaluation Group [WESG], a sort of Pentagon think tank which generated analysis for the Joint Chiefs of Staff (Aftergood, Secrecy 2010 quoting Peter Byrne). Also included in this volume are Osborne's first two papers on Brownian motion in the stock market; Dantzig's application of linear programming to the â??traveling-salesman problem; and Malcolm on a pioneering technique for project planning and monitoring commonly called PERT. EVERETT: After Hugh Everett's "now celebrated theory of multiple universes [was published and] met scorn, [he] abandoned the world of academic physics [and] turned to top secret military research" (Byrne, Scientific American, 2008). All save for two of his papers have been classified, this being one of the two. Pugh later characterized their work specifically as having "rationalizing and promoted military strategies that were operative for decades" (ibid). The purpose of the paper offered here was "to provide a simple way of evaluating the consequences of radioactive fallout from a large nuclear-weapon campaign without resorting to detailed map studies. A method of optimally distributing weapons among large areas in order to maximize radiation casualties is deduced on the basis of the formulas, and curves are exhibited expressing the casualties produced as a function of total yield delivered. The achievement of optimized attacks does not require a delivery accuracy with probable error less than about a hundred miles. In addition, the formulas are applied to a number of other targeting doctrines, and the resulting curves of casualties versus total delivered yield are presented " (Everett, 226). OSBORNE: 1st publication of Brownian motion in the stock market. Osborne was the first to study the technical analysis scientifically, the first to demonstrate the substantial contribution physics could make to finance, and the first to publish [in the two papers included here]. He elucidated the periodic structure in the Brownian motion of stock prices as well as the financial analogs of physical Brownian motion as illustrated by earnings. In the first of the two papers, Osborne presents his hypothesis that price follows a geometric Brownian motion - "that common-stock prices, and the value of money can be regarded as an ensemble of decisions in statistical equilibrium, with properties quite analogous to an ensemble of particles in statistical mechanics" (Osborne 145). In the second paper, Osborne demonstrates that he was jointly responsible for the earliest literature identifying the fat tails and that price deviation is proportional to the square root of time. MALCOLM: 1st edition of a statistical mathematics tool, Malcolm's pioneering technique for project planning and monitoring commonly called PERT. The paper "describes the development and application of a technique for measuring and controlling development progress" for the Navy's Polaris Fleet Ballistic Missile program" (Malcolm, et al., 1959, p. 646). DANTZIG: Dantzig "was one of the three founders of linear programming, a mathematical method used for the optimum allocation of scarce resources among competing activities. [He] discovered that many such allocation problems could be formulated as linear computer programs" (Origins of Cyberspace, 92). Dantzig's work in this paper on the famed "traveling-salesman problem" was an important early application of linear programming. ALSO INCLUDED: Two papers dealing with the problem of traffic, one by Greenberg, one by Herman & Montroll. CONDITION & DETAILS: Complete volume. 8vo. (9 x 6 inches). Tightly and very solidly bound in blue and grey, silver lettered at the spine. Pristine inside and out. Fine condition.