Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Computational Combinatorial Optimization [[electronic resource] ] : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef
| Computational Combinatorial Optimization [[electronic resource] ] : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 310 p.) |
| Disciplina | 519.7 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical optimization
Computer science—Mathematics Algorithms Information technology Business—Data processing Data structures (Computer science) Combinatorics Optimization Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity IT in Business Data Structures |
| ISBN | 3-540-45586-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms -- Projection and Lifting in Combinatorial Optimization -- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems -- Lagrangian Relaxation -- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS -- Branch, Cut, and Price: Sequential and Parallel -- TSP Cuts Which Do Not Conform to the Template Paradigm. |
| Record Nr. | UNISA-996465664603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef
| Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 310 p.) |
| Disciplina | 519.7 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical optimization
Computer science—Mathematics Algorithms Information technology Business—Data processing Data structures (Computer science) Combinatorics Optimization Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity IT in Business Data Structures |
| ISBN | 3-540-45586-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms -- Projection and Lifting in Combinatorial Optimization -- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems -- Lagrangian Relaxation -- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS -- Branch, Cut, and Price: Sequential and Parallel -- TSP Cuts Which Do Not Conform to the Template Paradigm. |
| Record Nr. | UNINA-9910143921303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||