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.
Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications / / Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.)
| Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications / / Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | New York, : Springer, 2006 |
| Descrizione fisica | 1 online resource (VII, 349 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
BampisEvripidis
JansenKlaus KenyonClaire |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer algorithms
Online algorithms Combinatorial optimization - Data processing |
| ISBN | 3-540-32213-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees -- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow -- Independence and Coloring Problems on Intersection Graphs of Disks -- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications -- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines -- Approximating a Class of Classification Problems -- List Scheduling in Order of ?-Points on a Single Machine -- Approximation Algorithms for the k-Median Problem -- The Lovász-Local-Lemma and Scheduling. |
| Record Nr. | UNINA-9910484229603321 |
| New York, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Evolutionary computation in combinatorial optimization : 10th European conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010 : proceedings / / Peter Cowling, Peter Merz (eds.)
| Evolutionary computation in combinatorial optimization : 10th European conference, EvoCOP 2010, Istanbul, Turkey, April 7-9, 2010 : proceedings / / Peter Cowling, Peter Merz (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | New York, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XII, 290 p. 67 illus.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
CowlingPeter I (Peter Ivan)
MerzPeter, Dr.-Ing. |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Evolutionary programming (Computer science)
Evolutionary computation Combinatorial optimization - Data processing Genetic algorithms |
| ISBN |
1-280-38599-5
9786613563910 3-642-12139-X |
| Classificazione |
54.10
31.12 31.76 30.10 DAT 718f MAT 913f MAT 919f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling -- Heuristic and Exact Methods for the Discrete (r |p)-Centroid Problem -- On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme -- A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study -- Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems -- A Genetic Algorithm to Minimize Chromatic Entropy -- Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings -- A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks -- Ant Colony Optimization for Tree Decompositions -- Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times -- Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures -- Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systems -- The Office-Space-Allocation Problem in Strongly Hierarchized Organizations -- A Study of Memetic Search with Multi-parent Combination for UBQP -- Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing -- A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centres -- Geometric Generalization of the Nelder-Mead Algorithm -- Guided Ejection Search for the Pickup and Delivery Problem with Time Windows -- An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principles -- Multilevel Variable Neighborhood Search for Periodic Routing Problems -- Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive -- A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem -- Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem -- Efficient Cycle Search for the Minimum Routing Cost Spanning Tree Problem. |
| Altri titoli varianti | EvoCOP 2010 |
| Record Nr. | UNINA-9910483991103321 |
| New York, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Evolutionary computation in combinatorial optimization : 9th European conference, EvoCOP 2009, Tubingen, Germany, April 15-17, 2009 : proceedings / / Carlos Cotta, Peter Cowling (eds.)
| Evolutionary computation in combinatorial optimization : 9th European conference, EvoCOP 2009, Tubingen, Germany, April 15-17, 2009 : proceedings / / Carlos Cotta, Peter Cowling (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2009 |
| Descrizione fisica | 1 online resource (XIV, 253 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
CottaCarlos
CowlingPeter |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Combinatorial optimization - Data processing
Evolutionary computation Evolutionary programming (Computer science) Genetic algorithms |
| ISBN | 3-642-01009-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Critical Element-Guided Perturbation Strategy for Iterated Local Search -- A Genetic Algorithm for Net Present Value Maximization for Resource Constrained Projects -- A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse -- A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic -- A Plasmid Based Transgenetic Algorithm for the Biobjective Minimum Spanning Tree Problem -- A Tabu Search Algorithm with Direct Representation for Strip Packing -- An ACO Approach to Planning -- An Artificial Immune System for the Multi-Mode Resource-Constrained Project Scheduling Problem -- Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows -- Binary Exponential Back Off for Tabu Tenure in Hyperheuristics -- Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms -- Divide-And-Evolve Facing State-of-the-Art Temporal Planners during the 6 th International Planning Competition -- Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm -- Finding Balanced Incomplete Block Designs with Metaheuristics -- Guided Ejection Search for the Job Shop Scheduling Problem -- Improving Performance in Combinatorial Optimisation Using Averaging and Clustering -- Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks -- Metropolis and Symmetric Functions: A Swan Song -- Robustness Analysis in Evolutionary Multi-Objective Optimization Applied to VAR Planning in Electrical Distribution Networks -- Staff Scheduling with Particle Swarm Optimisation and Evolution Strategies -- University Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study. |
| Record Nr. | UNINA-9910485030803321 |
| Berlin ; ; New York, : Springer, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Evolutionary computation in combinatorial optimization : 8th European conference, EcoCOP 2008, Naples, Italy, March 26-28, 2008 : proceedings / / Jano van Hemert, Carlos Cotta (eds.)
| Evolutionary computation in combinatorial optimization : 8th European conference, EcoCOP 2008, Naples, Italy, March 26-28, 2008 : proceedings / / Jano van Hemert, Carlos Cotta (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2008 |
| Descrizione fisica | 1 online resource (XII, 292 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) |
Van HemertJano
CottaCarlos |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Evolutionary programming (Computer science)
Evolutionary computation Combinatorial optimization - Data processing Genetic algorithms |
| ISBN | 3-540-78604-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Adaptive Tabu Tenure Computation in Local Search -- A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems -- Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem -- Effective Neighborhood Structures for the Generalized Traveling Salesman Problem -- Efficient Local Search Limitation Strategies for Vehicle Routing Problems -- Evolutionary Local Search for the Minimum Energy Broadcast Problem -- Exploring Multi-objective PSO and GRASP-PR for Rule Induction -- An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem -- Graph Colouring Heuristics Guided by Higher Order Graph Properties -- A Hybrid Column Generation Approach for the Berth Allocation Problem -- Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem -- An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit -- An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem -- Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem -- Improving Metaheuristic Performance by Evolving a Variable Fitness Function -- Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach -- Inc*: An Incremental Approach for Improving Local Search Heuristics -- Metaheuristics for the Bi-objective Ring Star Problem -- Multiobjective Prototype Optimization with Evolved Improvement Steps -- Optimising Multiple Kernels for SVM by Genetic Programming -- Optimization of Menu Layouts by Means of Genetic Algorithms -- A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows -- Reactive Stochastic Local Search Algorithms for the Genomic Median Problem -- Solving Graph Coloring Problems Using Learning Automata. |
| Altri titoli varianti | EvoCOP 2008 |
| Record Nr. | UNINA-9910485049503321 |
| Berlin ; ; New York, : Springer, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : 5th international conference, CPAIOR 2008, Paris, France, May 20-23, 2008 : proceedings / / Laurent Perron, Michael A. Trick (eds.)
| Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : 5th international conference, CPAIOR 2008, Paris, France, May 20-23, 2008 : proceedings / / Laurent Perron, Michael A. Trick (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2008 |
| Descrizione fisica | 1 online resource (XII, 394 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) |
PerronLaurent
TrickMichael A |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Constraints (Artificial intelligence)
Constraint programming (Computer science) Combinatorial optimization - Data processing Operations research - Technique Artificial intelligence - Technique |
| ISBN | 3-540-68155-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Airline Scheduling: Accomplishments, Opportunities and Challenges -- Selected Challenges from Distribution and Commerce in the Airline and Travel Industry -- 30 Years of Constraint Programming -- Long Papers -- Constraint Integer Programming: A New Approach to Integrate CP and MIP -- New Filtering for the Constraint in the Context of Non-Overlapping Rectangles -- Multi-stage Benders Decomposition for Optimizing Multicore Architectures -- Fast and Scalable Domino Portrait Generation -- Gap Reduction Techniques for Online Stochastic Project Scheduling -- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver -- Cost Propagation – Numerical Propagation for Optimization Problems -- Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs -- Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting -- The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems -- A Novel Approach For Detecting Symmetries in CSP Models -- Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization -- Optimal Deployment of Eventually-Serializable Data Services -- Counting Solutions of Knapsack Constraints -- From High-Level Model to Branch-and-Price Solution in G12 -- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint -- Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic -- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem -- Short Papers -- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection -- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts -- A Hybrid Approach for Solving Shift-Selection and Task-Sequencing Problems -- Solving a Log-Truck Scheduling Problem with Constraint Programming -- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints -- Connections in Networks: A Hybrid Approach -- Efficient Haplotype Inference with Combined CP and OR Techniques -- Integration of CP and Compilation Techniques for Instruction Sequence Test Generation -- Propagating Separable Equalities in an MDD Store -- The Weighted Cfg Constraint -- CP with ACO -- A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract) -- Constraint Optimization and Abstraction for Embedded Intelligent Systems -- A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs -- Guiding Stochastic Search by Dynamic Learning of the Problem Topography -- Hybrid Variants for Iterative Flattening Search -- Global Propagation of Practicability Constraints -- The Polytope of Tree-Structured Binary Constraint Satisfaction Problems -- A Tabu Search Method for Interval Constraints -- The Steel Mill Slab Design Problem Revisited -- Filtering Atmost1 on Pairs of Set Variables -- Extended Abstract -- Mobility Allowance Shuttle Transit (MAST) Services: MIP Formulation and Strengthening with Logic Constraints. |
| Altri titoli varianti |
International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems
Integration of artificial intelligence and operations research techniques in constraint programming for combinatorial optimization problems CPAIOR 2008 |
| Record Nr. | UNINA-9910483327903321 |
| Berlin ; ; New York, : Springer, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Memetic computing
| Memetic computing |
| Pubbl/distr/stampa | Berlin : , : Springer, , 2009- |
| Descrizione fisica | 1 online resource |
| Disciplina | 006.3 |
| Soggetto topico |
Combinatorial optimization - Data processing
Optimisation combinatoire - Informatique |
| Soggetto genere / forma |
Periodical
periodicals. Periodicals. Périodiques. |
| Soggetto non controllato |
optimalisatiemethoden
optimization methods robots bioinformatics algoritmen algorithms kunstmatige intelligentie artificial intelligence heuristiek heuristics toegepaste wiskunde applied mathematics Bioinformatics (General) Applied Mathematics Bioinformatica (algemeen) Toegepaste wiskunde |
| ISSN | 1865-9292 |
| Formato | Materiale a stampa |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996211539803316 |
| Berlin : , : Springer, , 2009- | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Memetic computing
| Memetic computing |
| Pubbl/distr/stampa | Berlin : , : Springer, , 2009- |
| Descrizione fisica | 1 online resource |
| Disciplina | 006.3 |
| Soggetto topico |
Combinatorial optimization - Data processing
Optimisation combinatoire - Informatique Optimització combinatòria Algorismes computacionals Intel·ligència artificial |
| Soggetto genere / forma |
Periodical
periodicals. Periodicals. Périodiques. Revistes electròniques |
| ISSN | 1865-9292 |
| Formato | Materiale a stampa |
| Livello bibliografico | Periodico |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910249559503321 |
| Berlin : , : Springer, , 2009- | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
