Cantitate/Preț
Produs
Total produse
Vezi coșul
Variable Neighborhood Search: 7th International Conference, ICVNS 2019, Rabat, Morocco, October 3–5, 2019, Revised Selected Papers de Rachid Benmansour

Variable Neighborhood Search: 7th International Conference, ICVNS 2019, Rabat, Morocco, October 3–5, 2019, Revised Selected Papers: Lecture Notes in Computer Science, cartea 12010

Editat de Rachid Benmansour, Angelo Sifaleras, Nenad Mladenović
en Limba Engleză Paperback – 8 apr 2020
This volume constitutes the post- conference proceedings of the 7th International Conference on Variable Neighborhood Search, ICVNS 2019, held in Rabat, Morocco, in October 2019.
The 13 full papers presented in this volume were carefully reviewed and selected from 46 submissions. The papers describe recent advances in methods and applications of variable neighborhood search. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32149 lei

Preț vechi: 40187 lei
-20% Nou

Puncte Express: 482
Preț estimativ în valută:
6153€ • 6391$ • 5111£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030449315
ISBN-10: 3030449319
Pagini: 195
Ilustrații: X, 195 p. 49 illus., 29 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.3 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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 withTime Windows.- Daily Scheduling and Routing of Home Health Care with Multiple Availability Periods of Patients.