Integer and combinatorial optimization / George L. Nemhauser, Laurence A. Wolsey

Por: Nemhauser, George LColaborador(es): Wolsey, Laurence ATipo de material: Texto

TextoSeries Wiley-Interscience series in discrete mathematics and optimizationDetalles de publicación: New York : Wiley, 1999 Descripción: XIV, 770 p. : gráf. ; 25 cmISBN: 0-471-35943-2Tema(s): Optimización matemática | Optimizacion combinatoria | Programación dinámicaResumen: INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively.Resumen: INDICE: FOUNDATIONS: The scope of integer and combinatorial optimization. Linear programming. Graphs and networks. Polyhedral theory. Computational complexity. Polynomial-time algorithms for linear programming. Integer lattices. GENERAL INTEGER PROGRAMMING: The theory of valid inequalities. Strong valid inequalities and facets for structured integer programs. Duality and relaxation. General algorithms. Special-purpose algorithms. Applications of special- purpose algorithms. COMBINATORIAL OPTIMIZATION: Integral polyhedra. Matching. Matroid and submodular function optimization. References. Indexes.

Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Inicie sesión para agregar etiquetas.

Existencias ( 1 )
Notas de título ( 4 )
Opiniones ( 0 )

Existencias
Tipo de ítem	Biblioteca de origen	Signatura	URL	Estado	Fecha de vencimiento	Código de barras	Reserva de ítems	Bibliografía recomendada
Manuales	02. BIBLIOTECA CAMPUS PUERTO REAL	519.1/NEM/int (Navegar estantería(Abre debajo))	Texto completo	Prestado	31/01/2022	3741455159		MODELOS DE LA INVESTIGACIÓN OPERATIVA GRADO EN MATEMÁTICAS Asignatura actualizada 2022-2023

Total de reservas: 0

Navegando 02. BIBLIOTECA CAMPUS PUERTO REAL Estantes Cerrar el navegador de estanterías (Oculta el navegador de estanterías)

Previo								Siguiente
Previo	519.1/LAW/com Combinatorial optimization : networks and matroids / Eugene Lawler.	519.1/LEE/fir A first course in combinatorial optimization / Jon Lee.	519.1/LEE/fir A first course in combinatorial optimization / Jon Lee.	519.1/NEM/int Integer and combinatorial optimization / George L. Nemhauser, Laurence A. Wolsey	519.1/PAP/com Combinatorial optimization : algorithms and complexity / Christos H. Papadimitriou, Kenneth Steiglitz	519.1/ROB/app Applied combinatorics / Fred Roberts	519.1/ROS/mat Matemática discreta y sus aplicaciones / Kenneth H. Rosen ; traducción José Manuel Pérez Morales [et al.]	Siguiente

Indice

Bibliografía: p. 721-747

INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively.

INDICE: FOUNDATIONS: The scope of integer and combinatorial optimization. Linear programming. Graphs and networks. Polyhedral theory. Computational complexity. Polynomial-time algorithms for linear programming. Integer lattices. GENERAL INTEGER PROGRAMMING: The theory of valid inequalities. Strong valid inequalities and facets for structured integer programs. Duality and relaxation. General algorithms. Special-purpose algorithms. Applications of special- purpose algorithms. COMBINATORIAL OPTIMIZATION: Integral polyhedra. Matching. Matroid and submodular function optimization. References. Indexes.

No hay comentarios en este titulo.

para aportar su opinión.