Wiley-Interscience series in discrete mathematics and optimization

• 資料種別: 図書
• タイトル: Wiley-Interscience series in discrete mathematics and optimization
• 出版事項: Wiley
• 並列タイトル等: Wiley Interscience series in discrete mathematics and optimization; Wiley series in discrete mathematics and optimization
• 出版地（国名コード）: uk
• 対象利用者: 一般
• 一般注記: Continues: Wiley-Interscience series in discrete mathematics (BA00045669)
• 関連情報: Combinatorial geometry; https://cir.nii.ac.jp/crid/1130000793749123584; Mathematical programming : theory and algorithms; https://cir.nii.ac.jp/crid/1130000793810521344; Modified Lagrangians and monotone maps in optimization; https://cir.nii.ac.jp/crid/1130000793887476736; Integer programming; https://cir.nii.ac.jp/crid/1130000794025814528; Graph theory; https://cir.nii.ac.jp/crid/1130000794315983488; Random graphs; https://cir.nii.ac.jp/crid/1130000794582902016; Introduction to discrete dynamical systems and chaos; https://cir.nii.ac.jp/crid/1130000794585490816; Theory of linear and integer programming; https://cir.nii.ac.jp/crid/1130000794775379712; Logic-based methods for optimization : combining optimization and constraint satisfaction; https://cir.nii.ac.jp/crid/1130000795121055104; Cellular automata : a discrete view of the world; https://cir.nii.ac.jp/crid/1130000795190629632; Combinatorics; https://cir.nii.ac.jp/crid/1130000795344197248; Combinatorial optimization; https://cir.nii.ac.jp/crid/1130000795431005952; Search problems; https://cir.nii.ac.jp/crid/1130000795537708928; Network and discrete location : models, algorithms, and applications; https://cir.nii.ac.jp/crid/1130000795602218240; Linear programming in infinite-dimensional spaces : theory and applications; https://cir.nii.ac.jp/crid/1130000796325253632; Theory of computational complexity; https://cir.nii.ac.jp/crid/1130000796532865792; The probabilistic method; https://cir.nii.ac.jp/crid/1130000796616018176; Optimization and computational logic; https://cir.nii.ac.jp/crid/1130000796768379904; Local search in combinatorial optimization; https://cir.nii.ac.jp/crid/1130000796980464512; https://cir.nii.ac.jp/crid/1130000796988983424; Probabilistic analysis of packing and partitioning algorithms; https://cir.nii.ac.jp/crid/1130000797407412992; Annotated bibliographies in combinatorial optimization; https://cir.nii.ac.jp/crid/1130000797759584896; Graph coloring problems; https://cir.nii.ac.jp/crid/1130000798014695808; Theory and algorithms for linear optimization : an interior point approach; https://cir.nii.ac.jp/crid/1130000798106594176; Sorting : a distribution theory; https://cir.nii.ac.jp/crid/1130000798252348672; Cryptography, information theory and error-correction : a handbook for the 21st century; https://cir.nii.ac.jp/crid/1130008895919390464; An introduction to optimization; https://cir.nii.ac.jp/crid/1130282268658018560; Integer and combinatorial optimization; https://cir.nii.ac.jp/crid/1130282268862517760; Trees and proximity representations; https://cir.nii.ac.jp/crid/1130282268952806528; https://cir.nii.ac.jp/crid/1130282269007150080; Cryptography, information theory, and error-correction : a handbook for the 21st century; https://cir.nii.ac.jp/crid/1130282269108121600; Topological graph theory; https://cir.nii.ac.jp/crid/1130282269666573952; The traveling salesman problem : a guided tour of combinatorial optimization; https://cir.nii.ac.jp/crid/1130282269859007744; https://cir.nii.ac.jp/crid/1130282270024891648; Introduction to combinatorics; https://cir.nii.ac.jp/crid/1130282270061033088; Discrete mathematics using Latin squares; https://cir.nii.ac.jp/crid/1130282270153756160; https://cir.nii.ac.jp/crid/1130282270254659072; Maxima and minima with applications : practical optimization and duality; https://cir.nii.ac.jp/crid/1130282270440600832; Perfect graphs; https://cir.nii.ac.jp/crid/1130282270534439552; Contemporary design theory : a collection of surveys; https://cir.nii.ac.jp/crid/1130282270590148352; https://cir.nii.ac.jp/crid/1130282270672236800; Nonnegative matrices; https://cir.nii.ac.jp/crid/1130282270755438208; Perturbation theory in mathematical programming and its applications; https://cir.nii.ac.jp/crid/1130282271031766528; Simulated annealing and Boltzmann machines : a stochastic approach to combinatorial optimization and neural computing; https://cir.nii.ac.jp/crid/1130282271080139136; Introduction to stochastic search and optimization : estimation, simulation, and control; https://cir.nii.ac.jp/crid/1130282271104055040; https://cir.nii.ac.jp/crid/1130282271109161856; https://cir.nii.ac.jp/crid/1130282271255910016; https://cir.nii.ac.jp/crid/1130282271435091200; Optimization methods for logical inference; https://cir.nii.ac.jp/crid/1130282271951528704; https://cir.nii.ac.jp/crid/1130282271972145024; https://cir.nii.ac.jp/crid/1130282272002338304; https://cir.nii.ac.jp/crid/1130282272123331712; Ramsey theory; https://cir.nii.ac.jp/crid/1130282272173166336; Graph edge coloring : Vizing's theorem and Goldberg's conjecture; https://cir.nii.ac.jp/crid/1130282272465344000; Introduction to the theory of error-correcting codes; https://cir.nii.ac.jp/crid/1130282272534199680; Average case analysis of algorithms on sequences; https://cir.nii.ac.jp/crid/1130282272749419264; Interior point algorithms : theory and analysis; https://cir.nii.ac.jp/crid/1130282272988396416; Product graphs : structure and recognition; https://cir.nii.ac.jp/crid/1130282273024941184; Fractional graph theory : a rational approach to the theory of graphs; https://cir.nii.ac.jp/crid/1130282273044872704; An introduction to optimization : with applications to machine learning; https://cir.nii.ac.jp/crid/1130861062768549903
• 関連情報（URI）: https://ci.nii.ac.jp/ncid/BA00856752#entity
• 連携機関・データベース: 国立情報学研究所 : CiNii Research
• 提供元機関・データベース: CiNii Books; https://ci.nii.ac.jp/books
• NACSIS書誌ID（NCID）: https://ci.nii.ac.jp/ncid/BA00856752 : BA00856752

目次

Combinatorial geometry

Mathematical programming : theory and algorithms

Modified Lagrangians and monotone maps in optimization

Integer programming

Graph theory