default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th MIC 2024: Lorient, France - Part I
- Marc Sevaux, Alexandru-Liviu Olteanu, Eduardo G. Pardo
, Angelo Sifaleras, Salma Makboul:
Metaheuristics - 15th International Conference, MIC 2024, Lorient, France, June 4-7, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14753, Springer 2024, ISBN 978-3-031-62911-2
Advances in Combinatorial Optimization
- He Zheng, Jin-Kao Hao:
Breakout Local Search for Heaviest Subgraph Problem. 3-8 - Sergio Pérez-Peló, Jesús Sánchez-Oro, Abraham Duarte:
A Biased Random Key Genetic Algorithm for Solving the α-Neighbor p-Center Problem. 9-14 - Antonio Augusto Chaves, Mauricio G. C. Resende, Ricardo M. A. Silva:
A Continuous-GRASP Random-Key Optimizer. 15-20 - Nozomi Kotake, Rikuto Shibutani, Kazuma Nakajima, Takafumi Matsuura, Takayuki Kimura:
Adaptive Ant Colony Optimization Using Node Clustering with Simulated Annealing. 21-27 - Jean-Philippe Gayon, Philippe Lacomme, Oussama Amine:
Job-Shop Scheduling with Robot Synchronization for Transport Operations. 28-42
AI and Metaheuristics for Routing
- Olaide Nathaniel Oyelade, Absalom E. Ezugwu, Apu Kumar Saha:
SIRO: A Deep Learning-Based Next-Generation Optimizer for Solving Global Optimization Problems. 45-61 - Clément Legrand, Diego Cattaruzza, Laetitia Jourdan, Marie-Eléonore Kessaci:
Investigation of the Benefit of Extracting Patterns from Local Optima to Solve a Bi-objective VRPTW. 62-77 - Ethan Gibbons, Beatrice M. Ombuki-Berman:
A Memetic Algorithm for Large-Scale Real-World Vehicle Routing Problems with Simultaneous Pickup and Delivery with Time Windows. 78-92 - Takafumi Matsuura:
Tabu Search for Solving Covering Salesman Problem with Nodes and Segments. 93-99
GRASP with Path Relinking
- Miguel Reula, Consuelo Parreño-Torres, Anna Martínez-Gavara, Rafael Martí:
VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem. 103-109
Meta-Heuristics for Preference Learning
- Yann Jourdin, Arwa Khannoussi, Alexandru-Liviu Olteanu, Patrick Meyer:
A Simulated Annealing Algorithm to Learn an RMP Preference Model. 113-119
New VRP and Extensions
- Katyanne Farias, Philippe Lacomme, Diego Perdigão Martino:
Iterative Heuristic over Periods for the Inventory Routing Problem. 123-135 - Roberto Montemanni, Mauro Dell'Amico, Andrea Corsini:
Combining Heuristics and Constraint Programming for the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones. 136-142
Operations Research for Health Care
- Ruan Myller Magalhães de Oliveira, Manuel Iori, Arthur Kramer, Thiago Alves de Queiroz:
A Re-optimization Heuristic for a Dial-a-Ride Problem in the Transportation of Patients. 145-157 - Eugenia Zanazzo, Sara Ceschia, Andrea Schaerf:
Solving the Integrated Patient-to-Room and Nurse-to-Patient Assignment by Simulated Annealing. 158-163 - Sara Ceschia, Luca Di Gaspero, Simona Mancini, Vittorio Maniezzo, Roberto Montemanni, Roberto Maria Rosati, Andrea Schaerf:
Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling. 164-170 - Salma Makboul:
Solving the Two-Stage Robust Elective Patient Surgery Planning Under Uncertainties with Intensive Care Unit Beds Availability. 171-177 - Julie Jacques, Alexander Bassett:
Extracting White-Box Knowledge from Word Embedding: Modeling as an Optimization Problem. 178-183 - Ana Raquel de Aguiar, Maria Isabel Gomes Salema, Tânia Rodrigues Pereira Ramos, Helena Ramalhinho:
A Hybrid Biased-Randomized Heuristic for a Home Care Problem with Team Scheme Selection. 184-189
Optimization for Forecasting
- Vittorio Maniezzo:
Extended Set Covering for Time Series Segmentation. 193-199
Quantum Meta-Heuristic for Operations Research
- Gérard Fleury, Philippe Lacomme, Caroline Prodhon:
Indirect Flow-Shop Coding Using Rank: Application to Indirect QAOA. 203-218 - Vorapong Suppakitpaisarn, Jin-Kao Hao:
Utilizing Graph Sparsification for Pre-processing in Max Cut QUBO Solver. 219-233 - Riad Aggoune, Samuel Deleplanque:
Addressing Machine Unavailability in Job Shop Scheduling: A Quantum Computing Approach. 234-245 - Nguyen Ha Huy Phuc, Viet Hung Nguyen, Anh Son Ta:
Solving Edge-Weighted Maximum Clique Problem with DCA Warm-Start Quantum Approximate Optimization Algorithm. 246-261 - Philippe Codognet:
Comparing Integer Encodings in QUBO for Quantum and Digital Annealing: The Travelling Salesman Problem. 262-267 - Nguyen Ha Huy Phuc, Viet Hung Nguyen, Anh Son Ta:
Solving Quadratic Knapsack Problem with Biased Quantum State Optimization Algorithm. 268-280 - Gérard Fleury, Bogdan Vulpescu, Philippe Lacomme:
Quantum Optimization Approach for Feature Selection in Machine Learning. 281-288
International Conference on Variable Neighborhood Search (ICVNS)
- Oualid Benbrik, Rachid Benmansour, Abdelhak Elidrissi, Angelo Sifaleras:
Advanced Algorithms for the Reclaimer Scheduling Problem with Sequence-Dependent Setup Times and Availability Constraints. 291-308 - Raúl Martín-Santamaría, Alberto Herrán, Abraham Duarte, J. Manuel Colmenar:
An Efficient Algorithm for the T-Row Facility Layout Problem. 309-315 - Pierre Hansen, Aidan Riordan, Xavier Hansen:
Interpretability, Adaptability and Scalability of Variable Neighborhood Search. 316-330 - Sergio Gil-Borrás, Eduardo G. Pardo:
Exploring the Integration of General Variable Neighborhood Search with Exact Procedures for the Optimization of the Order Batching Problem. 331-343 - Tatjana Davidovic, Slobodan Jelic:
VNS-Based Matheuristic Approach to Group Steiner Tree with Problem-Specific Node Release Strategy. 344-358 - Sérgio Salazar, Abraham Duarte, J. Manuel Colmenar:
A Basic Variable Neighborhood Search for the Planar Obnoxious Facility Location Problem. 359-364 - Panagiotis Kalatzantonakis, Angelo Sifaleras, Nikolaos Samaras:
Temporal Action Analysis in Metaheuristics: A Machine Learning Approach. 365-370 - Marcos Robles, Sergio Cavero, Eduardo G. Pardo:
A Variable Neighborhood Search Approach for the S-labeling Problem. 371-376 - Alejandra Casado, Jesús Sánchez-Oro, Anna Martínez-Gavara, Abraham Duarte:
Improving Biased Random Key Genetic Algorithm with Variable Neighborhood Search for the Weighted Total Domination Problem. 377-382 - Javier Yuste, Eduardo G. Pardo, Abraham Duarte:
Optimization of Fairness and Accuracy on Logistic Regression Models. 383-389 - Sergio Cavero, J. Manuel Colmenar, Eduardo G. Pardo:
A Variable Formulation Search Approach for Three Graph Layout Problems. 390-396
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-20 21:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
