Combinatorial optimization
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Mathematical programming studies
12 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Combinatorial Optimization I, Texte imprimé, 9783642008016 • Combinatorial Optimization I, Texte imprimé, 9783662310809 • Combinatorial Optimization I, Texte imprimé, 9783662310816 |
Sommario:
- Weakly admissible transformations for solving algebraic assignment and transportation problems
- Cutting planes from conditional bounds: A new approach to set covering
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- On the symmetric travelling salesman problem: A computational study
- A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
- Polynomial bounding for NP-hard problems
- Worst case analysis of greedy type algorithms for independence systems
- Quadratic knapsack problems
- Fractional vertices, cuts and facets of the simple plant location problem
- Balanced matrices and property (G)
- Dual integrality in b-matching problems
- A technique for determining blocking and anti-blocking polyhedral descriptions
- Certain kinds of polar sets and their relation to mathematical programming.