Integer and combinatorial optimization
| Permalink: | http://skupni.nsk.hr/Record/fer.KOHA-OAI-FER:37711/TOC |
|---|---|
| Glavni autor: | Nemhauser, George L. (-) |
| Ostali autori: | Wolsey, Laurence A. (-) |
| Vrsta građe: | Knjiga |
| Jezik: | eng |
| Impresum: |
New York :
Wiley,
c1999.
|
| Nakladnička cjelina: |
Wiley-Interscience series in discrete mathematics and optimization.
|
| Predmet: |
Sadržaj:
- Pt. I.
- Foundations.
- I.1.
- The Scope of Integer and Combinatorial Optimization.
- I.2.
- Linear Programming.
- I.3.
- Graphs and Networks.
- I.4.
- Polyhedral Theory.
- I.5.
- Computational Complexity.
- I.6.
- Polynomial-Time Algorithms for Linear Programming.
- I.7.
- Integer Lattices
- Pt. II.
- General Integer Programming.
- II.1.
- The Theory of Valid Inequalities.
- II.2.
- Strong Valid Inequalities and Facets for Structured Integer Programs.
- II.3.
- Duality and Relaxation.
- II.4.
- General Algorithms.
- II.5.
- Special-Purpose Algorithms.
- II.6.
- Applications of Special-Purpose Algorithms
- Pt. III.
- Combinatorial Optimization.
- III.1.
- Integral Polyhedra.
- III.2.
- Matching.
- III.3.
- Matroid and Submodular Function Optimization.