Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programmation (mathématiques) --- Combinatorial optimization --- Programmation mathematique --- Optimisation combinatoire

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further."& American Mathematical Monthly. 1982 ed.

Discrete mathematics --- Mathematical optimization --- Combinatorial optimization --- Computational complexity. --- Optimisation mathématique --- Optimisation combinatoire --- Complexité de calcul (Informatique) --- Computational Complexity --- Mathematical optimization. --- Combinatorial optimization. --- Complexity, Computational --- Electronic data processing --- Machine theory --- Optimization, Combinatorial --- Combinatorial analysis --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Optimisation mathématique --- Complexité de calcul (Informatique) --- Computational complexity