MARC보기
LDR03537cmm u2200649 i 4500
001000000336762
003OCoLC
00520250207092042
006m d
007cr cnu---unuuu
008240313t20242024njua ob 001 0 eng
010 ▼a 2024011182
020 ▼a 9781394235971 ▼q electronic book
020 ▼a 1394235976 ▼q electronic book
020 ▼a 1394235968 ▼q electronic book
020 ▼a 9781394235957 ▼q electronic book
020 ▼a 139423595X ▼q electronic book
020 ▼a 9781394235964 ▼q (electronic bk.)
020 ▼z 9781394235940 ▼q hardcover
035 ▼a 3979552 ▼b (N$T)
035 ▼a (OCoLC)1429725364
037 ▼a 9781394235940 ▼b O'Reilly Media
040 ▼a DLC ▼b eng ▼e rda ▼c DLC ▼d OCLCO ▼d YDX ▼d DG1 ▼d UKAHL ▼d CLOUD ▼d ORMDA ▼d N$T ▼d 248032
042 ▼a pcc
049 ▼a MAIN
05004 ▼a QA164 ▼b .A4693 2024
08200 ▼a 511/.6 ▼2 23/eng/20240412
1001 ▼a Alzalg, Baha, ▼e author.
24510 ▼a Combinatorial and algorithmic mathematics : ▼b from foundation to optimization / ▼c Baha Alzalg, the University of Jordan, Amman, Jordan.
260 ▼a Hoboken, NJ : ▼b Wiley, ▼c 2024.
300 ▼a 1 online resource (xxi, 506 pages) : ▼b illustrations (chiefly color)
336 ▼a text ▼b txt ▼2 rdacontent
337 ▼a computer ▼b c ▼2 rdamedia
338 ▼a online resource ▼b cr ▼2 rdacarrier
504 ▼a Includes bibliographical references and index.
520 ▼a "Throughout operations research, computer science and pure and applied mathematics, combinatorics problems arise frequently, where the solution is to find the "optimal" object from a finite set of mathematical objects. Typically, it is impractical to search exhaustively for all possible solutions. The development of efficient algorithms for exploring the solution space is known as combinatorial optimisation. Many problems, such as network optimisation, supply chain management, data compression, resource allocation and game theory - indeed most of machine learning, AI, and current high profile computer science topics rely on optimisation. Together, combinatorial and algorithmic mathematics provide powerful tools for solving these real-world problems, and for in-demand subjects such as data science, machine learning, and artificial intelligence, a unified knowledge of discrete structures, algorithms and combinatorial optimization is considered essential"-- ▼c Provided by publisher.
588 ▼a Description based on online resource; title from digital title page (viewed on August 07, 2024).
590 ▼a Added to collection customer.56279.3
650 0 ▼a Combinatorial analysis.
650 0 ▼a Algorithms.
650 0 ▼a Combinatorial optimization.
650 6 ▼a Analyse combinatoire.
650 6 ▼a Algorithmes.
650 6 ▼a Optimisation combinatoire.
650 7 ▼a algorithms. ▼2 aat
650 7 ▼a Operations Research. ▼2 bisacsh/2022
650 7 ▼a Combinatorics. ▼2 bisacsh/2022
650 7 ▼a MATHEMATICS. ▼2 bisacsh/2022
650 7 ▼a Optimization. ▼2 bisacsh/2022
650 7 ▼a TECHNOLOGY & ENGINEERING. ▼2 bisacsh/2022
77608 ▼i Print version: ▼a Alzalg, Baha. ▼t Combinatorial and algorithmic mathematics ▼d Hoboken, NJ : Wiley, 2024 ▼z 9781394235940 ▼w (DLC) 2024011181
85640 ▼3 EBSCOhost ▼u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=3979552
938 ▼a cloudLibrary ▼b CLDL ▼n 9781394235964
938 ▼a Askews and Holts Library Services ▼b ASKH ▼n AH42103766
938 ▼a YBP Library Services ▼b YANK ▼n 21163458
938 ▼a EBSCOhost ▼b EBSC ▼n 3979552
990 ▼a 관리자
994 ▼a 92 ▼b N$T