Skip to main content
Search Button
United States Kobo store Gift Cards Help

Rakuten Kobo

Wishlist

Shopping Cart

You're getting the VIP treatment!

Item(s) unavailable for purchase
Please review your cart. You can remove the unavailable item(s) now or we'll automatically remove it at Checkout.
itemsitem
itemsitem

Recommended For You

Loading...


Showing 1 - 12 of 12 results for “ping qi pan”
Skip side bar filters

  • Face Method

    Toward the New Generation of Linear Programming

    by Ping-Qi Pan ...
    Series series Professional and Applied Computing (R0)
    The famous simplex method, invented by George B. Dantzig in 1947, moves from vertex to vertex in the underlying polyhedron until achieving an optimal vertex. As one of the most widely used mathematical tools, it has dominated the field of Linear Programming for nearly eighty years. However, it has exponential time complexity, and its performance turned out somehow unsatisfactory when solving some ... Read more

    $179.09 USD

  • Linear Programming Computation

    by Ping-Qi PAN ...
    Series series Computer Science (R0)
    This monograph represents a historic breakthrough in the field of linear programming (LP)since George Dantzig first discovered the simplex method in 1947.Being both thoughtful and informative, it focuses on reflecting and promoting the state of the art by highlighting new achievements in LP. This new edition is organized in two volumes. The first volume addresses foundations of LP, including the ... Read more

    $260.09 USD

  • Linear Programming Computation

    by Ping-Qi PAN ...
    Series series Mathematics and Statistics (R0)
    With emphasis on computation, this book is a real breakthrough in the field of LP. In addition to conventional topics, such as the simplex method, duality, and interior-point methods, all deduced in a fresh and clear manner, it introduces the state of the art by highlighting brand-new and advanced results, including efficient pivot rules, Phase-I approaches, reduced simplex methods, deficient ... Read more

    $134.09 USD

People who read these also enjoyed

  • Introduction to Algorithms, fourth edition

    by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein ...
    A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their ... Read more

    $92.99 USD

  • Art of Computer Programming, The

    Fundamental Algorithms, Volume 1

    by Donald Knuth ...
    &>The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.—Byte, September 1995I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the ... Read more

    $68.39 USD

  • Art of Computer Programming, The

    Seminumerical Algorithms, Volume 2

    by Donald Knuth ...
    The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.–Byte, September 1995I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line ... Read more

    $68.39 USD

  • A Gentle Introduction to Optimization

    by B. Guenin, J. Könemann, L. Tunçel ...
    Optimization is an essential technique for solving problems in areas as diverse as accounting, computer science and engineering. Assuming only basic linear algebra and with a clear focus on the fundamental concepts, this textbook is the perfect starting point for first- and second-year undergraduate students from a wide range of backgrounds and with varying levels of ability. Modern, real-world ... Read more

    $50.09 USD

  • Fundamentals of Discrete Math for Computer Science

    A Problem-Solving Primer

    by Ben Stephenson, Tom Jenkyns ...
    Series series Computer Science (R0)
    This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction.Clearly structured and interactive in nature, the ... Read more

    $49.49 USD

  • Computational Complexity

    A Modern Approach

    by Sanjeev Arora, Boaz Barak ...
    This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and ... Read more

    $65.59 USD

  • Algorithms: Design Techniques And Analysis (Revised Edition)

    by M H Alsuwaiyel ...
    Series Book 14 - Lecture Notes Series On Computing
    Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad hoc techniques or by following techniques that have produced efficient solutions to similar problems. This requires the understanding of various algorithm design techniques ... Read more

    $62.99 USD

  • P, NP, and NP-Completeness

    The Basics of Computational Complexity

    by Oded Goldreich ...
    The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their ... Read more

    $47.59 USD

  • Handbook of Discrete and Combinatorial Mathematics

    Edited by Kenneth H. Rosen ...
    Series series Discrete Mathematics and Its Applications
    Handbook of Discrete and Combinatorial Mathematics provides a comprehensive reference volume for mathematicians, computer scientists, engineers, as well as students and reference librarians.The material is presented so that key information can be located and used quickly and easily. Each chapter includes a glossary. Individual topics are covered in sections and subsections within chapters, each of ... Read more

    $345.00 USD