Combinatorial optimization. II
Gespeichert in:
| Weitere Verfasser: | |
|---|---|
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Mathematical programming studies
13 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Actes d'une conférence tenue à Norwich du 9 au 12 juillet 1979, d'après la préface 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 II, Texte imprimé, 9783642008030 • Combinatorial Optimization II, Texte imprimé, 9783662311394 • Combinatorial Optimization II, Texte imprimé, 9783662311400 |
Inhaltsangabe:
- Perfect triangle-free 2-matchings
- On the structure of all minimum cuts in a network and applications
- Clutter percolation and random graphs
- The use of recurrence relations in computing
- A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem
- A problem of scheduling conference accommodation
- Constructing timetables for sport competitions
- The reconstruction of latin squares with applications to school timetabling and to experimental design
- An algorithm for the single machine sequencing problem with precedence constraints
- Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
- The distance between nodes for a class of recursive trees
- Optimization problems arising from the incorporation of split values in search trees
- Heuristic analysis, linear programming and branch and bound
- Heuristic improvement methods: How should starting solutions be chosen?.