Problems from the Discrete to the Continuous [[electronic resource] ] : Probability, Number Theory, Graph Theory, and Combinatorics / / by Ross G. Pinsky |
Autore | Pinsky Ross G |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XIII, 154 p. 8 illus. in color.) |
Disciplina | 519.64 |
Collana | Universitext |
Soggetto topico |
Probabilities
Graph theory Number theory Combinatorics Probability Theory and Stochastic Processes Graph Theory Number Theory |
ISBN | 3-319-07965-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Partitions With Restricted Summands or "The Money Changing Problem" -- The Asymptotic Density of Relatively Prime Pairs and of Square-Free Numbers -- A One-Dimensional Probabilistic Packing Problem -- The Arcsine Laws for the One-Dimensional Simple Symmetric Random Walk -- The Distribution of Cycles in Random Permutations -- Chebyshev's Theorem on the Asymptotic Density of the Primes -- Mertens' Theorems on the Asymptotic Behavior of the Primes -- The Hardy-Ramanujan Theorem on the Number of Distinct Prime Divisors -- The Largest Clique in a Random Graph and Applications to Tampering Detection and Ramsey Theory -- The Phase Transition Concerning the Giant Component in a Sparse Random Graph–a Theorem of Erdős and Rényi. |
Record Nr. | UNINA-9910299978703321 |
Pinsky Ross G
![]() |
||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Project optimization : using matlab and solver / / written by Reyolando M. L. R. F. Brasil, Marcelo Araujo da Silva |
Autore | Brasil Ryolando M. L. R. F. |
Pubbl/distr/stampa | Berlin ; ; Boston : , : Walter de Gruyter GmbH, , [2021] |
Descrizione fisica | 1 online resource (148 pages) |
Disciplina | 519.64 |
Collana | De Gruyter Textbook |
Soggetto topico | Combinatorial optimization |
Soggetto non controllato |
Excel
MATLAB Project Optimization SOLVER |
ISBN | 3-11-062562-8 |
Classificazione | ST 601 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Intro -- Preface -- Contents -- About notation -- Chapter 1. Fundamental ideas -- Chapter 2. Essential mathematical optimization tools -- Chapter 3. Graphic method -- Chapter 4. Linear programming -- Chapter 5. Using MATLAB optimization toolbox -- Chapter 6. Numerical methods for nonlinear non-constrained optimization -- Chapter 7. Nature-inspired optimization methods -- Chapter 8. Topology optimization and reliability -- Chapter 9. Using Excel Solver in optimization problems -- Appendix -- References -- Index. |
Record Nr. | UNINA-9910554490903321 |
Brasil Ryolando M. L. R. F.
![]() |
||
Berlin ; ; Boston : , : Walter de Gruyter GmbH, , [2021] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Variable Neighborhood Search [[electronic resource] ] : 8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21–25, 2021, Proceedings / / edited by Nenad Mladenovic, Andrei Sleptchenko, Angelo Sifaleras, Mohammed Omar |
Edizione | [1st ed. 2021.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
Descrizione fisica | 1 online resource (X, 191 p. 66 illus., 26 illus. in color.) |
Disciplina | 519.64 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Mathematics of Computing Discrete Mathematics in Computer Science Design and Analysis of Algorithms |
ISBN | 3-030-69625-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Which are the most critical nodes in a network? A Basic Variable Neighborhood Search approach -- Variable Neighborhood Descent Branching applied to the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet -- A Variable Neighborhood Heuristic for Facility Locations in Fog Computing -- A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability -- Max-Diversity Orthogonal Regrouping of MBA Students using a GRASP/VND Heuristic -- Scheduling in parallel machines with two servers: the restrictive case -- Reduced Variable Neighbourhood Search for the generation of controlled circular data -- Sequential and Parallel Scattered Variable Neighborhood Search for Solving Nurikabe -- A Hybrid VNS for the Multi-Product Maritime Inventory Routing Problem -- Simplicial vertex heuristic in solving the Railway arrival and departure paths assignment problem -- Scheduling of Patients in Emergency Departments with a Variable Neighborhood Search -- A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows -- Using K-means and Variable Neighborhood Search for Automatic Summarization of Scientific Articles -- BVNS approach for the Order Processing in Parallel Picking Workstations . |
Record Nr. | UNISA-996464392303316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Variable Neighborhood Search [[electronic resource] ] : 8th International Conference, ICVNS 2021, Abu Dhabi, United Arab Emirates, March 21–25, 2021, Proceedings / / edited by Nenad Mladenovic, Andrei Sleptchenko, Angelo Sifaleras, Mohammed Omar |
Edizione | [1st ed. 2021.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
Descrizione fisica | 1 online resource (X, 191 p. 66 illus., 26 illus. in color.) |
Disciplina | 519.64 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Mathematics of Computing Discrete Mathematics in Computer Science Design and Analysis of Algorithms |
ISBN | 3-030-69625-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Which are the most critical nodes in a network? A Basic Variable Neighborhood Search approach -- Variable Neighborhood Descent Branching applied to the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet -- A Variable Neighborhood Heuristic for Facility Locations in Fog Computing -- A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability -- Max-Diversity Orthogonal Regrouping of MBA Students using a GRASP/VND Heuristic -- Scheduling in parallel machines with two servers: the restrictive case -- Reduced Variable Neighbourhood Search for the generation of controlled circular data -- Sequential and Parallel Scattered Variable Neighborhood Search for Solving Nurikabe -- A Hybrid VNS for the Multi-Product Maritime Inventory Routing Problem -- Simplicial vertex heuristic in solving the Railway arrival and departure paths assignment problem -- Scheduling of Patients in Emergency Departments with a Variable Neighborhood Search -- A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows -- Using K-means and Variable Neighborhood Search for Automatic Summarization of Scientific Articles -- BVNS approach for the Order Processing in Parallel Picking Workstations . |
Record Nr. | UNINA-9910483960303321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Variable Neighborhood Search [[electronic resource] ] : 7th International Conference, ICVNS 2019, Rabat, Morocco, October 3–5, 2019, Revised Selected Papers / / edited by Rachid Benmansour, Angelo Sifaleras, Nenad Mladenović |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
Descrizione fisica | 1 online resource (205 pages) : illustrations |
Disciplina | 519.64 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Computer networks Artificial intelligence Computer science Mathematics of Computing Discrete Mathematics in Computer Science Computer Communication Networks Artificial Intelligence Theory of Computation |
ISBN | 3-030-44932-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A Reduced Variable Neighborhood Search Approach for Feature Selection in Cancer Classification -- Basic VNS for a Variant of the Online Order Batching Problem -- A VNS-Based Algorithm for the Mammography Unit Location Problem -- A Hybrid Heuristic Algorithm for the Dial-a-Ride Problem -- Multi-Objective Basic Variable Neighborhood Search for Portfolio Selection -- Local Search Approach for the (r|p)-Centroid Problem Under ℓ1 Metric -- Optimization of Maintenance Planning and Routing Problems -- Variable Neighborhood Search for Identical Parallel Machine Scheduling Problem with a Single Server -- Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem -- A Variable Neighborhood Search Algorithmic Approach for Estimating MDHMM Parameters and Application in Credit Risk Evaluation for Online Peer-to-Peer (P2P) Lending -- A Multi-Objective Metaheuristic for a Green UAV Grid Routing Problem -- A VNS Approach for Batch Sequencing and Route Planning in Manual Picking System with Time Windows -- Daily Scheduling and Routing of Home Health Care with Multiple Availability Periods of Patients. |
Record Nr. | UNISA-996418220503316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Variable Neighborhood Search [[electronic resource] ] : 7th International Conference, ICVNS 2019, Rabat, Morocco, October 3–5, 2019, Revised Selected Papers / / edited by Rachid Benmansour, Angelo Sifaleras, Nenad Mladenović |
Edizione | [1st ed. 2020.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
Descrizione fisica | 1 online resource (205 pages) : illustrations |
Disciplina | 519.64 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Computer networks Artificial intelligence Computer science Mathematics of Computing Discrete Mathematics in Computer Science Computer Communication Networks Artificial Intelligence Theory of Computation |
ISBN | 3-030-44932-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A Reduced Variable Neighborhood Search Approach for Feature Selection in Cancer Classification -- Basic VNS for a Variant of the Online Order Batching Problem -- A VNS-Based Algorithm for the Mammography Unit Location Problem -- A Hybrid Heuristic Algorithm for the Dial-a-Ride Problem -- Multi-Objective Basic Variable Neighborhood Search for Portfolio Selection -- Local Search Approach for the (r|p)-Centroid Problem Under ℓ1 Metric -- Optimization of Maintenance Planning and Routing Problems -- Variable Neighborhood Search for Identical Parallel Machine Scheduling Problem with a Single Server -- Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem -- A Variable Neighborhood Search Algorithmic Approach for Estimating MDHMM Parameters and Application in Credit Risk Evaluation for Online Peer-to-Peer (P2P) Lending -- A Multi-Objective Metaheuristic for a Green UAV Grid Routing Problem -- A VNS Approach for Batch Sequencing and Route Planning in Manual Picking System with Time Windows -- Daily Scheduling and Routing of Home Health Care with Multiple Availability Periods of Patients. |
Record Nr. | UNINA-9910409673703321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|