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.
Application of a hybrid generation/utility assessment heuristic to a class of scheduling problems [[electronic resource] /] / Ann O. Heyward
| Application of a hybrid generation/utility assessment heuristic to a class of scheduling problems [[electronic resource] /] / Ann O. Heyward |
| Autore | Heyward Ann O |
| Pubbl/distr/stampa | Cleveland, Ohio : , : NASA, Lewis Research Center, , [1989] |
| Descrizione fisica | 1 online resource (10 pages) : illustrations |
| Collana | NASA technical memorandum |
| Soggetto topico |
Decision theory
Heuristic methods Problem solving Scheduling Sequencing Heuristic programming |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910701454803321 |
Heyward Ann O
|
||
| Cleveland, Ohio : , : NASA, Lewis Research Center, , [1989] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Engineering optimization [[electronic resource] ] : an introduction with metaheuristic applications / / Xin-She Yang
| Engineering optimization [[electronic resource] ] : an introduction with metaheuristic applications / / Xin-She Yang |
| Autore | Yang Xin-She |
| Pubbl/distr/stampa | Hoboken, NJ, : Wiley, c2010 |
| Descrizione fisica | 1 online resource (377 p.) |
| Disciplina | 620.001/5196 |
| Soggetto topico |
Heuristic programming
Mathematical optimization Engineering mathematics |
| ISBN |
1-282-70777-9
9786612707773 0-470-64042-1 0-470-64041-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Engineering Optimization: An Introduction with Metaheuristic Applications; CONTENTS; List of Figures; Preface; Acknowledgments; Introduction; PART I FOUNDATIONS OF OPTIMIZATION AND ALGORITHMS; 1 A Brief History of Optimization; 1.1 Before 1900; 1.2 Twentieth Century; 1.3 Heuristics and Metaheuristics; Exercises; 2 Engineering Optimization; 2.1 Optimization; 2.2 Type of Optimization; 2.3 Optimization Algorithms; 2.4 Metaheuristics; 2.5 Order Notation; 2.6 Algorithm Complexity; 2.7 No Free Lunch Theorems; Exercises; 3 Mathematical Foundations; 3.1 Upper and Lower Bounds; 3.2 Basic Calculus
3.3 Optimality3.3.1 Continuity and Smoothness; 3.3.2 Stationary Points; 3.3.3 Optimality Criteria; 3.4 Vector and Matrix Norms; 3.5 Eigenvalues and Definiteness; 3.5.1 Eigenvalues; 3.5.2 Definiteness; 3.6 Linear and Affine Functions; 3.6.1 Linear Functions; 3.6.2 Affine Functions; 3.6.3 Quadratic Form; 3.7 Gradient and Hessian Matrices; 3.7.1 Gradient; 3.7.2 Hessian; 3.7.3 Function approximations; 3.7.4 Optimality of multivariate functions; 3.8 Convexity; 3.8.1 Convex Set; 3.8.2 Convex Functions; Exercises; 4 Classic Optimization Methods I; 4.1 Unconstrained Optimization 4.2 Gradient-Based Methods4.2.1 Newton's Method; 4.2.2 Steepest Descent Method; 4.2.3 Line Search; 4.2.4 Conjugate Gradient Method; 4.3 Constrained Optimization; 4.4 Linear Programming; 4.5 Simplex Method; 4.5.1 Basic Procedure; 4.5.2 Augmented Form; 4.6 Nonlinear Optimization; 4.7 Penalty Method; 4.8 Lagrange Multipliers; 4.9 Karush-Kuhn-Tucker Conditions; Exercises; 5 Classic Optimization Methods II; 5.1 BFGS Method; 5.2 Nelder-Mead Method; 5.2.1 A Simplex; 5.2.2 Nelder-Mead Downhill Simplex; 5.3 Trust-Region Method; 5.4 Sequential Quadratic Programming; 5.4.1 Quadratic Programming 5.4.2 Sequential Quadratic ProgrammingExercises; 6 Convex Optimization; 6.1 KKT Conditions; 6.2 Convex Optimization Examples; 6.3 Equality Constrained Optimization; 6.4 Barrier Functions; 6.5 Interior-Point Methods; 6.6 Stochastic and Robust Optimization; Exercises; 7 Calculus of Variations; 7.1 Euler-Lagrange Equation; 7.1.1 Curvature; 7.1.2 Euler-Lagrange Equation; 7.2 Variations with Constraints; 7.3 Variations for Multiple Variables; 7.4 Optimal Control; 7.4.1 Control Problem; 7.4.2 Pontryagin's Principle; 7.4.3 Multiple Controls; 7.4.4 Stochastic Optimal Control; Exercises 8 Random Number Generators8.1 Linear Congruential Algorithms; 8.2 Uniform Distribution; 8.3 Other Distributions; 8.4 Metropolis Algorithms; Exercises; 9 Monte Carlo Methods; 9.1 Estimating π; 9.2 Monte Carlo Integration; 9.3 Importance of Sampling; Exercises; 10 Random Walk and Markov Chain; 10.1 Random Process; 10.2 Random Walk; 10.2.1 ID Random Walk; 10.2.2 Random Walk in Higher Dimensions; 10.3 Lévy Flights; 10.4 Markov Chain; 10.5 Markov Chain Monte Carlo; 10.5.1 Metropolis-Hastings Algorithms; 10.5.2 Random Walk; 10.6 Markov Chain and Optimisation; Exercises PART II METAHEURISTIC ALGORITHMS |
| Record Nr. | UNINA-9910140843303321 |
|
Yang Xin-She
|
||
| Hoboken, NJ, : Wiley, c2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Engineering optimization : an introduction with metaheuristic applications / / Xin-She Yang
| Engineering optimization : an introduction with metaheuristic applications / / Xin-She Yang |
| Autore | Yang Xin-She |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Hoboken, NJ, : Wiley, c2010 |
| Descrizione fisica | 1 online resource (377 p.) |
| Disciplina | 620.001/5196 |
| Soggetto topico |
Heuristic programming
Mathematical optimization Engineering mathematics |
| ISBN |
9786612707773
9781282707771 1282707779 9780470640425 0470640421 9780470640418 0470640413 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Engineering Optimization: An Introduction with Metaheuristic Applications; CONTENTS; List of Figures; Preface; Acknowledgments; Introduction; PART I FOUNDATIONS OF OPTIMIZATION AND ALGORITHMS; 1 A Brief History of Optimization; 1.1 Before 1900; 1.2 Twentieth Century; 1.3 Heuristics and Metaheuristics; Exercises; 2 Engineering Optimization; 2.1 Optimization; 2.2 Type of Optimization; 2.3 Optimization Algorithms; 2.4 Metaheuristics; 2.5 Order Notation; 2.6 Algorithm Complexity; 2.7 No Free Lunch Theorems; Exercises; 3 Mathematical Foundations; 3.1 Upper and Lower Bounds; 3.2 Basic Calculus
3.3 Optimality3.3.1 Continuity and Smoothness; 3.3.2 Stationary Points; 3.3.3 Optimality Criteria; 3.4 Vector and Matrix Norms; 3.5 Eigenvalues and Definiteness; 3.5.1 Eigenvalues; 3.5.2 Definiteness; 3.6 Linear and Affine Functions; 3.6.1 Linear Functions; 3.6.2 Affine Functions; 3.6.3 Quadratic Form; 3.7 Gradient and Hessian Matrices; 3.7.1 Gradient; 3.7.2 Hessian; 3.7.3 Function approximations; 3.7.4 Optimality of multivariate functions; 3.8 Convexity; 3.8.1 Convex Set; 3.8.2 Convex Functions; Exercises; 4 Classic Optimization Methods I; 4.1 Unconstrained Optimization 4.2 Gradient-Based Methods4.2.1 Newton's Method; 4.2.2 Steepest Descent Method; 4.2.3 Line Search; 4.2.4 Conjugate Gradient Method; 4.3 Constrained Optimization; 4.4 Linear Programming; 4.5 Simplex Method; 4.5.1 Basic Procedure; 4.5.2 Augmented Form; 4.6 Nonlinear Optimization; 4.7 Penalty Method; 4.8 Lagrange Multipliers; 4.9 Karush-Kuhn-Tucker Conditions; Exercises; 5 Classic Optimization Methods II; 5.1 BFGS Method; 5.2 Nelder-Mead Method; 5.2.1 A Simplex; 5.2.2 Nelder-Mead Downhill Simplex; 5.3 Trust-Region Method; 5.4 Sequential Quadratic Programming; 5.4.1 Quadratic Programming 5.4.2 Sequential Quadratic ProgrammingExercises; 6 Convex Optimization; 6.1 KKT Conditions; 6.2 Convex Optimization Examples; 6.3 Equality Constrained Optimization; 6.4 Barrier Functions; 6.5 Interior-Point Methods; 6.6 Stochastic and Robust Optimization; Exercises; 7 Calculus of Variations; 7.1 Euler-Lagrange Equation; 7.1.1 Curvature; 7.1.2 Euler-Lagrange Equation; 7.2 Variations with Constraints; 7.3 Variations for Multiple Variables; 7.4 Optimal Control; 7.4.1 Control Problem; 7.4.2 Pontryagin's Principle; 7.4.3 Multiple Controls; 7.4.4 Stochastic Optimal Control; Exercises 8 Random Number Generators8.1 Linear Congruential Algorithms; 8.2 Uniform Distribution; 8.3 Other Distributions; 8.4 Metropolis Algorithms; Exercises; 9 Monte Carlo Methods; 9.1 Estimating π; 9.2 Monte Carlo Integration; 9.3 Importance of Sampling; Exercises; 10 Random Walk and Markov Chain; 10.1 Random Process; 10.2 Random Walk; 10.2.1 ID Random Walk; 10.2.2 Random Walk in Higher Dimensions; 10.3 Lévy Flights; 10.4 Markov Chain; 10.5 Markov Chain Monte Carlo; 10.5.1 Metropolis-Hastings Algorithms; 10.5.2 Random Walk; 10.6 Markov Chain and Optimisation; Exercises PART II METAHEURISTIC ALGORITHMS |
| Record Nr. | UNINA-9910814521403321 |
|
Yang Xin-She
|
||
| Hoboken, NJ, : Wiley, c2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Engineering stochastic local search algorithms : designing, implementing and analyzing effective heuristics ; second international workshop, SLS 2009, Brussels, Belgium, September 3-4, 2009 ; proceedings / / Thomas Stutzle, Mauro Birattari, Holger H. Hoos (eds.)
| Engineering stochastic local search algorithms : designing, implementing and analyzing effective heuristics ; second international workshop, SLS 2009, Brussels, Belgium, September 3-4, 2009 ; proceedings / / Thomas Stutzle, Mauro Birattari, Holger H. Hoos (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2009 |
| Descrizione fisica | 1 online resource (X, 155 p.) |
| Disciplina | 005.11 |
| Altri autori (Persone) |
BirattariMauro
HoosHolger H StutzleThomas |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer algorithms
Electronic information resource searching Heuristic programming Search theory Stochastic programming Recursos electrònics en xarxa Cerca a Internet Programació estocàstica |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-642-03751-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | High-Performance Local Search for Task Scheduling with Human Resource Allocation -- High-Performance Local Search for Task Scheduling with Human Resource Allocation -- On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms -- Estimating Bounds on Expected Plateau Size in MAXSAT Problems -- A Theoretical Analysis of the k-Satisfiability Search Space -- Loopy Substructural Local Search for the Bayesian Optimization Algorithm -- Running Time Analysis of ACO Systems for Shortest Path Problems -- Techniques and Tools for Local Search Landscape Visualization and Analysis -- Short Papers -- High-Performance Local Search for Solving Real-Life Inventory Routing Problems -- A Detailed Analysis of Two Metaheuristics for the Team Orienteering Problem -- On the Explorative Behavior of MAX–MIN Ant System -- A Study on Dominance-Based Local Search Approaches for Multiobjective Combinatorial Optimization -- A Memetic Algorithm for the Multidimensional Assignment Problem -- Autonomous Control Approach for Local Search -- EasyGenetic: A Template Metaprogramming Framework for Genetic Master-Slave Algorithms -- Adaptive Operator Selection for Iterated Local Search -- Improved Robustness through Population Variance in Ant Colony Optimization -- Mixed-Effects Modeling of Optimisation Algorithm Performance. |
| Altri titoli varianti | SLS 2009 |
| Record Nr. | UNINA-9910485017403321 |
| Berlin ; ; New York, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Heuristic scheduling systems : with applications to production systems and project management / Thomas E. Morton and David W. Pentico
| Heuristic scheduling systems : with applications to production systems and project management / Thomas E. Morton and David W. Pentico |
| Autore | Morton, Thomas E., 1937- |
| Pubbl/distr/stampa | New York : Wiley, c1993 |
| Descrizione fisica | xiv, 695 p. : ill. ; 25 cm. + floppy |
| Disciplina | 658.5 |
| Altri autori (Persone) | Pentico, David W. |
| Collana | Wiley series in engineering & technology management |
| Soggetto topico |
Production control
Production scheduling Heuristic programming |
| ISBN | 0471578193 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991001521849707536 |
|
Morton, Thomas E., 1937-
|
||
| New York : Wiley, c1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Hybrid metaheuristics : 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010 : proceedings / / Maria J. Blesa ... [et al.], (eds.)
| Hybrid metaheuristics : 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010 : proceedings / / Maria J. Blesa ... [et al.], (eds.) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (X, 223 p. 43 illus.) |
| Disciplina | 006.3 |
| Altri autori (Persone) | BlesaMaria J |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico | Heuristic programming |
| ISBN |
1-280-38941-9
9786613567338 3-642-16053-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Hybrid Metaheuristic for the Longest Common Subsequence Problem -- Hybrid Algorithms for the Variable Sized Bin Packing Problem -- A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model -- A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem -- A New Approach for Solving the Generalized Traveling Salesman Problem -- Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem -- A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem -- A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents -- New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem -- An Improved Memetic Algorithm for Break Scheduling -- Consultant-Guided Search Algorithms for the Quadratic Assignment Problem -- On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem -- Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem -- SearchCol: Metaheuristic Search by Column Generation -- Survey: Matheuristics for Rich Vehicle Routing Problems. |
| Record Nr. | UNINA-9910483139203321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Hybrid metaheuristics : 6th international workshop, HM 2009, Udine, Italy, October 16-17, 2009, proceedings / / Maria J. Blesa ... [et al.] (eds.)
| Hybrid metaheuristics : 6th international workshop, HM 2009, Udine, Italy, October 16-17, 2009, proceedings / / Maria J. Blesa ... [et al.] (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, : Springer-Verlag, c2009 |
| Descrizione fisica | 1 online resource (X, 179 p.) |
| Disciplina | 006.312 |
| Altri autori (Persone) | BlesaMaria J |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Heuristic programming
Programming (Mathematics) |
| ISBN | 3-642-04918-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem -- An ELSxPath Relinking Hybrid for the Periodic Location-Routing Problem -- Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling -- Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows -- A Hybridization of Electromagnetic-Like Mechanism and Great Deluge for Examination Timetabling Problems -- Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem -- Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search -- Effective Hybrid Stochastic Local Search Algorithms for Biobjective Permutation Flowshop Scheduling -- Hierarchical Iterated Local Search for the Quadratic Assignment Problem -- Incorporating Tabu Search Principles into ACO Algorithms -- A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal ?+?+? -- Multi-neighborhood Local Search for the Patient Admission Problem -- Matheuristics: Optimization, Simulation and Control. |
| Record Nr. | UNINA-9910484293603321 |
| Berlin, : Springer-Verlag, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Hybrid metaheuristics : 4th international workshop, HM 2007, Dortmund, Germany, October 8-9, 2007 : proceedings / / Thomas Bartz-Beielstein ... [et al.] (eds.)
| Hybrid metaheuristics : 4th international workshop, HM 2007, Dortmund, Germany, October 8-9, 2007 : proceedings / / Thomas Bartz-Beielstein ... [et al.] (eds.) |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2007 |
| Descrizione fisica | 1 online resource (X, 201 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) | Bartz-BeielsteinThomas |
| Collana |
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Lecture notes in computer science |
| Soggetto topico | Heuristic programming |
| ISBN | 3-540-75514-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem -- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem -- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems -- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP -- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem -- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop -- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy -- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case -- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement -- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge -- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric -- A Hybrid VNS for Connected Facility Location -- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem -- Hybrid Numerical Optimization for Combinatorial Network Problems. |
| Altri titoli varianti | HM 2007 |
| Record Nr. | UNINA-9910484172003321 |
| Berlin ; ; New York, : Springer, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Hybrid metaheuristics : third international workshop, HM 2006, Gran Canaria, Spain, October 13-14, 2006 : proceedings / / Francisco Almeida ... [et al.] (eds.)
| Hybrid metaheuristics : third international workshop, HM 2006, Gran Canaria, Spain, October 13-14, 2006 : proceedings / / Francisco Almeida ... [et al.] (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2006 |
| Descrizione fisica | 1 online resource (X, 193 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) | AlmeidaFrancisco (Almeida Rodriguez) |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico | Heuristic programming |
| ISBN | 3-540-46385-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Unified View on Hybrid Metaheuristics -- Packing Problems with Soft Rectangles -- A Multi-population Parallel Genetic Algorithm for Highly Constrained Continuous Galvanizing Line Scheduling -- Improvement in the Performance of Island Based Genetic Algorithms Through Path Relinking -- Using Datamining Techniques to Help Metaheuristics: A Short Survey -- An Iterated Local Search Heuristic for a Capacitated Hub Location Problem -- Using Memory to Improve the VNS Metaheuristic for the Design of SDH/WDM Networks -- Multi-level Ant Colony Optimization for DNA Sequencing by Hybridization -- Hybrid Approaches for Rostering: A Case Study in the Integration of Constraint Programming and Local Search -- A Reactive Greedy Randomized Variable Neighborhood Tabu Search for the Vehicle Routing Problem with Time Windows -- Incorporating Inference into Evolutionary Algorithms for Max-CSP -- Scheduling Social Golfers with Memetic Evolutionary Programming -- Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem -- Investigation of One-Go Evolution Strategy/Quasi-Newton Hybridizations. |
| Altri titoli varianti | HM 2006 |
| Record Nr. | UNINA-9910483408203321 |
| Berlin ; ; New York, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Hybrid metaheuristics : second international workshop, HM 2005, Barcelona, Spain, August 29-30, 2005 : proceedings / / Maria J. Blesa ... [et al.] (eds.)
| Hybrid metaheuristics : second international workshop, HM 2005, Barcelona, Spain, August 29-30, 2005 : proceedings / / Maria J. Blesa ... [et al.] (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XII, 155 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) | BlesaMaria J |
| Collana | Lecture notes in computer science |
| Soggetto topico | Heuristic programming |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Comparing Parallelization of an ACO: Message Passing vs. Shared Memory -- An LP-Based Hybrid Heuristic Procedure for the Generalized Assignment Problem with Special Ordered Sets -- Parametrized Greedy Heuristics in Theory and Practice -- A Taxonomy of Cooperative Search Algorithms -- A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem -- A Hybrid Meta-heuristic Approach for Natural Gas Pipeline Network Optimization -- Hybrid Tabu Search for Lot Sizing Problems -- Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows -- 3D Inter-subject Medical Image Registration by Scatter Search -- Evolution Strategies and Threshold Selection -- A Hybrid GRASP with Data Mining for the Maximum Diversity Problem -- A New Multi-objective Particle Swarm Optimization Algorithm Using Clustering Applied to Automated Docking -- A Hybrid GRASP-Path Relinking Algorithm for the Capacitated p – hub Median Problem. |
| Altri titoli varianti | HM 2005 |
| Record Nr. | UNINA-9910484324203321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
