TY - BOOK ID - 6701023 TI - Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions AU - Jünger, Michael. AU - Naddef, Denis. PY - 2001 VL - 2241 SN - 03029743 SN - 3540428771 9783540428770 3540455868 PB - Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, DB - UniCat KW - Programming (Mathematics) KW - Combinatorial optimization KW - Congresses KW - Operations Research KW - Civil & Environmental Engineering KW - Engineering & Applied Sciences KW - Mathematics. KW - Information technology. KW - Business KW - Data structures (Computer science). KW - Algorithms. KW - Computer science KW - Mathematical optimization. KW - Combinatorics. KW - Optimization. KW - Discrete Mathematics in Computer Science. KW - Algorithm Analysis and Problem Complexity. KW - IT in Business. KW - Data Structures. KW - Data processing. KW - Computational complexity. KW - Computer software. KW - Data structures (Computer scienc. KW - Combinatorics KW - Algebra KW - Mathematical analysis KW - IT (Information technology) KW - Technology KW - Telematics KW - Information superhighway KW - Knowledge management KW - Software, Computer KW - Computer systems KW - Complexity, Computational KW - Electronic data processing KW - Machine theory KW - Optimization (Mathematics) KW - Optimization techniques KW - Optimization theory KW - Systems optimization KW - Maxima and minima KW - Operations research KW - Simulation methods KW - System analysis KW - Computer science—Mathematics. KW - Business—Data processing. KW - Information structures (Computer science) KW - Structures, Data (Computer science) KW - Structures, Information (Computer science) KW - File organization (Computer science) KW - Abstract data types (Computer science) KW - Algorism KW - Arithmetic KW - Foundations KW - Programming (Mathematics) - Congresses KW - Combinatorial optimization - Congresses UR - https://www.unicat.be/uniCat?func=search&query=sysid:6701023 AB - This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality. ER -