Handbook of Combinatorial Optimization. Du, H.; Wu, W.; Wu, L.; Xing, K.; Zhang, X.; and Li, D. In Satisfiability Problem: Theory and Applications, pages 2359–2389.
Handbook of Combinatorial Optimization [link]Paper  doi  abstract   bibtex   
Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics).
@incollection{duHandbookCombinatorialOptimization2013,
  title = {Handbook of {{Combinatorial Optimization}}},
  isbn = {978-1-4419-7996-4},
  url = {http://link.springer.com/10.1007/978-1-4419-7997-1},
  abstract = {Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics).},
  number = {January 1998},
  booktitle = {Satisfiability {{Problem}}: {{Theory}} and {{Applications}}},
  date = {2013},
  pages = {2359--2389},
  keywords = {0,1 2,3 40,56,6,640,7,8,9,a4 5 8,b,bdcae f0g9g,d,h,hpi0qsrut,i,irh,r,sg,t,v0w,wri g,x,xhgpirqsw v autvq wxv0i0v0way,xt,y,ybadcerutfw},
  author = {Du, Hongwei and Wu, Weili and Wu, Lidong and Xing, Kai and Zhang, Xuefei and Li, Deying},
  file = {/home/dimitri/Nextcloud/Zotero/storage/RJF7EFCG/algorithms-for-satisfiability.pdf},
  doi = {10.1007/978-1-4419-7997-1},
  eprinttype = {pmid},
  eprint = {17777135}
}
Downloads: 0